Open Access
- 13 April 2015
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 935-940
Abstract
Data Stream Clustering is an active area of research which requires efficient algorithms capable of finding and updating clusters incrementally. On top of that, due to the inherent evolving nature of data streams, it is expected that these algorithms manage to quickly adapt to both concept drifts and the appearance and disappearance of clusters. Nevertheless, many of the developed two-step algorithms are only capable of finding hyper-spherical clusters and are highly dependant on parametrization. In this paper we introduce SNCStream, a one-step online clustering algorithm based on Social Networks Theory, which uses homophily to find non-hyper-spherical clusters. Our empirical studies show that SNCStream is able to surpass density-based algorithms in cluster quality and requires feasible amount of resources (time and memory) when compared to other algorithms.Keywords
This publication has 15 references indexed in Scilit:
- On Density-Based Data Streams Clustering Algorithms: A SurveyJournal of Computer Science and Technology, 2014
- Data stream clusteringACM Computing Surveys, 2013
- An effective evaluation measure for clustering on evolving data streams2011
- The ClusTree: indexing micro-clusters for anytime stream miningKnowledge and Information Systems, 2010
- Density-Based Clustering over an Evolving Data Stream with Noise2006
- A framework for diagnosing changes in evolving data streams2003
- A Framework for Clustering Evolving Data Streams2003
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982
- The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of VarianceJournal of the American Statistical Association, 1937