Visualization techniques for mining large databases: A comparison

被引:158
|
作者
Keim, DA
Kriegel, HP
机构
[1] Insitute for Computer Science, University of Munich, D-80538 München
关键词
data mining; explorative data analysis; visualizing large databases; visualizing multidimensional; multivariate data;
D O I
10.1109/69.553159
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:923 / 938
页数:16
相关论文
共 50 条
  • [41] Methods of data mining and knowledge generalization in large databases
    Vagin, VN
    Fedotov, AA
    Fomin, MV
    JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 1999, 38 (05) : 714 - 727
  • [42] Mining Frequent Gradual Itemsets from Large Databases
    Di-Jorio, Lisa
    Laurent, Anne
    Teisseire, Maguelonne
    ADVANCES IN INTELLIGENT DATA ANALYSIS VIII, PROCEEDINGS, 2009, 5772 : 297 - +
  • [43] Mining Weighted a Closed Sequential Patterns in Large Databases
    Ren, Jia-Dong
    Yang, Jing
    Li, Yan
    FIFTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 5, PROCEEDINGS, 2008, : 640 - 644
  • [44] Turbo-charging vertical mining of large databases
    Shenoy, P
    Haritsa, JR
    Sudarshan, S
    Bhalotia, G
    Bawa, M
    Shah, D
    SIGMOD RECORD, 2000, 29 (02) : 22 - 33
  • [45] Mining gene interactions from large expression databases
    Kim, SK
    FASEB JOURNAL, 2003, 17 (04): : A559 - A559
  • [46] Parallel algorithms for mining association rules in large databases
    Kudo, T
    Ashihara, H
    Shimizu, K
    INTELLIGENT SYSTEMS, 1997, : 125 - 128
  • [47] An efficient mining method for incremental updation in large databases
    Lee, WJ
    Lee, SJ
    INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING, 2003, 2690 : 630 - 637
  • [48] An Incremental Technique for Mining Coverage Patterns in Large Databases
    Ralla, Akhil
    Reddy, P. Krishna
    Mondal, Anirban
    2019 IEEE INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS (DSAA 2019), 2019, : 211 - 220
  • [49] Efficient mining of categorized association rules in large databases
    Tseng, SM
    SMC 2000 CONFERENCE PROCEEDINGS: 2000 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN & CYBERNETICS, VOL 1-5, 2000, : 3606 - 3610
  • [50] Interactive visualization in mining large decision trees
    Nguyen, TD
    Ho, TB
    Shimodaira, H
    KNOWLEDGE DISCOVERY AND DATA MINING, PROCEEDINGS: CURRENT ISSUES AND NEW APPLICATIONS, 2000, 1805 : 345 - 348