Visual analysis of high dimensional point clouds using topological landscapes

IEEE Pacific Visualization Symposium 2010, PacificVis 2010 - Proceedings

Volumn , Issue , 2010, Pages 113-120

  Oesterling, Patrick ^a   Heine, Christian ^a   Jänicke, Heike ^b   Scheuermann, Gerik ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

^b SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

I.5.3 pattern recognition : clustering algorithms; I.5.3 pattern recognition : design methodology pattern analysis; I.5.3 pattern recognition : models structural

Indexed keywords

DESIGN METHODOLOGY; I.5.3 [PATTERN RECOGNITION]: CLUSTERING - ALGORITHMS; I.5.3 [PATTERN RECOGNITION]: DESIGN METHODOLOGY - PATTERN ANALYSIS; I.5.3 [PATTERN RECOGNITION]: MODELS - STRUCTURAL; PATTERN ANALYSIS;

CLOUDS; CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; PATTERN RECOGNITION; TOPOLOGY; VISUALIZATION;

STRUCTURAL DESIGN;

EID: 77951692474     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACIFICVIS.2010.5429601     Document Type: Conference Paper

References (37)

1. C. C. Aggarwal, J. L.Wolf, P. S. Yu, C. Procopiuc, and J. S. Park. Fast algorithms for projected clustering. SIGMOD Rec., 28(2), 1999.
2. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data. Data Min. Knowl. Discov., 11(1):5-33, 2005. (Pubitemid 41202921)
3. B. Alpern and L. Carter. The hyperbox. In IEEE VIS '91, pages 133-139, Los Alamitos, CA, USA, 1991. IEEE Computer Society Press.
4. K.-H. Anders. Parameterfreies hierarchisches Graph-Clustering Verfahren zur Interpretation raumbezogener Daten (Dissertation). PhD thesis, Universitaet Stuttgart, 2003.
5. M. Ankerst, D. Keim, and H.-P. Kriegel. Circle segments: A technique for visually exploring large multidimensional datasets. In Proceedings Visualization '96, 1996.
6. R. A. Becker and W. S. Cleveland. Brushing scatterplots. Technometrics, 29(2):127-142, 1987.
7. R. Bellman. Adaptive Control Processes: A Guided Tour. Princeton University Press, 1961.
8. R. L. Boyell and H. Ruston. Hybrid techniques for real-time radar simulation. In AFIPS '63 (Fall): Proceedings of the November 12-14, 1963, fall joint computer conference, pages 445-458. ACM, 1963.
9. H. Carr, J. Snoeyink, and U. Axen. Computing contour trees in all dimensions. Computational Geometry, 2003.
10. J. M. Chambers,W. S. Cleveland, B. Kleiner, and P. A. Tukey, editors. Graphical methods for data analysis. The Wadsworth Statistics/Probability Series, 1983.
11. M. De Berg, O. Cheong, and M. van Kreveld. Computational geometry: algorithms and applications. Springer, 2008.
12. H. Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simplification. Discrete & Computational Geometry, 28(4):511-533, 2002.
13. H. Edelsbrunner and E. P. Mücke. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph., 9(1):66-104, 1990.
14. N. Elmqvist, P. Dragicevic, and J.-D. Fekete. Rolling the dice: Multidimensional visual exploration using scatterplot matrix navigation. IEEE Trans. Vis. Comput. Graph., 14(6):1539-11148, 2008.
15. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD, pages 226-231, 1996.
16. S. Fortune. Voronoi Diagrams and Delaunay triangulations, pages 193-233. World Scientific Press, 1992.
17. G. W. Furnas and A. Buja. Prosection views: Dimensional inference through sections and projections. JCGS, 3:323-385, 1994.
18. R. K. Gabriel and R. R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18(3):259-278, 1969.
19. J. Handl and J. Knowles. Cluster generators for large high-dimensional data sets with large numbers of clusters, 2005, http://dbkgroup.org/handl/ generators.
20. A. Hinneburg and D. A. Keim. An efficient approach to clustering in large multimedia databases with noise. In Knowledge Discovery and Data Mining, pages 58-65, 1998.
21. A. Inselberg and B. Dimsdale. Parallel coordinates: a tool for visualizing multi-dimensional geometry. In VIS '90: Proceedings of the 1st conference on Visualization '90, pages 361-378, 1990.
22. G. Jaromczyk, J.W.; Toussaint. Relative neighborhood graphs and their relatives. In Proc. of the IEEE, volume 80 of Issue 9, 1992.
23. I. T. Jolliffe. Principal component analysis. Springer, Berlin, 1986.
24. D. A. Keim, M. Ankerst, and H.-P. Kriegel. Recursive pattern: A technique for visualizing very large amounts of data. In VIS '95: Proc. of the 6th conference on Vis. '95. IEEE Computer Society, 1995.
25. T. Kohonen. Self-Organizing Maps, volume 30. Springer Series, 2001.
26. J. B. Kruskal and M. Wish. Multidimensional Scaling (Quantitative Applications in the Social Sciences). SAGE Publications, 1978.
27. M. Levoy. Display of surfaces from volume data. IEEE Computer Graphics and Applications, 8(3):29-37, 1988.
28. Y. Livnat, H.-W. Shen, and C. R. Johnson. A near optimal isosurface extraction algorithm using the span space. IEEE Transactions on Visualization and Computer Graphics, 2(1):73-84, 1996.
29. W. E. Lorensen and H. E. Cline. Marching cubes: A high resolution 3d surface construction algorithm. SIGGRAPH Comput. Graph., 21(4):163-169, 1987.
30. V. Pascucci, K. Cole-McLaughlin, and G. Scorzelli. Multi-resolution computation and presentation of contour trees. In Lawrence Livermore National Laboratory, Tech. Rep. UCRL-PROC-208680, 2005.
31. G. Sheikholeslami, S. Chatterjee, and A. Zhang. Wavecluster: A multi-resolution clustering approach for very large spatial databases. In VLDB, pages 428-439, 1998.
32. S. Takahashi, I. Fujishiro, and M. Okada. Applying manifold learning to plotting approximate contour trees. IEEE Transactions on Visualization and Computer Graphics, 15(6):1185-1192, 2009.
33. J. Tenenbaum, V. de Silva, and J. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319-2323, 2000. (Pubitemid 32041577)
34. E. Tufte. The Visual Display of Quantitative Information, 2nd. Ed. Graphics Press, 2001.
35. W. Wang, J. Yang, and R. R. Muntz. Sting: A statistical information grid approach to spatial data mining. In VLDB, pages 186-195, 1997.
36. G. Weber, P.-T. Bremer, and V. Pascucci. Topological landscapes: A terrain metaphor for scientific data. IEEE Transactions on Visualization and Computer Graphics, 13(6):1416-1423, 2007.
37. G. H. Weber, G. Scheuermann, and B. Hamann. Detecting critical regions in scalar fields. In IEEE TCVG Symposium on Visualization, pp. 1-11, 2003.