聚类算法学习笔记

2023年8月22日 383次阅读来源: 聚类算法

[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.

C3M (Cover-Coefficient-based Clustering Methodology)

C2ICM (Cover-Coefficient-based Incremental Clustering Methodology)

C2ICM, is an extension of C3M.

[2] Learning Approaches for Detecting and Tracking News Events, Yiming Yang, et al. IEEE Intelligent Systems, v.14 n.4, p.32-43, July 1999.

聚类算法：

GAC （Hierarchical Aggregation Clustering）

Bucketing GAC （Partition–>Aggregation）

INCR （Incremental Single-Pass）

    原文作者：聚类算法
    原文地址: https://blog.csdn.net/cuiyanws/article/details/5991769
    本文转自网络文章，转载此文章仅为分享知识，如有侵权，请联系博主进行删除。