Research on Knowledge Resource Clustering Based on K-MEAN Algorithm

Article Preview

Abstract:

The key of knowledge resources polymerization is to cluster the knowledge resources exist in document form, knowledge document set is divided into some clusters, require the similarity of document content within the same clusters as large as possible, and the similarity between different clusters as small as possible. In this paper, using the k-mean algorithm to cluster research knowledge resources, according to the characteristics of knowledge resources, and people in the query data mainly use keywords to query characteristics, first to clustering the keywords, map directly by the clustering results of keywords to get the initial clustering of knowledge resources, and then based on the membership degree of knowledge resources optimization clustering set.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1629-1632

Citation:

Online since:

September 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Sun Tieli, Liu Yanji. Present situation and problems of Chinese participle technology[J] Information technology, 2009(09): 187~189.

Google Scholar

[2] Ren Jiangtao, Shi Xiaoxiao, Sun Jinghao, Huang Huanyu, An improved K clustering algorithm based on feature weighting [J]. Computer science, 2006, 33(7): 156-157.

Google Scholar

[3] Meng Chunyan. Study of feature extraction method in text classification and clustering. [J]. Micro computer information, 2009, (09): 149-150.

Google Scholar

[4] Zhu Huayu, Sun Zhengxing, Zhang Fuyan A Chinese text automatic classification system based on vector space model. Computer Engineering Vol. 27(2): 15-18.

Google Scholar

[5] Yang Shanlin, Li Yongsen, Hu Xiaoxuan, Pan Ruoyu. The K-means algorithm of K value optimization problem research. Systems engineering theory & Practice, 2006(02): 97~105.

Google Scholar