Subspace search and visualization to make sense of alternative clusterings in high-dimensional data

IEEE Conference on Visual Analytics Science and Technology 2012, VAST 2012 - Proceedings

Volumn , Issue , 2012, Pages 63-72

  Tatu, Andrada ^a   Maaß, Fabian ^a   Färber, Ines ^b   Bertini, Enrico ^a   Schreck, Tobias ^a   Seidl, Thomas ^b   Keim, Daniel ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

H.2.8 Database Applications : Data mining; H.3.3 Information Search and Retrieval : Selection process; I.3.3 Picture Image Generation : Display algorithms

Indexed keywords

CLUSTERINGS; COMBINED FEATURES; DATA ITEMS; DATA SPACE; DATABASE APPLICATIONS; DIMENSIONALITY REDUCTION; DISPLAY ALGORITHM; EXPLORATIVE DATA ANALYSIS; FEATURE COMBINATION; HIGH DIMENSIONAL DATA; HIGH-DIMENSIONAL; INPUT DATAS; SEARCH ALGORITHMS; SELECTION PROCESS; SIMILARITY FUNCTIONS; SYNTHETIC AND REAL DATA; VISUAL ANALYSIS; VISUAL MAPPING;

CLUSTER ANALYSIS; GRAPHICAL USER INTERFACES;

ALGORITHMS;

EID: 84872923174     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/VAST.2012.6400488     Document Type: Conference Paper

References (35)

