Welcome to D
SIGMOD 2003
PODS 2003
SIGMOD-RECOR
ADBIS
CIDR 2003
CIKM 2003
DASFAA 2003
Data Enginee
DEBS
DMKD 2003
DOLAP 2003
DPDJ 2003
ER
GIS 2003
Hypertext 20
ICDE 2003
ICDM 2003
ICDT 2003
JCDL 2003
KRDB 2003
MIR 2003
MIS 2003
MMDB 2003
RIDE 2003
SBBD 2003
SIGIR 2003
SIGIR-FORUM
SIGKDD 2003
SIGKDD-EXP
SSDBM 2003
TIME 2003
TODS
VLDB 2003
VLDB Journal
WIDM 2003
About DiSC 2
Editorial Bo
Acknowledgem
DiSC 2004 Pr
ADVIS
DiSC'04 Feed
DiSC'04 Site
Search DiSC'
<<<Author Index>>>
Copyright No

Thomas Hofmann

Papers on DiSC'04


Text categorization by boosting automatically extracted concepts

Collaborative filtering via gaussian probabilistic latent semantic analysis

Challenges in Information Retrieval and Language Modeling

Publications


Note: Links lead to the DBLP on the Web.

Thomas Hofmann

Thomas Hofmann: Latent semantic models for collaborative filtering. ACM Trans. Inf. Syst. 22 (1): 89-115 (2004)

Yasemin Altun , Ioannis Tsochantaridis , Thomas Hofmann: Hidden Markov Support Vector Machines. ICML 2003 : 3-10

Massimiliano Ciaramita , Thomas Hofmann, Mark Johnson : Hierarchical Semantic Classification: Word Sense Disambiguation with World Knowledge. IJCAI 2003 : 817-822

Lijuan Cai , Thomas Hofmann: Text categorization by boosting automatically extracted concepts. SIGIR 2003 : 182-189

Thomas Hofmann: Collaborative filtering via gaussian probabilistic latent semantic analysis. SIGIR 2003 : 259-266

Stuart Andrews , Thomas Hofmann, Ioannis Tsochantaridis : Multiple Instance Learning with Generalized Support Vector Machines. AAAI/IAAI 2002 : 943-944

Ioannis Tsochantaridis , Thomas Hofmann: Support Vector Machines for Polycategorical Classification. ECML 2002 : 456-467

Scott Doniger , Thomas Hofmann, Miao-Hui Joanne Yeh : Predicting CNS Permeability of Drug Molecules: Comparison of Neural Network and Support Vector Machine Algorithms. Journal of Computational Biology 9 (6): 849 (2002)

Kristina Toutanova , Francine Chen , Kris Popat , Thomas Hofmann: Text Classification in a Hierarchical Mixture Model for Small Training Sets. CIKM 2001 : 105-112

