Issue No. 06 - December (1996 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.553159
<p><b>Abstract</b>—Visual data mining techniques have proven to be of high value in exploratory data analysis, and they also have a high potential for mining large databases. In this article, we describe and evaluate a new visualization-based approach to mining large databases. The basic idea of our visual data mining techniques is to represent as many data items as possible on the screen at the same time by mapping each data value to a pixel of the screen and arranging the pixels adequately. The major goal of this article is to evaluate our visual data mining techniques and to compare them to other well-known visualization techniques for multidimensional data: the parallel coordinate and stick figure visualization techniques. For the evaluation of visual data mining techniques, in the first place the perception of properties of the data counts, and only in the second place the CPU time and the number of secondary storage accesses are important. In addition to testing the visualization techniques using real data, we developed a testing environment for database visualizations similar to the benchmark approach used for comparing the performance of database systems. The testing environment allows the generation of test data sets with predefined data characteristics which are important for comparing the perceptual abilities of visual data mining techniques.</p>
Data mining, explorative data analysis, visualizing large databases, visualizing multidimensional, multivariate data.
Daniel A. Keim, Hans-Peter Kriegel, "Visualization Techniques for Mining Large Databases: A Comparison", IEEE Transactions on Knowledge & Data Engineering, vol. 8, no. , pp. 923-938, December 1996, doi:10.1109/69.553159