计算机工程与科学2009，Vol.31Issue(12)：65-66,99,3.DOI:10.3969/j.issn.1007-130X.2009.12.019
无尺度图k-中心点聚类算法在文本挖掘中的应用
Application of a Scale-Free Graph Clustering Algorithm in Text Mining
沈亚田 1沈夏炯 1马庆华1
作者信息
- 1. 河南大学计算机与信息工程学院,河南,开封,475001
- 折叠
摘要
Abstract
The paper extracts the text features based on a method of word co-occurrence frequency,which is related to the semantics of document.We also introduce the theory of scale-free network,and cluster the documents with a scale-free graph clustering algorithm. The average and deviation methods of misclassification(MI) show the experimental results.关键词
无尺度网络/同现频率/无尺度图聚类/中心顶点Key words
scale-free network/co-occurrence frequency/scale free graph cluster/hub vertex分类
信息技术与安全科学引用本文复制引用
沈亚田,沈夏炯,马庆华..无尺度图k-中心点聚类算法在文本挖掘中的应用[J].计算机工程与科学,2009,31(12):65-66,99,3.
