This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2012 IEEE 12th International Conference on Data Mining Workshops
Overlapping Clustering with Sparseness Constraints
Brussels, Belgium Belgium
December 10-December 10
ISBN: 978-1-4673-5164-5
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:
Haibing Lu, Yuan Hong, W. Nick Street, Fei Wang, Hanghang Tong, "Overlapping Clustering with Sparseness Constraints," icdmw, pp.486-494, 2012 IEEE 12th International Conference on Data Mining Workshops, 2012
Usage of this product signifies your acceptance of the Terms of Use.