Independence Diagrams: A Technique for Visual Data Mining
暂无分享,去创建一个
[1] Sanjay Ranka,et al. A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data , 1997, VLDB.
[2] Hans-Peter Kriegel,et al. Supporting data mining of large databases by visual feedback queries , 1994, Proceedings of 1994 IEEE 10th International Conference on Data Engineering.
[3] D. F. Andrews,et al. PLOTS OF HIGH-DIMENSIONAL DATA , 1972 .
[4] Haim Levkowitz,et al. Color Theory and Modeling for Computer Graphics, Visualization, and Multimedia Applications , 1997 .
[5] Torsten Suel,et al. Optimal Histograms with Quality Guarantees , 1998, VLDB.
[6] Yannis E. Ioannidis,et al. Balancing histogram optimality and practicality for query result size estimation , 1995, SIGMOD '95.
[7] Rakesh Agrawal,et al. A One-Pass Space-Efficient Algorithm for Finding Quantiles , 1995, COMAD.
[8] Ramakrishnan Srikant,et al. Mining quantitative association rules in large relational tables , 1996, SIGMOD '96.
[9] Peter J. Haas,et al. Improved histograms for selectivity estimation of range predicates , 1996, SIGMOD '96.
[10] George Hripcsak,et al. Two Applications of Statistical Modelling to Natural Language Processing , 1995, AISTATS.
[11] Yasuhiko Morimoto,et al. Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization , 1996, SIGMOD '96.
[12] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[13] Yannis E. Ioannidis,et al. Selectivity Estimation Without the Attribute Value Independence Assumption , 1997, VLDB.
[14] MorishitaShinichi,et al. Data mining using two-dimensional optimized association rules , 1996 .
[15] Hans-Peter Kriegel,et al. 'Circle Segments': A Technique for Visually Exploring Large Multidimensional Data Sets , 1996 .