R-means: Exploiting Association Rules as Means for Text Clustering
R-means：以关联规则为簇中心的文本聚类

This paper proposes a new text clustering algorithm called R-means which integrates k-means with associa- tion rule (or frequent itemset). R-means exploits association rules as means of clusters and refines clusters by an itera- tive procedure which is similar to that of k-means. R-means not only inherits the simplicity of k-means, but also gener- ates more comprehensive cluster labels which are described by association rules. The experiments with several real data sets have demonstrated that R-means can achieve quite well precision and high performance.