This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Iterative Discovery of Multiple Alternative Clustering Views
PrePrint
ISSN: 0162-8828
Donglin Niu, Northeastern University, Boston
Jennifer G. Dy, Northeastern University, Boston
Michael I. Jordan, University of California Berkeley, Berkeley
Complex data can be grouped and interpreted in many different ways. Most existing clustering algorithms, however, only find one clustering solution, and provide little guidance to data analysts who may not be satisfied with that single clustering and may wish to explore alternatives. We introduce a novel approach that provides several clustering solutions to the user for the purposes of exploratory data analysis. Our approach additionally captures the notion that alternative clusterings may reside in different subspaces (or views). We present an algorithm that simultaneously finds these subspaces and the corresponding clusterings. The algorithm is based on an optimization procedure that incorporates terms for cluster quality and novelty relative to previously discovered clustering solutions. We present a range of experiments that compare our approach to alternatives and explore the connections between simultaneous and iterative modes of discovery of multiple clusterings.
Index Terms:
Clustering,Clustering,classification,and association rules,Machine learning,Data mining,Interactive data exploration and discovery
Citation:
Donglin Niu, Jennifer G. Dy, Michael I. Jordan, "Iterative Discovery of Multiple Alternative Clustering Views," IEEE Transactions on Pattern Analysis and Machine Intelligence, 27 Sept. 2013. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TPAMI.2013.180>
Usage of this product signifies your acceptance of the Terms of Use.