Incorporating large unlabeled data to enhance em classification

Journal of Intelligent Information Systems

Volumn 26, Issue 3, 2006, Pages 211-226

  Wu, Xintao ^a  

^a UNIVERSITY OF NORTH CAROLINA AT CHARLOTTE   (United States)

Author keywords

Bootstrap; Classification; Expectation maximization

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); DATA STRUCTURES; IMAGE PROCESSING; INPUT OUTPUT PROGRAMS; LEARNING SYSTEMS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING;

B-EM ALGORITHM; BOOTSTRAP; EXPECTATION MAXIMIZATION (EM) ALGORITHMS; IMAGE CLASSIFICATION;

DATA REDUCTION;

EID: 33747066452     PISSN: 09259902     EISSN: 15737675     Source Type: Journal    
DOI: 10.1007/s10844-006-0865-3     Document Type: Article

References (27)

1. Babu, S., & Widom, J. (2001). Continuous queries over data streams. SIGMOD Record, 30(3), 109-120.
2. Blum, A., & Mitchell, T. (1998). Combining labeled and unlabeled data with co-training. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory (pp. 92-100), Madison, Wisconsin.
3. Bradley, P. S., Fayyad, U. M., & Reina, C. A. (1998, August). Scaling clustering algorithms to large databases. In Proceedings of the Fourth ACM KDD International Conference on Knowledge Discovery and Data Mining (pp. 9-15), New York.
4. Carreira-Perpinan, M. (1996). A review of dimension reduction techniques. In Technique Report, CS-96-09, Department of Computer Science, University of Sheffield.
5. Castelli, V., & Cover, T. (1995). On the exponential value of labeled samples. Pattern Recognition Letters, 16(1), 105-111.
6. Castelli, V., & Cover, T. (1996). The relative value of labeled and unlabeled samples in pattern recognition with an unknown mixing parameters. IEEE Transaction on Information Theory, 42(6), 2102-2117.
7. Chakrabarti, S., Dom, B., Agrawal, R., & Raghavan, P. (1997). Using taxonomy, discriminants, and signatures for navigating in text databases. In Proceedings of the 23rd Very Large Data Bases Conference (pp. 446-455), Athens, Greece.
8. Chapmann, B., & Tibshirani, R. (1993). An introduction to the bootstrap, monograph on statistics and applied probability. Chapman and Hall.
9. Cheeseman, P., & Stutz, J. (1996). Bayesian classification (autoclass): Theory and results. Advances in Knowledge Discovery and Data Mining.
10. Dempster, A., Laird, N., & Rubin, D. (1977). Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society, 39(1),1-38.
11. Gehrke, J., Ganti, V., Ramakrishnan, R., & Loh, W.-Y. (1999). Boat-optimistic decision tree construction. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 169-180) Philadelphia, Pennsylvania.
12. Gehrke, J., Ramakrishnan, R., & Ganti, V. (1998). Rainforest - a framework for fast decision tree construction of large datasets. In Proceedings of the 24th Very Large Data Bases Conference (pp. 416-427), New York.
13. Ghaharmani, Z., & Jordan, M. (1994). Supervised learning from incomplete data via an em approach. In Proceedings of Advances in Neural Information Processing Systems (pp. 120-127), Denver, Colorado.
14. Goldberg, D. (1999). Genetic algorithms in search, optimization and machine learning. Reading, Massachussetts: Morgan Kaufmann.
15. James, M. (1985). Classification algorithms. New York: Wiley & Sons.
16. Lippmann, R. (1987). An introduction to computing with neural nets. IEEE ASSP Magazine, 4(2), 4-22.
17. Mehta, M., Agrawal, R., & Risanen, J. (1996). Sliq: A fast scalable classifier for data mining. In Proceedings of the Fifth International Conference on Extending Database Technology (pp. 18-32), Avignon, France.
18. Neal, R., & Hinton, G. (1999). A view of the em algorithm that justifies incremental, sparse, and other variants. In M. I. Jordan (Ed.), Learning in graphical models (pp. 355-368). Norwell, Massachusetts: Kluwer Academic Publishers.
19. Nigam, K., Mccallum, A. Thrun, S., & Mitchel, T. (2000). Text classification from labeled and unlabeled documents. Machine Learning, 39(2/3), 103-134.
20. Ortega-Binderberger, M. (1999). Corel image features. http://kdd.ics.uci.edu/databases/CorelFeatures/CorelFeatures.html.
21. Quinlan, J. (1986). Induction of decision trees. Machine Learning, 1, 81-106.
22. Quinlan, J. (1989). Unknown attribute values in induction. In Proceedings of the Sixth International Machine Learning Workshop (pp. 164-168), Ithaca, New York.
23. Shafer, J., Agrawal, R., & Mehta, M. (1996). Sprint: A scalable parallel classifier for data mining. In Proceedings of the 22nd Very Large Data Bases Conference (pp. 544-555), Bombay, India.
24. Shanhshanhani, B., & Landgrebe, D. (1994). The effect of unlabeled samples in reducing the small sample size problem and mitigating the hughes phenomenon. IEEE Transactions on Geoscience and Remote Sensing, 32(5), 1087-1095.
25. Tian, Q., Wu, Y., & Huang, T. S. (2000). Incorporate discriminant analysis with em algorithm in image retrieval. In Proceedings of IEEE International Conference on Multimedia and Expo(I), New York City, New York (pp. 299-302).
26. Toutanova, K., Chen, F., Popat, K., & Hifmann, T. (2001). Text classification in a hierarchical mixture model for small training sets. In Proceedings of ACM International Conference on Information and Knowledge Management (pp. 105-112), Atlanta, Georgia.
27. Wu, X., Fan, J., & Subramanian, K. R. (2002). B-EM: A classifier incorporating bootstrap with em approach for data mining. In Proceedings of ACM International Conference on Knowledge Discovery and Data Mining (pp. 670-675), Edmonton, Canada.