Catching the Trend: A Framework for Clustering Concept-Drifting Categorical Data
Authors:
- 19 September 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 21 (5) , 652-665
Abstract
Sampling has been recognized as an important technique to improve the efficiency of clustering. However, with sampling applied, those points that are not sampled will not have their labels after the normal process. Although there is a straightforward approach in the numerical domain, the problem of how to allocate those unlabeled data points into proper clusters remains as a challenging issue in the categorical domain. In this paper, a mechanism named MAximal Resemblance Data Labeling (abbreviated as MARDL) is proposed to allocate each unlabeled data point into the corresponding appropriate cluster based on the novel categorical clustering representative, namely, N-Nodeset Importance Representative (abbreviated as NNIR), which represents clusters by the importance of the combinations of attribute values. MARDL has two advantages: (1) MARDL exhibits high execution efficiency, and (2) MARDL can achieve high intracluster similarity and low intercluster similarity, which are regarded as the most important properties of clusters, thus benefiting the analysis of cluster behaviors. MARDL is empirically validated on real and synthetic data sets and is shown to be significantly more efficient than prior works while attaining results of high quality.Keywords
This publication has 33 references indexed in Scilit:
- Mining Concept-Drifting and Noisy Data Streams Using Ensemble Classifiers2009
- Clustering over Multiple Evolving Streams by Events and CorrelationsIEEE Transactions on Knowledge and Data Engineering, 2007
- Robust Clustering for Tracking Noisy Evolving Data Streams2006
- CLICKS: Mining Subspace Clusters in Categorical Data via K-Partite Maximal Cliques2005
- An iterative initial-points refinement algorithm for categorical data clusteringPattern Recognition Letters, 2002
- Data clusteringACM Computing Surveys, 1999
- Learning in the presence of concept drift and hidden contextsMachine Learning, 1996
- Knowledge acquisition via incremental conceptual clusteringMachine Learning, 1987
- A vector space model for automatic indexingCommunications of the ACM, 1975
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948