Towards effective and interpretable data mining by visual interaction

ABSTRACT

The primary aim of most data mining algorithms is to facilitate the discovery of concise and interpretable information from large amounts of data. However, many of the current formalizations of data mining algorithms have not quite reached this goal. One of the reasons for this is that the focus on using purely automated techniques has imposed several constraints on data mining algorithms. For example, any data mining problem such as clustering or association rules requires the specification of particular problem formulations, objective functions, and parameters. Such systems fail to take the user's needs into account very effectively. This makes it necessary to keep the user in the loop in a way which is both efficient and interpretable. One unique way of achieving this is by leveraging human visual perceptions on intermediate data mining results. Such a system combines the computational power of a computer and the intuitive abilities of a human to provide solutions which cannot be achieved by either. This paper will discuss a number of recent approaches to several data mining algorithms along these lines.

REFERENCES

• 1: Charu C. Aggarwal , Philip S. Yu, Online Generation of Association Rules, Proceedings of the Fourteenth International Conference on Data Engineering, p.402-411, February 23-27, 1998
• 2: Charu C. Aggarwal , Joel L. Wolf , Philip S. Yu , Cecilia Procopiuc , Jong Soo Park, Fast algorithms for projected clustering, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, p.61-72, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
• 3: Charu C. Aggarwal, A human-computer cooperative system for effective high dimensional clustering, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, p.221-226, August 26-29, 2001, San Francisco, California [doi>10.1145/502512.502542]
• 4: C. C. Aggarwal. Towards Exploratory Instance Centered Classification of High Dimensional Data. IBM Research Report, 2002.
• 5: C. C. Aggarwal. Towards Meaningful High Dimensional Nearest Neighbor Search by Human-Computer Interaction. ICDE Conference, 2002.
• 6: Charu C. Aggarwal , Alexander Hinneburg , Daniel A. Keim, On the Surprising Behavior of Distance Metrics in High Dimensional Spaces, Proceedings of the 8th International Conference on Database Theory, p.420-434, January 04-06, 2001
• 7: Charu C. Aggarwal , Philip S. Yu, Finding generalized projected clusters in high dimensional spaces, Proceedings of the 2000 ACM SIGMOD international conference on Management of data, p.70-81, May 15-18, 2000, Dallas, Texas, United States
• 8: Charu C. Aggarwal , Philip S. Yu, The IGrid index: reversing the dimensionality curse for similarity indexing in high dimensional space, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, p.119-129, August 20-23, 2000, Boston, Massachusetts, United States [doi>10.1145/347090.347116]
• 9: Rakesh Agrawal , Johannes Gehrke , Dimitrios Gunopulos , Prabhakar Raghavan, Automatic subspace clustering of high dimensional data for data mining applications, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.94-105, June 01-04, 1998, Seattle, Washington, United States
• 10: Mihael Ankerst , Martin Ester , Hans-Peter Kriegel, Towards an effective cooperation of the user and the computer for classification, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, p.179-188, August 20-23, 2000, Boston, Massachusetts, United States [doi>10.1145/347090.347124]
• 11: Stefan Berchtold , Daniel A. Keim , Hans-Peter Kriegel, The X-tree: An Index Structure for High-Dimensional Data, Proceedings of the 22th International Conference on Very Large Data Bases, p.28-39, September 03-06, 1996
• 12: Kevin S. Beyer , Jonathan Goldstein , Raghu Ramakrishnan , Uri Shaft, When Is ''Nearest Neighbor'' Meaningful?, Proceeding of the 7th International Conference on Database Theory, p.217-235, January 10-12, 1999
• 13: Kaushik Chakrabarti , Sharad Mehrotra, Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces, Proceedings of the 26th International Conference on Very Large Data Bases, p.89-100, September 10-14, 2000
• 14: M. Ester, H.-P. Kriegel, J. Sander, M. Wimmer, X. Xu. Density-Connected Sets and their Application for Trend Detection in Spatial databases. Proceedings of the KDD Conference, 1997.
• 15: C. Faloutsos , R. Barber , M. Flickner , J. Hafner , W. Niblack , D. Petkovic , W. Equitz, Efficient and effective querying by image content, Journal of Intelligent Information Systems, v.3 n.3-4, p.231-262, July 1994 [doi>10.1007/BF00962238]
• 16: Jiawei Han , Laks V. S. Lakshmanan , Raymond T. Ng, Constraint-Based, Multidimensional Data Mining, Computer, v.32 n.8, p.46-50, August 1999 [doi>10.1109/2.781634]
• 17: Alexander Hinneburg , Charu C. Aggarwal , Daniel A. Keim, What Is the Nearest Neighbor in High Dimensional Spaces?, Proceedings of the 26th International Conference on Very Large Data Bases, p.506-515, September 10-14, 2000
• 18: Alexander Hinneburg , Daniel A. Keim , Markus Wawryniuk, HD-Eye: Visual Mining of High-Dimensional Data, IEEE Computer Graphics and Applications, v.19 n.5, p.22-31, September 1999 [doi>10.1109/38.788795]
• 19: Heike Hofmann , Arno P. J. M. Siebes , Adalbert F. X. Wilhelm, Visualizing association rules with interactive mosaic plots, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, p.227-235, August 20-23, 2000, Boston, Massachusetts, United States [doi>10.1145/347090.347133]
• 20: Anil K. Jain , Richard C. Dubes, Algorithms for clustering data, Prentice-Hall, Inc., Upper Saddle River, NJ, 1988
• 21: Norio Katayama , Shin'ichi Satoh, The SR-tree: an index structure for high-dimensional nearest neighbor queries, Proceedings of the 1997 ACM SIGMOD international conference on Management of data, p.369-380, May 11-15, 1997, Tucson, Arizona, United States
• 22: Norio Katayama , Shin'ichi Satoh, Distinctiveness-Sensitive Nearest Neighbor Search for Efficient Similarity Retrieval of Multimedia Information, Proceedings of the 17th International Conference on Data Engineering, p.493-502, April 02-06, 2001
• 23: D. A. Keim. Visual Support for Query Specification and Data Mining. Shaker Publishing Company, Aachen, Germany 1995.
• 24: Daniel A. Keim , Hans-Peter Kriegel , Thomas Seidl, Supporting Data Mining of Large Databases by Visual Feedback Queries, Proceedings of the Tenth International Conference on Data Engineering, p.302-313, February 14-18, 1994
• 25: King Ip Lin , H. V. Jagadish , Christos Faloutsos, The TV-tree: an index structure for high-dimensional data, The VLDB Journal — The International Journal on Very Large Data Bases, v.3 n.4, October 1994
• 26: Y. Rui, T. S. Huang, S. Mehrotra, Content-based image retrieval with relevance feedback in MARS. Proceedings of the IEEE Conference on Image Processing, 1997.
• 27: G. Salton, The SMART Retrieval System—Experiments in Automatic Document Processing, Prentice-Hall, Inc., Upper Saddle River, NJ, 1971
• 28: Joseph Y. Halpern, Hypothetical knowledge and counterfactual reasoning, Proceedings of the 26th International Conference on Very Large Data Bases, p.307-316, September 10-14, 2000
• 29: Thomas Seidl , Hans-Peter Kriegel, Efficient User-Adaptable Similarity Search in Large Multimedia Databases, Proceedings of the 23rd International Conference on Very Large Data Bases, p.506-515, August 25-29, 1997
• 30: B. W. Silverman. Density Estimation for Statistics and Data Analysis, Chapman and Hall, 1986.
• 31: Ramakrishnan Srikant , Rakesh Agrawal, Mining quantitative association rules in large relational tables, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.1-12, June 04-06, 1996, Montreal, Quebec, Canada
• 32: Anthony K. H. Tung , Raymond T. Ng , Laks V. S. Lakshmanan , Jiawei Han, Constraint-based clustering in large databases, Proceedings of the 8th International Conference on Database Theory, p.405-419, January 04-06, 2001
• 33: Roger Weber , Hans-Jörg Schek , Stephen Blott, A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces, Proceedings of the 24rd International Conference on Very Large Data Bases, p.194-205, August 24-27, 1998
• 34: Leejay Wu , Christos Faloutsos , Katia P. Sycara , Terry R. Payne, FALCON: Feedback Adaptive Loop for Content-Based Retrieval, Proceedings of the 26th International Conference on Very Large Data Bases, p.297-306, September 10-14, 2000