The Community for Technology Leaders
2012 IEEE 12th International Conference on Data Mining Workshops (2012)
Brussels, Belgium Belgium
Dec. 10, 2012 to Dec. 10, 2012
ISBN: 978-1-4673-5164-5
pp: 486-494
ABSTRACT
Overlapping clustering allows a data point to be a member of multiple clusters, which is more appropriate for modeling many real data semantics. However, much of the existing work on overlapping clustering simply assume that a data point can be assigned to any number of clusters without any constraint. This assumption is not supported by many real contexts. In an attempt to reveal true data cluster structure, we propose sparsity constrained overlapping clustering by incorporating sparseness constraints into an overlapping clustering process. To solve the derived sparsity constrained overlapping clustering problems, efficient and effective algorithms are proposed. Experiments demonstrate the advantages of our overlapping clustering model.
INDEX TERMS
Clustering algorithms, Silicon, Matrix decomposition, Data models, Vectors, Optimization, Linear programming
CITATION

H. Lu, Y. Hong, W. N. Street, F. Wang and H. Tong, "Overlapping Clustering with Sparseness Constraints," 2012 IEEE 12th International Conference on Data Mining Workshops(ICDMW), Brussels, Belgium Belgium, 2012, pp. 486-494.
doi:10.1109/ICDMW.2012.16
83 ms
(Ver 3.3 (11022016))