Octrees for faster isosurface generation
ACM Transactions on Graphics (TOG)
An assessment of finite sample performance of adaptive methods in density estimation
Computational Statistics & Data Analysis
Visualization Techniques for Mining Large Databases: A Comparison
IEEE Transactions on Knowledge and Data Engineering
A Modulated Parzen-Windows Approach for Probability Density Estimation
IDA '97 Proceedings of the Second International Symposium on Advances in Intelligent Data Analysis, Reasoning about Data
Hi-index | 0.00 |
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.