1. I. Assent, R. Krieger, E. Müller, and T. Seidl. Visa: visual subspace clustering analysis. SIGKDD Explor. Newsl., 9(2):5-12, 2007.
2. C. Baumgartner, C. Plant, K. Kailing, H.-P. Kriegel, and P. Kröger. Subspace selection for clustering high-dimensional data. In Proceedings of the Fourth IEEE Conference on Data Mining (ICDM), pages 11-18. IEEE CS Press, 2004.
3. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is "nearest neighbor" meaningful? In Proceedings of the 7th International Conference on Database Theory (ICDT), pages 217-235, 1999.
4. S. Bremm, T. v. Landesberger, J. Bernard, and T. Schreck. Assisted descriptor selection based on visual comparative data analysis. Computer Graphics Forum, 30(3):891-900, 2011.
5. S. Bremm, T. v. Landesberger, M. Heß, T. Schreck, P. Weil, and K. Hamacher. Interactive visual comparison of multiple trees. In Proceedings of IEEE Symposium on Visual Analytics Science and Technology (VAST), pages 31-40. IEEE CS Press, 2011.
6. N. Cao, D. Gotz, J. Sun, and H. Qu. Dicon: Interactive visual analysis of multidimensional clusters. IEEE Transactions on Visualization and Computer Graphics (TVCG), 17:2581-2590, 2011.
7. C.-H. Cheng, A. W. Fu, and Y. Zhang. Entropy-based subspace clustering for mining numerical data. In Proceedings of the fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 84-93. ACM, 1999.
8. T. Cox and M. Cox. Multidimensional Scaling. Chapman & Hall, 1994.
9. M. Ester, H.-P. Kriegel, J. S, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the Second ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 226-231. AAAI Press, 1996.
10. B. J. Ferdosi, H. Buddelmeijer, S. Trager,M. H. F.Wilkinson, and J. B. T. M. Roerdink. Finding and visualizing relevant subspaces for clustering high-dimensional astronomical data using connected morphological operators. In Proceedings of IEEE Symposium on Visual Analytics Science and Technology (VAST), pages 35-42. IEEE CS Press, 2010.
11. S. Günnemann, E.Müller, I. Färber, and T. Seidl. Detection of orthogonal concepts in subspaces of high dimensional data. In Proceedings of the 18th ACM conference on Information and knowledge management (CIKM), pages 1317-1326, 2009.
12. S. Ingram, T. Munzner, V. Irvine, M. Tory, S. Bergner, and T. Möller. DimStiller: Workflows for dimensional analysis and reduction. In Proceedings of IEEE Symposium on Visual Analytics Science and Technology (VAST), pages 3-10. IEEE CS Press, 2010.
13. S. Johansson and J. Johansson. Interactive dimensionality reduction through user-defined combinations of quality metrics. IEEE Transactions on Visualization and Computer Graphics (TVCG), 15:993-1000, 2009.
14. I. Jolliffe. Principal Components Analysis. Springer, 3rd edition, 2002.
15. K. Kailing, H.-P. Kriegel, P. Kröger, and S. Wanka. Ranking interesting subspaces for clustering high dimensional data. In Proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD), pages 241-252, 2003.
16. H.-P. Kriegel, P. Kröger, and A. Zimek. Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Transactions on Knowledge Discovery from Data (TKDD), 3(1):1-58, 2009.
17. A. Lex, M. Streit, C. Partl, and D. Schmalstieg. Comparative analysis of multidimensional, quantitative data. IEEE Transactions on Visualization and Computer Graphics (TVCG), 16(6):1027-1035, 2010.
18. H. Liu and H. Motoda. Computational Methods of Feature Selection (Chapman & Hall/Crc Data Mining and Knowledge Discovery Series). Chapman & Hall/CRC, 2007.
19. E. Müller, I. Assent, S. Günnemann, R. Krieger, and T. Seidl. Relevant subspace clustering: Mining the most interesting non-redundant concepts in high dimensional data. In Proceedings of the IEEE International Conference on Data Mining (ICDM), pages 377-386, 2009.
20. E. Müller, S. Günnemann, I. Färber, and T. Seidl. Discovering multiple clustering solutions: Grouping objects in different views of the data. In Proceedings of the 10th IEEE Conference on Data Mining (ICDM), page 1220, 2010.
21. D. Niu, J. G. Dy, and M. I. Jordan. Multiple non-redundant spectral clustering views. In Proceedings of the 27th International Conference on Machine Learning (ICML), pages 831-838. Omnipress, 2010.
22. W. M. Rand. Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association, 66(336):846-850, 1971.
23. D. J. Rogers and T. T. Tanimoto. A Computer Program for Classifying Plants. Science, 132(3434):1115-1118, 1960.
24. T. Schreck, T. von Landesberger, and S. Bremm. Techniques for precision-based visual analysis of projected data. Palgrave Macmillan Information Visualization, 9(3):181-193, 2010.
25. J. Seo and B. Shneiderman. Interactively exploring hierarchical clustering results. Computer, 35(7):80-86, 2002.
26. J. Seo and B. Shneiderman. A rank-by-feature framework for unsupervised multidimensional data exploration using low dimensional projections. In Proceedings of IEEE Symposium on Information Visualization (InfoVis), pages 65-72, 2004.
27. B. Shneiderman. The eyes have it: A task by data type taxonomy for information visualizations. In Proceedings of the IEEE Symposium on Visual Languages (VL), pages 336-343. IEEE CS Press, 1996.
28. S. Vadapalli and K. Karlapalem. Heidi matrix: nearest neighbor driven high-dimensional data visualization. In Proceedings of the ACM SIGKDD Workshop on Visual Analytics and Knowledge Discovery (VAKD), pages 83-92. ACM, 2009.
29. L. van der Maaten and G. Hinton. Visualizing data using t-SNE. Journal of Machine Learning Research, 9(2579-2605):85, 2008.
30. J. Ward. Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association, 58:236-244, 1963.
31. M. Ward, G. Grinstein, and D. Keim. Interactive Data Visualization: Foundations, Techniques, and Applications. Taylor & Francis, 2010.
32. L. Wilkinson, A. Anand, and R. Grossman. Graph-theoretic scagnostics. In Proceedings of the IEEE Symposium on Information Visualization (InfoVis), pages 157-164. IEEE CS Press, 2005.
33. J. Yang, A. Patro, S. Huang, N. Mehta, M. O. Ward, and E. A. Rundensteiner. Value and relation display for interactive exploration of high dimensional datasets. In Proceedings of IEEE Symposium on Information Visualization (InfoVis), pages 73-80. IEEE CS Press, 2004.
34. J. Yang, M. O. Ward, E. A. Rundensteiner, and S. Huang. Visual hierarchical dimension reduction for exploration of high dimensional datasets. In Proceedings of the Symposium on Data Visualization (VISSYM), pages 19-28. Eurographics Association, 2003.
35. X. Yuan, Z. Wang, and C. Guo. Mds-tree and mds-matrix for high dimensional data visualization. In Proceedings of IEEE Symposium on Information Visualization (InfoVis), 2011. Poster abstract.