Inverted Index based Modified Version of K-Means Algorithm for Text Clustering
2
조회
0
다운로드
2
인용
0
참고문헌
키워드
초록
This research proposes a new strategy where documents are encoded into string vectors and modified version of k means algorithm to be adaptable to string vectors for text clustering. Traditionally, when k means algorithm is used for pattern classification, raw data should be encoded into numerical vectors. This encoding may be difficult, depending on a given application area of pattern classification. For example, in text clustering, encoding full texts given as raw data into numerical vectors leads to two main problems: huge dimensionality and sparse distribution. In this research, we encode full texts into string vectors, and modify the k means algorithm adaptable to string vectors for text clustering.
Abstract
This research proposes a new strategy where documents are encoded into string vectors and modified version of k means algorithm to be adaptable to string vectors for text clustering. Traditionally, when k means algorithm is used for pattern classification, raw data should be encoded into numerical vectors. This encoding may be difficult, depending on a given application area of pattern classification. For example, in text clustering, encoding full texts given as raw data into numerical vectors leads to two main problems: huge dimensionality and sparse distribution. In this research, we encode full texts into string vectors, and modify the k means algorithm adaptable to string vectors for text clustering.
참고문헌 (20)
- C. Ambroise, "Convergence of an EM-type algorithm for spatial clustering", Pattern Recognition Letters, 19(10), pp.919~927 (1998)
- Banerjee, I. Dhillon, "Generative model-based clustering of directional data", The Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.19~28 (2003)
- G. Bote, "Document Organization using Kohonen’s Algorithm", Information Processing and Management, 38(1), pp.79~89 (2002)
- G. Celeux, "A Classification EM algorithm for clustering and two stochastic versions", Computational Statistics & Data Analysis, 14(3), pp.315~332 (1992)
- A. P. Dempster, "Maximum Likelihood from Incomplete Data via EM algorithm", Journal of the Royal Statistics Society, Series B, 39(1), pp.1~38 (1977)
- V. Hatzivassiloglou, "An Investigation of Linguistic Features and Clustering Algorithms for Topical Document Clustering", The Proceedings of 23rd SIGIR, pp.224~231 (2000)
- P. Jackson, "Natural Language Processing for Online Applications: Text Retrieval, Extraction and Categorization" (2002), John Benjamins Publishing Company
- T. Jo, "The Concepts of Text Mining", The Proceedings of ICACT 2000, pp.124~129 (2000)
- T. Jo, "Dynamic Document Organization using Text Categorization and Text Clustering", 박사, pp.2006
- T. Jo, "String Vectors in Unsupervised Learning for Text Clustering", Information Systems (2007)
- T. Jo, "The Evaluation Measure of Text Clustering for the Variable Number of Clusters", Lecture Notes in Computer Science, 4492, pp.871~879 (2007)
- T. Jo, "Text Clustering using NTSO", The Proceedings of IJCNN, pp.558~563 (2005)
- T. Kohonen, "Self Organized Formation of Topologically Correct Feature Maps", Biological Cybernetics, 43, pp.59~69 (1982)
- T. Kohonen, "Self Organization of a Massive Document Collection", IEEE Transaction on Neural Networks, 11(3), pp.574~585 (2002)
- F. Sebastiani, "Machine Learning in Automated Text Categorization", ACM Computing Survey, 34(1), pp.1~47 (2002)
- E. D. Wiener, "A Neural Network Approach to Topic Spotting in Text", 석사, pp.1995
- S. Kaski, "WEBSOM-Self Organizing Maps of Document Collections", Neurocomputing, 21, pp.101~117 (1998)
- Mitchell, T. M., "Machine Learning" (1997), McGraw-Hill
- A. Vinokourov, "A Probabilistic Hierarchical Clustering Method for Organizing Collections of Text Documents", The Proceedings of 15th International Conference on Pattern Recognition, pp.182~185 (2000)
- H. Lodhi, "Text Classification with String Kernels", Journal of Machine Learning Research, 2(2), pp.419~444 (2002)