Thomas Hofmann: Learning What People (Don't) Want. ECML 2001 : 214-225

Thomas Hofmann: Unsupervised Learning by Probabilistic Latent Semantic Analysis. Machine Learning 42 (1/2): 177-196 (2001)

Stéphane Ducasse , Thomas Hofmann, Oscar Nierstrasz : OpenSpaces: An Object-Oriented Framework for Reconfigurable Coordination Spaces. COORDINATION 2000 : 1-18

Keith Hall , Thomas Hofmann: Learning Curved Multinomial Subfamilies for Natural Language Processing and Information Retrieval. ICML 2000 : 351-358

David A. Cohn , Thomas Hofmann: The Missing Link - A Probabilistic Model of Document Content and Hypertext Connectivity. NIPS 2000 : 430-436

Thomas Hofmann: Learning probabilistic models of the Web. SIGIR 2000 : 369-371

Thomas Hofmann: ProbMap - A probabilistic approach for mapping large document collections. Intell. Data Anal. 4 (2): 149-164 (2000)

Jan Puzicha , Thomas Hofmann, Joachim M. Buhmann : A theory of proximity based clustering: structure detection by optimization. Pattern Recognition 33 (4): 617-634 (2000)

Jan Puzicha , Joachim M. Buhmann , Thomas Hofmann: Histogram Clustering for Unsupervised Image Segmentation. CVPR 1999 : 2602-2608

Thomas Hofmann: Probabilistic Topic Maps: Navigating through Large Text Collections. IDA 1999 : 161-172

Thomas Hofmann: The Cluster-Abstraction Model: Unsupervised Learning of Topic Hierarchies from Text Data. IJCAI 1999 : 682-687

Thomas Hofmann, Jan Puzicha : Latent Class Models for Collaborative Filtering. IJCAI 1999 : 688-693

Thomas Hofmann: Learning the Similarity of Documents: An Information-Geometric Approach to Document Retrieval and Categorization. NIPS 1999 : 914-920

Thomas Hofmann: Probabilistic Latent Semantic Indexing. SIGIR 1999 : 50-57

Thomas Hofmann: Probabilistic Latent Semantic Analysis. UAI 1999 : 289-296

Jan Puzicha , Thomas Hofmann, Joachim M. Buhmann : Histogram clustering for unsupervised segmentation and image retrieval. Pattern Recognition Letters 20 (9): 899-909 (1999)

Jan Puzicha , Joachim M. Buhmann , Thomas Hofmann: Discrete Mixture Models for Unsupervised Image Segmentation. DAGM-Symposium 1998 : 135-142

Thomas Hofmann, Jan Puzicha , Michael I. Jordan : Learning from Dyadic Data. NIPS 1998 : 466-472

Thomas Hofmann, Jan Puzicha , Joachim M. Buhmann : Unsupervised Texture Segmentation in a Deterministic Annealing Framework. IEEE Transactions on Pattern Analysis and Machine Intelligence 20 (8): 803-818 (1998)

Jan Puzicha , Thomas Hofmann, Joachim M. Buhmann : Non-parametric Similarity Measures for Unsupervised Texture Segmentation and Image Retrieval. CVPR 1997 : 267-272

Thomas Hofmann, Jan Puzicha , Joachim M. Buhmann : Deterministic Annealing for Unsupervised Texture Segmentation. EMMCVPR 1997 : 213-228

Thomas Hofmann, Jan Puzicha , Joachim M. Buhmann : An Optimization Approach to Unsupervised Hierarchical Texture Segmentation. ICIP (3) 1997 : 213-216

Thomas Hofmann, Joachim M. Buhmann : Active Data Clustering. NIPS 1997

Thomas Hofmann, Joachim M. Buhmann : Pairwise Data Clustering by Deterministic Annealing. IEEE Transactions on Pattern Analysis and Machine Intelligence 19 (1): 1-14 (1997)

Thomas Hofmann, Joachim M. Buhmann : Correction to "Pairwise Data Clustering by Deterministic Annealing". IEEE Transactions on Pattern Analysis and Machine Intelligence 19 (2): 192 (1997)

Thomas Hofmann, Joachim M. Buhmann : An Annealed ``Neural Gas'' Network for Robust Vector Quantization. ICANN 1996 : 151-156

Thomas Hofmann, Joachim M. Buhmann : Inferring Hierarchical Clustering Structures by Deterministic Annealing. KDD 1996 : 363-366

Joachim M. Buhmann , Wolfram Burgard , Armin B. Cremers , Dieter Fox , Thomas Hofmann, Frank E. Schneider , Jiannis Strikos , Sebastian Thrun : The Mobile Robot RHINO. AI Magazine 16 (2): 31-38 (1995)

Thomas Hofmann, Joachim M. Buhmann : Multidimensional Scaling and Data Clustering. NIPS 1994 : 459-466

Joachim M. Buhmann , Thomas Hofmann: Central and Pairwise Data Clustering by Competitive Neural Networks. NIPS 1993 : 104-111

1 [ 38 ]

2 [ 34 ]

3 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 14 ] [ 15 ] [ 22 ] [ 23 ]

4 [ 3 ]

5 [ 36 ]

6 [ 31 ]

7 [ 37 ]

8 [ 26 ]

9 [ 3 ]

10 [ 32 ]

11 [ 28 ]

12 [ 3 ]

13 [ 27 ]

14 [ 37 ]

15 [ 13 ]

16 [ 28 ]

17 [ 31 ]

18 [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 14 ] [ 15 ] [ 19 ] [ 22 ] [ 23 ]

19 [ 3 ]

20 [ 3 ]

21 [ 3 ]

22 [ 31 ]

23 [ 33 ] [ 34 ] [ 38 ]

24 [ 32 ]




©2004 Association for Computing Machinery