ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Email classification with co-training
Full text PdfPdf (228 KB)
Source IBM Centre for Advanced Studies Conference archive
Proceedings of the 2001 conference of the Centre for Advanced Studies on Collaborative research table of contents
Toronto, Ontario, Canada
Page: 8  
Year of Publication: 2001
Authors
Svetlana Kiritchenko  School of Information Technology and Engineering, University of Ottawa, Ottawa, ON, Canada
Stan Matwin  School of Information Technology and Engineering, University of Ottawa, Ottawa, ON, Canada
Sponsors
NRC : National Research Council - Canada
IBM Canada : IBM Canada
Publisher
IBM Press 
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 96,   Citation Count: 15
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

Warning: The download time has expired please click on the item to try again.


ABSTRACT

The main problems in text classification are lack of labeled data, as well as the cost of labeling the unlabeled data. We address these problems by exploring co-training - an algorithm that uses unlabeled data along with a few labeled examples to boost the performance of a classifier. We experiment with co-training on the email domain. Our results show that the performance of co-training depends on the learning algorithm it uses. In particular, Support Vector Machines significantly outperforms Naive Bayes on email classification.


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
2
 
3
 
4
{4} William W. Cohen. Learning Rules that Classify Email. In Proc. of the AAAI Spring Simposium on Machine Learning in Information Access, 1996.
 
5
 
6
{6} A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society, Series B, 39(1):1-38, 1977.
 
7
{7} M. A. Hall. Correlation-based Feature Subset Selection for Machine Learning. PhD thesis, University of Waikato, 1998.
 
8
 
9
 
10
{10} Thorsten Joachims. The Maximum Margin Approach to Learning Text Classifiers: Methods, Theory, and Algorithms. PhD thesis, Universität Dortmund, 2000.
 
11
{11} George H. John and Pat Langley. Estimating Continuous Distributions in Bayesian Classifiers. In Proc. of the 11th Conference on Uncertainty in Artificial Intelligence , pages 338-345, Montreal, Quebec, Canada, 1995. Morgan Kaufmann.
 
12
{12} Ion Muslea, Steven Minton, and Craig A. Knoblock. Selective Sampling + Semi-Supervised Learning = Robust Multi-View Learning. In IJCAI-2001 Workshop "Text Learning: Beyond Supervision ", 2001.
13
 
14
{14} David Pierce and Claire Cardie. Limitations of Co-Training for Natural Language Learning from Large Datasets. In Proc. of the 2001 Conference on Empirical Methods in Natural Language Processing, CMU, Pittsburgh, PA, USA, 2001.
 
15
{15} M. Sahami, S. Dumais, D. Heckerman, and E. Horvitz. A Bayesian Approach to Filtering Junk E-mail. In AAAI-98 Workshop on Learning for Text Categorization, Madison, Wisconsin, USA, 1998.
 
16
17
 
18
 
19
{19} Werner Winiwarter. PEA - a Personal Email Assistant with Evolutionary Adaptation. International Journal of Information Technology, 5(1), 1999.
 
20
 
21

CITED BY  15

Collaborative Colleagues:
Svetlana Kiritchenko: colleagues
Stan Matwin: colleagues