The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
Visualization techniques for mining large databases: a comparison
Open accessAbstract
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, the perception of data properties counts most, while the CPU time and the number of secondary storage accesses are only of secondary importance. 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Term-weighting approaches in automatic text retrieval
Salton, G., & Buckley, C. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90021-0 · Cited by 9,740
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
The visual display of quantitative information
(1985) · General Pharmacology: The Vascular System · doi:10.1016/0306-3623(85)90230-7 · Cited by 5,070
The Art of Computer Programming: Volume 3: Sorting and Searching
Knuth, D. E. (1973) · Cited by 3,955
Kemp, C. D., & Tufte, E. R. (1992) · Biometrics · doi:10.2307/2532323 · Cited by 2,713
The Visual Display of Quantitative Information.
Fayers, P., & Tufte, E. R. (1990) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2983122 · Cited by 1,936
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
Knowledge Discovery in Databases
Piateski, G., & Frawley, W. (1991) · The MIT Press eBooks · Cited by 1,749
Cleveland, W. S. (1993) · Cited by 1,698
A Projection Pursuit Algorithm for Exploratory Data Analysis
Friedman, J. H., & Tukey, J. W. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.224051 · Cited by 1,652
The plane with parallel coordinates
Inselberg, A. (1985) · The Visual Computer · doi:10.1007/bf01898350 · Cited by 1,423
An effective hash-based algorithm for mining association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223813 · Cited by 1,406
The Use of Faces to Represent Points in k-Dimensional Space Graphically
Chernoff, H. (1973) · Journal of the American Statistical Association · doi:10.1080/01621459.1973.10482434 · Cited by 1,375
Tree visualization with tree-maps: 2-d space-filling approach
Shneiderman, B. (1992) · ACM Transactions on Graphics · doi:10.1145/102377.115768 · Cited by 1,328
Huber, P. J. (1985) · The Annals of Statistics · doi:10.1214/aos/1176349519 · Cited by 1,277
CLARANS: a method for clustering objects for spatial data mining
Ng, R. T., & Han, J. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2002.1033770 · Cited by 1,202
Robertson, G. G., Mackinlay, J. D., & Card, S. K. (1991) · doi:10.1145/108844.108883 · Cited by 1,156
Ueber die stetige Abbildung einer Line auf ein Fl�chenst�ck
Hilbert, D. (1891) · Mathematische Annalen · doi:10.1007/bf01199431 · Cited by 918
The visual display of quantitative information
Azen, S. P. (1983) · Computational Statistics & Data Analysis · doi:10.1016/0167-9473(83)90110-x · Cited by 876
Visual information seeking: tight coupling of dynamic query filters with starfield displays
Ahlberg, C., & Shneiderman, B. (1994) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/191666.191775 · Cited by 824
Becker, R. A., Chambers, J. M., & Wilks, A. R. (1989) · Biometrics · doi:10.2307/2531523 · Cited by 820
The Visual Display of Quantitative Information
Reidhaar, J. W., & Tufte, E. R. (1986) · Design Issues · doi:10.2307/1571646 · Cited by 781
Plots of High-Dimensional Data
Andrews, D. F. (1972) · Biometrics · doi:10.2307/2528964 · Cited by 765
Sur une courbe, qui remplit toute une aire plane
Peano, G. (1890) · Mathematische Annalen · doi:10.1007/bf01199438 · Cited by 684
The Grand Tour: A Tool for Viewing Multidimensional Data
Asimov, D. (1985) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0906011 · Cited by 659
Parallel coordinates: a tool for visualizing multi-dimensional geometry
Inselberg, A., & Dimsdale, B. (2002) · Proceedings of the First IEEE Conference on Visualization: Visualization `90 · doi:10.1109/visual.1990.146402 · Cited by 574
Sur une courbe, qui remplit toute une aire plane
Peano, G. (1990) · Teubner-Archiv zur Mathematik · doi:10.1007/978-3-7091-9537-6_6 · Cited by 511
An effective hash-based algorithm for mining association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1995) · ACM SIGMOD Record · doi:10.1145/568271.223813 · Cited by 491
Dynamic queries for information exploration: an implementation and evaluation
Ahlberg, C., Williamson, C., & Shneiderman, B. (1992) · Proceedings of the SIGCHI conference on Human factors in computing systems - CHI '92 · doi:10.1145/142750.143054 · Cited by 482
Becker, R. A., Eick, S. G., & Wilks, A. R. (1995) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.468391 · Cited by 392
Data-driven discovery of quantitative rules in relational databases
Han, J., Cai, Y., & Cercone, N. (1993) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.204089 · Cited by 380
XmdvTool: integrating multiple methods for visualizing multivariate data
Ward, M. O. (1994) · IEEE Visualization · doi:10.5555/951087.951146 · Cited by 356
An Introduction to Mathematical Taxonomy
Dunn, G., & Everitt, B. J. (1982) · Medical Entomology and Zoology · Cited by 348
VisDB: database exploration using multidimensional visualization
Keim, D. A., & Kriegel, H.-P. (1994) · IEEE Computer Graphics and Applications · doi:10.1109/38.310723 · Cited by 302
Self-citationSystems for knowledge discovery in databases
Matheus, C. J., Chan, P. K., & Piatetsky-Shapiro, G. (1993) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.250073 · Cited by 254
XmdvTool: integrating multiple methods for visualizing multivariate data
Ward, M. O. (2002) · Proceedings Visualization '94 · doi:10.1109/visual.1994.346302 · Cited by 216
An overview of cooperative answering
Gaasterland, T., Godfrey, P., & Minker, J. (1992) · Journal of Intelligent Information Systems · doi:10.1007/bf00962280 · Cited by 209
An Introduction to Mathematical Taxonomy.
Shaw, K. M., Dunn, G., & Everitt, B. S. (1983) · Journal of the Royal Statistical Society Series A (General) · doi:10.2307/2982024 · Cited by 165
Interactive data visualization using focusing and linking
Buja, A., McDonald, J. A., Michalak, J., & Stuetzle, W. (2002) · Proceeding Visualization '91 · doi:10.1109/visual.1991.175794 · Cited by 158
Exploring N-dimensional databases
LeBlanc, J., Ward, M. O., & Wittels, N. (2002) · doi:10.1109/visual.1990.146386 · Cited by 130
Visual information seeking: tight coupling of dynamic query filters with starfield displays
Ahlberg, C., & Shneiderman, B. (1994) · CHI Conference Extended Abstracts on Human Factors in Computing Systems (CHI EA) · doi:10.1145/259963.260390 · Cited by 127
Recursive pattern: a technique for visualizing very large amounts of data
Keim, D. A., Kriegel, H.-P., & Ankerst, M. (2002) · Visualization · doi:10.1109/visual.1995.485140 · Cited by 115
Self-citationProsection Views: Dimensional Inference through Sections and Projections
Furnas, G. W., & Buja, A. (1994) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1994.10474649 · Cited by 96
Visualizing n -dimensional virtual worlds with n -vision
Feiner, S., & Beshers, C. (1990) · ACM Symposium on Interactive 3D Graphics (I3D) · doi:10.1145/91385.91412 · Cited by 92
Knowledge mining by imprecise querying: a classification-based approach
Anwar, T. M., Beck, H., & Navathe, S. B. (2003) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.1992.213146 · Cited by 77
Supporting data mining of large databases by visual feedback queries
Keim, D. A., Kriegel, H.-P., & Seidl, T. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.1994.283045 · Cited by 59
Self-citationVisualizing n -dimensional virtual worlds with n -vision
Feiner, S., & Beshers, C. (1990) · ACM SIGGRAPH Computer Graphics · doi:10.1145/91394.91412 · Cited by 58
Alpern, B., & Carter, L. (1991) · IEEE Visualization · doi:10.5555/949607.949629 · Cited by 47
Alpern, B., & Carter, L. (2002) · doi:10.1109/visual.1991.175790 · Cited by 37
Keim, D. A. (1996) · Lecture notes in computer science · doi:10.1007/3-540-62221-7_9 · Cited by 17
Self-citation
Cited by
Review of Metamodeling Techniques in Support of Engineering Design Optimization
Wang, G. G., & Shan, S. (2007) · Journal of Mechanical Design · doi:10.1115/1.2429697 · Cited by 1,706
Knowledge management and data mining for marketing
Shaw, M. J., Subramaniam, C., Tan, G. W., & Welge, M. E. (2001) · Decision Support Systems · doi:10.1016/s0167-9236(00)00123-8 · Cited by 575
From visual data exploration to visual data mining: A survey
de Oliveira, M. C. F., & Levkowitz, H. (2003) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2003.1207445 · Cited by 511
Visualizing high-dimensional data: advances in the past decade
Liu, S., Maljovec, D., Wang, B., Bremer, P.-T., & Pascucci, V. (2017) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2016.2640960 · Cited by 427
Designing pixel-oriented visualization techniques: theory and applications
Keim, D. A. (2000) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.841121 · Cited by 425
Self-citation
Metadata
- Authors
- Keim, D. A., & Kriegel, H.-P.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 1996
- Volume
- 8
- Issue
- 6
- Pages
- 923-938
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2120329225
- Cited by
- 374
- References
- 52
- FWCI
- 7.51
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.