ACM Home Page
Please provide us with feedback. Feedback
Text classification in a hierarchical mixture model for small training sets
Full text PdfPdf (1.40 MB)
Source Conference on Information and Knowledge Management archive
Proceedings of the tenth international conference on Information and knowledge management table of contents
Atlanta, Georgia, USA
Session: Text Extraction and Summarization table of contents
Pages: 105 - 113  
Year of Publication: 2001
ISBN:1-58113-436-3
Authors
Kristina Toutanova  Stanford University, Stanford, CA
Francine Chen  Xerox PARC, Palo Alto, CA
Kris Popat  Xerox PARC, Palo Alto, CA
Thomas Hofmann  Brown University, Providence, RI
Sponsors
SIGMIS: ACM Special Interest Group on Management Information Systems
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 65,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/502585.502604
What is a DOI?

ABSTRACT

Documents are commonly categorized into hierarchies of topics, such as the ones maintained by Yahoo! and the Open Directory project, in order to facilitate browsing and other interactive forms of information retrieval. In addition, topic hierarchies can be utilized to overcome the sparseness problem in text categorization with a large number of categories, which is the main focus of this paper. This paper presents a hierarchical mixture model which extends the standard naive Bayes classifier and previous hierarchical approaches. Improved estimates of the term distributions are made by differentiation of words in the hierarchy according to their level of generality/specificity. Experiments on the Newsgroups and the Reuters-21578 dataset indicate improved performance of the proposed classifier in comparison to other state-of-the-art methods on datasets with a small number of positive examples.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. D'Alessio, M. Murray, R. Schiaflino, and A. Kershenbaum. Category levels in hierarchical text categorization. In Proceedingf of EMNLP-3, 3rd Conference on Empirical Methods in Natural Language Processing, 1998.
2
3
 
4
5
 
6
 
7
F. Jelinek and R. Mercer. Interpolated estimation of Markov source parameters from sparse data. In S. Gelsema and L. Kanal, editors, Pattern Recognition in Practice, pages 381-402. North-Holland, 1980.
 
8
 
9
 
10
K. Lang. Newsweeder: Learning to filter netnews. In International Conference on Machine Learning, pages 331-339, 1995.
 
11
 
12
 
13
A. McCallum and K. Nigam. A comparison of event models for naive Bayes text classification. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-93), 1998.
 
14
 
15
 
16
 
17
18

CITED BY  12

Collaborative Colleagues:
Kristina Toutanova: colleagues
Francine Chen: colleagues
Kris Popat: colleagues
Thomas Hofmann: colleagues