The Community for Technology Leaders
Green Image
Issue No. 10 - October (2009 vol. 21)
ISSN: 1041-4347
pp: 1432-1446
Yi-Hong Chu , National Taiwan University, Taipei
Ying-Ju Chen , National Taiwan University, Taipei
De-Nian Yang , National Taiwan University, Taipei
Ming-Syan Chen , National Taiwan University, Taipei
In this paper, we first study an important but unsolved dilemma in the literature of subspace clustering, which is referred to as “information overlapping-data coverage” challenge. Current solutions of subspace clustering usually invoke a grid-based Apriori-like procedure to identify dense regions and construct subspace clusters afterward. Due to the nature of monotonicity property in Apriori-like procedures, it is inherent that if a region is identified as dense, all its projected regions are also identified as dense, causing overlapping/redundant clustering information to be inevitably reported to users when generating clusters from such highly correlated regions. However, naive methods to filter redundant clusters will incur a challenging problem in the other side of the dilemma, called the “data coverage” issue. Note that two clusters may have highly correlated dense regions but their data members could be highly different to each other. Arbitrarily removing one of them may lose the coverage of data with clustering information, thus likely reporting an incomplete and biased clustering result. In this paper, therefore, we further propose an innovative algorithm, called "NOnRedundant Subspace Cluster mining” (NORSC), to efficiently discover a succinct collection of subspace clusters while also maintaining the required degree of data coverage. NORSC not only avoids generating the redundant clusters with most of the contained data covered by higher dimensional clusters to resolve the information overlapping problem but also limits the information loss to cope with the data coverage problem. As shown by our experimental results, NORSC is very effective in identifying a concise and small set of subspace clusters, while incurring time complexity in orders of magnitude better than that of previous works.
Data mining, subspace clustering, redundancy filtering.

D. Yang, Y. Chu, Y. Chen and M. Chen, "Reducing Redundancy in Subspace Clustering," in IEEE Transactions on Knowledge & Data Engineering, vol. 21, no. , pp. 1432-1446, 2008.
83 ms
(Ver 3.3 (11022016))