Using Nested Surfaces for Visual Detection of Structures in Databases

  • Authors:
  • Arturas Mazeika;Michael H. Böhlen;Peer Mylov

  • Affiliations:
  • Faculty of Computer Science, Free University of Bozen-Bolzano, Bozen, Italy 39100 and Institute of Communication, Aalborg University, Aalborg, Denmark 9220;Faculty of Computer Science, Free University of Bozen-Bolzano, Bozen, Italy 39100;Institute of Communication, Aalborg University, Aalborg, Denmark 9220

  • Venue:
  • Visual Data Mining
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We define, compute, and evaluate nested surfacesfor 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.