[0] 最近看到一个介绍聚类梗概的Page,简单清晰,收藏供参考。
A Tutorial on Clustering Algorithms
http://home.dei.polimi.it/matteucc/Clustering/tutorial_html/index.html
[1] Incremental clustering for dynamic information processing, FAZLI CAN, ACM Transactions on Information Systems, Vol. 11, No. 2, April 1993, Pages 143-164.
Basic Categories of Clustering Methodologies:
graph-theoretical
single-pass
iterative algorithms.
Similarity Measure:
CC (cover-coefficient) concept
The concept maps an m * n (document by term) D matrix [10] into an m * m C, cover coefficient, matrix. The individual entries of C, Cij(1<i, j<m), indicate the probability of selecting any term of di from dj.