Soft-supervised learning for text classification

EMNLP 2008 - 2008 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference: A Meeting of SIGDAT, a Special Interest Group of the ACL

Volumn , Issue , 2008, Pages 1090-1099

  Subramanya, Amarnag ^a   Bilmes, Jeff ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); GRAPHIC METHODS; LEARNING ALGORITHMS; MACHINE LEARNING; PROBABILITY DISTRIBUTIONS; SUPERVISED LEARNING; TEXT PROCESSING;

ALTERNATING MINIMIZATION; CLASS MEMBERSHIP PROBABILITIES; DOCUMENT CATEGORIZATION; GUARANTEED CONVERGENCE; KULLBACK LEIBLER DIVERGENCE; MULTI-CLASS PROBLEMS; SEMI-SUPERVISED LEARNING (SSL); WEIGHTED UNDIRECTED GRAPH;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 64749107977     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1613715.1613857     Document Type: Conference Paper

References (33)

1. Alexandrescu, A. and Kirchhoff, K. (2007). Data-driven graph construction for semi-supervised graph-based learnning in nlp. In Proc. of the Human Language Technologies Conference (HLT-NAACL).
2. Bekkerman, R., El-Yaniv, R., Tishby, N., and Winter, Y. (2003). Distributional word clusters vs. words for text categorization. J. Mach. Learn. Res., 3:1183-1208.
3. Belkin, M., Niyogi, P., and Sindhwani, V. (2005). On manifold regularization. In Proc. of the Conference on Artificial Intelligence and Statistics (AISTATS).
4. Bengio, Y., Delalleau, O., and Roux, N. L. (2007). Semi-Supervised Learning, chapter Label Propogation and Quadratic Criterion. MIT Press.
5. Bertsekas, D. (2004). Nonlinear Programming. Athena Scientific Publishing.
6. Blitzer, J. and Zhu, J. (2008). ACL 2008 tutorial on Semi-Supervised learning. http://ssl-acl08.wikidot.com/.
7. Blum, A. and Chawla, S. (2001). Learning from labeled and unlabeled data using graph mincuts. In Proc. 18th International Conf. on Machine Learning, pages 19-26. Morgan Kaufmann, San Francisco, CA.
8. Blum, A. and Mitchell, T. (1998). Combining labeled and unlabeled data with co-training. In COLT: Proceedings of the Workshop on Computational Learning Theory.
9. Chapelle, O., Scholkopf, B., and Zien, A. (2007). Semi-Supervised Learning. MIT Press.
10. Corduneanu, A. and Jaakkola, T. (2003). On information regularization. In Uncertainty in Artificial Intelligence.
11. Cover, T. M. and Thomas, J. A. (1991). Elements of Information Theory. Wiley Series in Telecommunications. Wiley, New York.
12. Csiszar, I. and Tusnady, G. (1984). Information Geometry and Alternating Minimization Procedures. Statistics and Decisions.
13. Dumais, S., Platt, J., Heckerman, D., and Sahami, M. (1998). Inductive learning algorithms and representations for text categorization. In CIKM '98: Proceedings of the seventh international conference on Information and knowledge management, New York, NY, USA.
14. Grandvalet, Y. and Bengio, Y. (2004). Semi-supervised learning by entropy minimization. In Advances in Neural Information Processing Systems (NIPS).
15. Joachims, T. SGT Light. http://sgt.joachims.org.
16. Joachims, T. SVM Light. http://svmlight.joachims.org.
17. Joachims, T. (1999). Transductive inference for text classification using support vector machines. In Proc. of the International Conference on Machine Learning (ICML).
18. Joachims, T. (2003). Transductive learning via spectral graph partitioning. In Proc. of the International Conference on Machine Learning (ICML).
19. Lewis, D. et al. (1987). Reuters-21578. http://www.daviddlewis.com/ resources/testcollections/reuters21578
20. Nigam, K., McCallum, A., Thrun, S., and Mitchell, T. (1998). Learning to classify text from labeled and unlabeled documents. In AAAI '98/IAAI '98: Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence, pages 792-799.
21. Pearl, J. (1990). Jeffrey's Rule, Passage of Experience and Neo-Bayesianism in Knowledge Representation and Defeasible Reasoning. Kluwer Academic Publishers.
22. Porter, M. (1980). An algorithm for suffix stripping. Program, 14(3):130-137.
23. Raghavan, V., Bollmann, P., and Jung, G. S. (1989). A critical investigation of recall and precision as measures of retrieval system performance. ACM Trans. Inf. Syst., 7(3):205-229.
24. Salton, G. and Buckley, C. (1987). Term weighting approaches in automatic text retrieval. Technical report, Ithaca, NY, USA.
25. Sindhwani, V., Niyogi, P., and Belkin, M. (2005). Beyond the point cloud: from transductive to semi-supervised learning. In Proc. of the International Conference on Machine Learning (ICML).
26. Szummer, M. and Jaakkola, T. (2001). Partially labeled classification with Markov random walks. In Advances in Neural Information Processing Systems, volume 14.
27. Tsuda, K. (2005). Propagating distributions on a hyper-graph by dual information regularization. In Proceedings of the 22nd International Conference on Machine Learning.
28. Wang, J., Jebara, T., and Chang, S.-F. (2008). Graph transduction via alternating minimization. In Proc. of the International Conference on Machine Learning (ICML).
29. Yarowsky, D. (1995). Unsupervised word sense disambiguation rivaling supervised methods. In Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics.
30. Zhu, X. (2005a). Semi-supervised learning literature survey. Technical Report 1530, Computer Sciences, University of Wisconsin-Madison.
31. Zhu, X. (2005b). Semi-Supervised Learning with Graphs. PhD thesis, Carnegie Mellon University.
32. Zhu, X. and Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical report, Carnegie Mellon University.
33. Zhu, X., Ghahramani, Z., and Lafferty, J. (2003). Semi-supervised learning using gaussian fields and harmonic functions. In Proc. of the International Conference on Machine Learning (ICML).