文章基本信息

标题：K-Means Document Clustering using Vector Space Model
本地全文：下载
作者：R. Malathi Ravindran ; Dr. Antony Selvadoss Thanamani
期刊名称：Bonfring International Journal of Data Mining
印刷版ISSN：2250-107X
电子版ISSN：2277-5048
出版年度：2015
卷号：5
期号：2
页码：10-14
DOI：10.9756/BIJDM.8076
语种：English
出版社：Bonfring
摘要：Document Clustering is the collection of similar documents into classes and the similarity is some function on the document. Document Clustering need not require any separate training process and manual tagging group in advance. The documents used in the same clusters are more similar, while the documents used in different clusters are more dissimilar. It is one of the familiar technique used in data analysis and is used in many areas including data mining, statistics and image analysis. The traditional clustering approaches lose its algorithmic approach when handling high dimensional data. For this, a new K-Means Clustering technique is proposed in this work. Here Cosine Similarity of Vector Space Model is used as the centroid for clustering. Using this approach, the documents can be clustered efficiently even when the dimension is high because it uses vector space representation for documents which is suitable for high dimensions.
关键词：Data Mining; Document Clustering; High Dimensional Data; Vector Space Model; K-Means Clustering; Cosine Similarity