Data stream clustering: Difference between revisions

Revision as of 11:38, 27 March 2013

Revision as of 07:58, 1 June 2013

Line 57:

* [[BIRCH (data clustering)|BIRCH]]:<ref>T. Zhang, R. Ramakrishnan, M. Linvy. [http://doi.acm.org/10.1145/235968.233324 BIRCH: An Efficient Data Clustering Method for Very Large Databases], Proceedings of the ACM SIGMOD Conference on Management of Data, 1996</ref> builds a hierarchical data structure to incrementally cluster the incoming points using the available memory and minimizing the amount of I/O required. The complexity of the algorithm is ''O(N)'' since one pass suffices to get a good clustering (though, results can be improved by allowing several passes).

* [[Cobweb (clustering)|COBWEB]]:<ref>D.H. Fisher [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.9914 Iterative Optimization and Simplification of Hierarchical Clusterings]. Journal of AI Research, Vol 4, 1996</ref> is an incremental clustering technique that keeps a hierarchical clustering model in the form of a [[Decision tree learning|classification tree]]. For each new point. COBWEB descends the tree, updates the nodes along the way and looks for the best node to put the point on (using a [[Category utility| category utility function]]).

* [[C2ICM(incremental clustering)|C2ICM]]:<ref>F. Can. [http://dl.acm.org/citation.cfm?doid=130226.134466 Incremental Clustering for Dynamic Information Processing], ACM Transactions on Information Systems, Vol. 11, No. 2 1993, pages 143-164 </ref> builds a flat partitioning clustering structure by selecting some objects as cluster seeds/initiators and a non-seed is assigned to the seed that provides the highest coverage, addition of new objects can introduce new seeds and falsify some existing old seeds, during incremental clustering new objects and the members of the falsified clusters are assigned to one of the existing new/old seeds.

== References ==