ACM Home Page
Please provide us with feedback. Feedback
Constructing informative prior distributions from domain knowledge in text classification
Full text PdfPdf (210 KB)
Source Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Seattle, Washington, USA
SESSION: Classification and machine learning table of contents
Pages: 493 - 500  
Year of Publication: 2006
ISBN:1-59593-369-7
Authors
Aynur Dayanik  Rutgers University, Piscataway, NJ
David D. Lewis  David D. Lewis Consulting, Chicago, IL
David Madigan  Rutgers University, Piscataway, NJ
Vladimir Menkov  Aqsaqal Enterprises, Penticton, B.C. Canada
Alexander Genkin  Rutgers University, Piscataway, NJ
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 25,   Downloads (12 Months): 201,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1148170.1148255
What is a DOI?

ABSTRACT

Supervised learning approaches to text classification are in practice often required to work with small and unsystematically collected training sets. The alternative to supervised learning is usually viewed to be building classifiers by hand, using a domain expert's understanding of which features of the text are related to the class of interest. This is expensive, requires a degree of sophistication about linguistics and classification, and makes it difficult to use combinations of weak predictors. We propose instead combining domain knowledge with training examples in a Bayesian framework. Domain knowledge is used to specify a prior distribution for the parameters of a logistic regression model, and labeled training data is used to produce a posterior distribution, whose mode we take as the final classifier. We show on three text categorization data sets that this approach can rescue what would otherwise be disastrously bad training situations, producing much more effective classifiers.


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
Medical Subject Headings -- Home Page, 2005. http://www.nlm.nih.gov/mesh.
 
2
 
3
B. Carlin and T. Louis. Bayes and Empirical Bayes Methods for Data Analysis. Chapman & Hall, London, 1996.
4
 
5
C. Chelba and A. Acero. Adaptation of maximum entropy capitalizer: Little data can help a lot. In EMNLP '04, 2004.
 
6
W. Cohen and D. Kudenko. Transferring and retraining learned information filters. In AAAI/IAAI '97, pages 583--590, 1997.
 
7
A. Dayanik, D. Fradkin, A. Genkin, P. Kantor, D. Lewis, D. Madigan, and V. Menkov. DIMACS at the TREC 2004 genomics track. In TREC '04, 2005.
8
 
9
E. Gabrilovich and S. Markovitch. Feature generation for text categorization using world knowledge. In IJCAI '05, pages 1048--1053, 2005.
 
10
A. Genkin, D. Lewis, and D. Madigan. Large-scale Bayesian logistic regression for text categorization. Technometrics, 2006. To appear.
 
11
W. Hersh, R. Bhuptiraju, L. Ross, A. Cohen, D. Kraemer, and P. Johnson. TREC 2004 genomics track overview. In TREC '04, 2004.
 
12
 
13
 
14
R. Jones, A. McCallum, K. Nigam, and E. Riloff. Bootstrapping for text learning tasks. In IJCAI '99 Workshop on Text Mining, 1999.
 
15
 
16
F. Li and Y. Yang. A loss function analysis for classification methods in text categorization. In ICML '03, pages 472--479, 2003.
 
17
B. Liu, X. Li, W. Lee, and P. Yu. Text classification by labeling words. In AAAI '04, 2004.
 
18
D. Madigan, J. Gavrin, and A. Raftery. Eliciting prior information to enhance the predictive performance of bayesian graphical models. Communications in Statistics - Theory and Methods, pages 2271--2292, 1995.
 
19
T. Meyer and B. Whateley. SpamBayes: Effective open-source, Bayesian based, email classification system. In CEAS '04, 2004.
 
20
K. Nigam, J. Lafferty, and A. McCallum. Using maximum entropy for text classification. In IJCAI'99 Workshop on Information Filtering, 1999.
 
21
M. Porter. An algorithm for suffix stripping. Program, 14(3):130--137, July 1980.
 
22
H. Raghavan, O. Madani, and R. Jones. Interactive feature selection. In IJCAI '05, pages 841--846, 2005.
 
23
 
24
 
25
 
26
27
28
 
29
R. Smith. Bayesian and frequentist approaches to parametric predictive inference (with discussion). In Bayesian Statistics 6. Oxford Univ. Press, 1999.
 
30
R. Tibshirani. Regression shrinkage and selection via the lasso. J. Royal Statistical Soc. B., 58:267--288, 1996.
 
31
32
33
 
34


Collaborative Colleagues:
Aynur Dayanik: colleagues
David D. Lewis: colleagues
David Madigan: colleagues
Vladimir Menkov: colleagues
Alexander Genkin: colleagues