Induction from multi-label examples in information retrieval systems: A case study

Applied Artificial Intelligence

Volumn 22, Issue 5, 2008, Pages 407-432

  Sarinnapakorn, Kanoksri ^a   Kubat, Miroslav ^a  

^a University of Miami   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

(SPM) CLASSES; CASE STUDIES; CLASSIFICATION PERFORMANCE; COMPUTATIONAL COSTS; COMPUTATIONAL SAVINGS; DEMPSTER-SHAFER THEORY (DST); FEATURE SUBSETS; INDUCTION ALGORITHMS; MACHINE LEARNING TECHNIQUES; RETRIEVAL SYSTEMS;

CLASSIFICATION (OF INFORMATION); CLASSIFIERS; FORMAL LOGIC; INFORMATION ANALYSIS; INFORMATION RETRIEVAL SYSTEMS; INFORMATION SCIENCE; INFORMATION SERVICES; LEARNING ALGORITHMS; LEARNING SYSTEMS; MANAGEMENT INFORMATION SYSTEMS; SEARCH ENGINES;

INFORMATION RETRIEVAL;

EID: 46149105706     PISSN: 08839514     EISSN: 10876545     Source Type: Journal    
DOI: 10.1080/08839510801972827     Document Type: Article

References (50)

1. Al-Ani, A. and M. Deriche. 2002. A new technique for combining multiple classifiers using the Dempster-Shafer theory of evidence. Journal of Artificial Intelligence Research 17:333-361.
2. Apte, C. and S. Weiss. 1997. Data mining with decision trees and decision rules. Future Generation Computer Systems 13:197-210.
3. Bahler, D. and L. Navarro. 2000. Methods for combining heterogeneous sets of classifiers. In: Proc. Natl. Conf. on Artificial Intelligence (AAAI) Workshop on New Research Problems for Machine Learning, Austin, Texas, USA.
4. Bennett, P. N., S. T. Dumais, and E. Horvitz. 2005. The combination of text classifiers using reliability indicators. Information Retrieval 8:67-100.
5. Bi, Y., D. Bell, H. Wang, G. Guo, and K. Greer. 2004. Combining multiple classifiers using Dempster's rule of combination for text categorization. In: Proc. Int'l Conf. Modeling Decisions for Artificial Intelligence, pp. 127-138, Catalonia, Spain.
6. Bi, Y., S. McClean, and T. Anderson. 2005. Improving classification decisions by multiple knowledge. In: Proc. IEEE Int'l Conf. on Tools with Artificial Intelligence (ICTAI'05), pp. 340-347, Hong Kong, China.
7. Blackman, S. and R. Popoli. 1999. Design and Analysis of Modern Tracking Systems. Norwood, MA: Artech House.
8. Breiman, L. 1996. Bagging predictors. Machine Learning 24:123-140.
9. Chen, H. and T. K. Ho. 2000. Evaluation of decision forests on text categorization. In: Proceedings of the 7th SPIE Conference on Document Recognition and Retrieval, eds. D. P. Lopresti and J. Zhou. San Jose, CA, 191-199.
10. Chen, J., X. Zhou, and Z. Wu. 2004. A multi-label Chinese text categorization system based on boosting algorithm. In: Proc. IEEE Int'l Conf. on Computer and Information Technology (CIT'04) 1153-1158, Wuhan, China.
11. Clare, A. and R. D. King. 2001. Knowledge discovery in multi-label phenotype data. In: Proceedings of the 5th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'01), Freiburg, Germany.
12. De Comité, F., R. Gilleron, and M. Tommasi. 2001. Learning multi-label alternating decision trees and applications. In: Proc. Conf. en Apprentissage Automatique (CAP'01), 195-210.
13. De Comité, F., R. Gilleron, and M. Tommasi. 2003. Learning multi-label alternating decision trees from texts and data. In: Proc. Int'l Conf. on Machine Learning and Data Mining (MLDM'03), 35-49, Leipzig, Germany.
14. Diao, L., K. Hu, Y. Lu, and C. Shi. 2002. Boosting simple decision trees with Bayesian learning for text categorization. In: Proc. World Congress on Intelligent Control and Automation Shanghai, PR China, 321-325.
15. Eyheramendy, S., D. D. Lewis, and D. Madigan. 2003. On the naive Bayes model for text categorization. In: Proc. Int'l Workshop on Artificial Intelligence and Statistics, Key West, Florida, USA.
16. Freund, Y. 1995. Boosting a weak learning algorithm by majority. Information and Computation 121: 256-285.
17. Freund, Y. and L. Mason. 1999. The alternating decision tree learning algorithm. In: Proc. Int'l Conf. on Machine Learning (ICML'99), 124-133. San Francisco, CA: Morgan Kaufmann.
18. Freund, Y. and R. E. Schapire. 1996. Experiments with a new boosting algorithm. In: Proc. Int'l Conf. on Machine Learning (ICML'96), 148-156, Bari, Italy.
19. Freund, Y. and R. E. Schapire. 1997. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences 55:119-139.
20. Friedman, N., D. Geiger, and M. Goldszmidt. 1997. Bayesian network classifiers. Machine Learning 29:131-163.
21. Fürnkranz, J. 2002. Hyperlink ensembles: A case study in hypertext classification. Information Fusion 3:299-312.
22. Gao, S., W. Wu, C.-H. Lee, and T.-S. Chua. 2004. A MFoM learning approach to robust multiclass multi-label text categorization. In: Proc. Int'l Conf. on Machine Learning (ICML'04), 329-336, Alberta, Canada.
23. Godbole, S. and S. Sarawagi. 2004. Discriminative methods for multi-labeled classification. In: Proc. Pacific-Asia Conference (PAKDD'04), 22-30.
24. Holmes, G., B. Pfahringer, R. Kirkby, E. Frank, and M. Hall. 2002. Multiclass alternating decision trees. In: Proc. European Conf. on Machine Learning (ECML'02). Helsinki, Finland: Springer-Verlag.
25. Joachims, T. 1998. Text categorization with support vector machines: learning with many relevant features. In: Proc. European Conf. on Machine Learning (ECML'98), eds. C. Nédellec and C. Rouveirol 137-142. Number 1398, Chemnitz, DE, Heidelberg, DE: Springer Verlag.
26. Kubat, M. and J. M. Cooperson. 2001. A reduction technique for nearest-neighbor classification: Small groups of examples. Intelligent Data Analysis 5:463-476.
27. Kwok, J. T. 1998. Automated text categorization using support vector machine. In: Proc. Int'l Conf. on Neural Information Processing (ICONIP'98), Kitakyushu, Japan, 347-351.
28. Langley, P., W. Iba, and K. Thompson. 1992. An analysis of Bayesian classifiers. In: Natl. Conf. on Artificial Intelligence, 223-228, San Jose, California, USA.
29. Lewis, D. D., R. E. Schapire, J. P. Callan, and R. Papka. 1996. Training algorithms for linear text classifiers. In: Proc. ACM SIGIR Conf. Research and Development in Information Retrieval, 298-306. New York, NY: ACM Press.
30. Li, B., Q. Lu, and S. Yu. 2004. An adaptive k-nearest neighbor text categorization strategy. ACM Trans. on Asian Language Information Processing (TALIP) 3:215-226, New York, New York, USA.
31. McCallum, A. and K. Nigam. 1998. A comparison of event models for naive Bayes text classification. In: Proc. Workshop on Learning for Text Categorization (AAAI'98), Menlo Park, California, USA.
32. Rahman, A. F. R., H. Alam, and M. C. Fairhurst. 2002. Multiple classifier combination for character recognition: Revisiting the majority voting system and its variations. Lecture Notes in Computer Science 2423.
33. Roli, F. and G. Giacinto. 2002. Design of Multiple Classifier Systems, River Edge, New Jersey: World Scientific Publishing.
34. Ruiz, M. E. and P. Srinivasan. 1998. Automatic text categorization using neural networks. In: Advances in Classification Research: Proc. Classification Research Workshop (ASIS SIG/CR) Volume 8, Medford, NJ, 59-72.
35. Ruiz, M. E. and P. Srinivasan. 2002. Hierarchical text categorization using neural networks. Information Retrieval 5:87-118.
36. Salton, G. and M. McGill. 1983. Introduction to Modern Information Retrieval, New York, USA: McGraw Hill.
37. Schapire, R. E. 1990. The strength of weak learnability. Machine Learning 5:197-227.
38. Schapire, R. E. and Y. Singer. 1999. Improved boosting using confidence-rated predictions. Machine Learning 37:297-336.
39. Schapire, R. E. and Y. Singer. 2000. BoosTexter: A boosting-based system for text categorization. Machine Learning 39:135-168.
40. Shafer, G. 1976. A Mathematical Theory of Evidence. Princeton, NJ: Princeton University Press.
41. Uren, V. S. and T. R. Addis. 2002. How weak categorizers based upon different principles strengthen performance. The Computer Journal 45:511-524.
42. van Rijsbergen, C. J. 1979. Information Retrieval, 2nd ed. London: Butterworths.
43. Vilar, D., M. J. Castro, and E. Sanchis. 2004. Multi-label text classification using multinomial models. In: Proc. Espan a for Natural Language Processing (EsTAL'04), Alicante, Spain.
44. Weiss, S. M., C. Apt, F. J. Damerau, D. E. Johnson, F. J. Oles, T. Goetz, and T. Hampp. 1999. Maximizing text-mining performance. IEEE Intelligent Systems 14:63-69.
45. Wiener, E. D., J. O. Pedersen, and A. S. Weigend. 1995. A neural network approach to topic spotting. In: Proc. Annual Symp. on Document Analysis and Information Retrieval (SDAIR'95), Las Vegas, NV, 317-332.
46. Yang, Y. 1999. An evaluation of statistical approaches to text categorization. Information Retrieval 1:69-90.
47. Yang, Y. and C. G. Chute. 1994. An example-based mapping method for text categorization and retrieval. ACM Trans. on Information Systems (TOIS) 12:252-277.
48. Zhang, M.-L. and Z.-H. Zhou. 2005. A k-nearest neighbor based algorithm for multi-label classification. In: The 1st IEEE Int'l Conf. on Granular Computing (GrC'05), Volume 2, Beijing, China, 718-721.
49. Zhang, M.-L. and Z.-H. Zhou. 2006. Multilabel neural networks with application to functional genomics and text categorization. IEEE Trans. on Knowledge and Data Engineering, 1338-1351.
50. Zhu, S., X. Ji, W. Xu, and Y. Gong. 2005. Multi-labelled classification using maximum entropy method. In: Proc. ACM SIGIR Conf. Research and Development in Information Retrieval, 274-281.