Inverted Index based Modified Version of K-Means Algorithm for Text Clustering

Taeho Jo
Volume: 4, No: 2, Page: 67 ~ 76, Year: 2008
10.3745/JIPS.2008.4.2.067
Keywords: String Vector, K Means Algorithm, Text Clustering
Full Text:

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.

Article Statistics
Multiple requests among the same broswer session are counted as one view (or download).
If you mouse over a chart, a box will show the data point's value.


Cite this article
IEEE Style
T. Jo, "Inverted Index based Modified Version of K-Means Algorithm for Text Clustering," Journal of Information Processing Systems, vol. 4, no. 2, pp. 67~76, 2008. DOI: 10.3745/JIPS.2008.4.2.067.

ACM Style
Taeho Jo. 2008. Inverted Index based Modified Version of K-Means Algorithm for Text Clustering, Journal of Information Processing Systems, 4, 2, (2008), 67~76. DOI: 10.3745/JIPS.2008.4.2.067.