Morpheus: interactive exploration of subspace clustering

ABSTRACT

Data mining techniques extract interesting patterns out of large data resources. Meaningful visualization and interactive exploration of patterns are crucial for knowledge discovery. Visualization techniques exist for traditional clustering in low dimensional spaces. In high dimensional data, clusters typically only exist in subspace projections. This subspace clustering, however, lacks interactive visualization tools. Challenges arise from typically large result sets in different subspace projections that hinder comparability, visualization and understandability.

In this work, we describe Morpheus, a tool that supports the knowledge discovery process through visualization and interactive exploration of subspace clusterings. Users may browse an overview of the entire subspace clustering, analyze subspace cluster characteristics in-depth and zoom into object groupings. Bracketing of different parameter settings enables users to immediately see the effects of parameters and to provide feedback to further improve the subspace clustering. Furthermore, Morpheus may serve as a teaching and exploration tool for the data mining community to visually assess different subspace clustering paradigms.

REFERENCES

• 1: Charu C. Aggarwal , Joel L. Wolf , Philip S. Yu , Cecilia Procopiuc , Jong Soo Park, Fast algorithms for projected clustering, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, p.61-72, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
• 2: Rakesh Agrawal , Johannes Gehrke , Dimitrios Gunopulos , Prabhakar Raghavan, Automatic subspace clustering of high dimensional data for data mining applications, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.94-105, June 01-04, 1998, Seattle, Washington, United States
• 3: Ira Assent , Ralph Krieger , Emmanuel Müller , Thomas Seidl, DUSC: Dimensionality Unbiased Subspace Clustering, Proceedings of the 2007 Seventh IEEE International Conference on Data Mining, p.409-414, October 28-31, 2007 [doi>10.1109/ICDM.2007.49]
• 4: Ira Assent , Ralph Krieger , Emmanuel Müller , Thomas Seidl, VISA: visual subspace clustering analysis, ACM SIGKDD Explorations Newsletter, v.9 n.2, December 2007 [doi>10.1145/1345448.1345451]
• 5: Kevin S. Beyer , Jonathan Goldstein , Raghu Ramakrishnan , Uri Shaft, When Is ''Nearest Neighbor'' Meaningful?, Proceedings of the 7th International Conference on Database Theory, p.217-235, January 10-12, 1999
• 6: K. Kailing, H.-P. Kriegel, and P. Kröger. Density-connected subspace clustering for high-dimensional data. In Proc. IEEE ICDM, pages 246--257, 2004.
• 7: Daniel A. Keim, Information Visualization and Visual Data Mining, IEEE Transactions on Visualization and Computer Graphics, v.8 n.1, p.1-8, January 2002 [doi>10.1109/2945.981847]
• 8: Gabriela Moise , Jorg Sander , Martin Ester, P3C: A Robust Projected Clustering Algorithm, Proceedings of the Sixth International Conference on Data Mining, p.414-425, December 18-22, 2006 [doi>10.1109/ICDM.2006.123]
• 9: D. Newman, S. Hettich, C. Blake, and C. Merz. UCI repository of MLDBs, 1998.
• 10: Karlton Sequeira , Mohammed Zaki, SCHISM: A New Approach for Interesting Subspace Mining, Proceedings of the Fourth IEEE International Conference on Data Mining, p.186-193, November 01-04, 2004

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.8 Database applications
          Subjects: Data mining

General Terms:
Management

Keywords:
data mining, high-dimensional data, interactive visualization tool, subspace clustering