Data stream clustering: Difference between revisions

Revision as of 08:57, 18 October 2015

Revision as of 21:37, 28 October 2016

Line 54:

Other well-known algorithms used for data stream clustering are:

* [[BIRCH (data clustering)|BIRCH]]:<ref>{{cite journal | first1 = T. | last1 = Zhang | first2 = R. | last2 = Ramakrishnan | first3 = M. | last3 = Linvy | url = http://doi.acm.org/10.1145/235968.233324 |doi=10.1145/235968.233324 | title = BIRCH: An Efficient Data Clustering Method for Very Large Databases | journal = Proceedings of the ACM SIGMOD Conference on Management of Data | date = 1996 | volume=25 | pages=103–114}}</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>{{cite journal | first = D. H. | last = Fisher | url = http://link.springer.com/article/10.1023%2FA%3A1022852608280 | title = Knowledge Acquisition Via Incremental Conceptual Clustering | journal = Machine Learning | date = 1987 | doi=10.1023/A:1022852608280 | volume=2 | pages=139–172}}</ref><ref>{{cite journal | first = D. H. | last = Fisher | id = {{citeseerx|10.1.1.6.9914}} | title = Iterative Optimization and Simplification of Hierarchical Clusterings | journal = Journal of AI Research | volume = 4 | date = 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>{{cite journal | first = F. | last = Can | url = http://dl.acm.org/citation.cfm?doid=130226.134466 | title = Incremental Clustering for Dynamic Information Processing | journal = ACM Transactions on Information Systems | volume = 11 | issue = 2 | date = 1993 | pages = 143-164 | doi=10.1145/130226.134466}}</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.