We define, compute, and evaluate nested surfaces for the purpose of visual data mining. Nested surfaces enclose the data at various density levels, and make it possible to equalize the more and less pronounced structures in the data. This facilitates the detection of multiple structures, which is important for data mining where the less obvious relationships are often the most interesting ones. The experimental results illustrate that surfaces are fairly robust with respect to the number of observations, easy to perceive, and intuitive to interpret. We give a topology-based definition of nested surfaces and establish a relationship to the density of the data. Several algorithms are given that compute surface grids and surface contours, respectively. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Mazeika, A., Böhlen, M. H., & Mylov, P. (2008). Using nested surfaces for visual detection of structures in databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4404 LNCS, pp. 91–102). https://doi.org/10.1007/978-3-540-71080-6_7
Mendeley helps you to discover research relevant for your work.