Inverted Index based Modified Version of KNN for Text Categorization


Taeho Jo, Journal of Information Processing Systems Vol. 4, No. 1, pp. 17-26, Feb. 2008  

10.3745/JIPS.2008.4.1.017
Keywords: String Vector, K- Nearest Neighbor, Text Categorization
Fulltext:

Abstract

This research proposes a new strategy where documents are encoded into string vectors and modified version of KNN to be adaptable to string vectors for text categorization. Traditionally, when KNN are 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 categorization, 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 supervised learning algorithms adaptable to string vectors for text categorization.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
Taeho Jo (2008). Inverted Index based Modified Version of KNN for Text Categorization. Journal of Information Processing Systems, 4(1), 17-26. DOI: 10.3745/JIPS.2008.4.1.017.

[IEEE Style]
T. Jo, "Inverted Index based Modified Version of KNN for Text Categorization," Journal of Information Processing Systems, vol. 4, no. 1, pp. 17-26, 2008. DOI: 10.3745/JIPS.2008.4.1.017.

[ACM Style]
Taeho Jo. 2008. Inverted Index based Modified Version of KNN for Text Categorization. Journal of Information Processing Systems, 4, 1, (2008), 17-26. DOI: 10.3745/JIPS.2008.4.1.017.