The interestingness paradox in pattern discovery

Journal of Applied Statistics

Volumn 31, Issue 8, 2004, Pages 1019-1035

  Padmanabhan, Balaji ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Interestingness measures; Minimality; Rule discovery

Indexed keywords

EID: 8744299419     PISSN: 02664763     EISSN: None     Source Type: Journal    
DOI: 10.1080/0266476042000270563     Document Type: Article

References (27)

1. Agrawal, R., Imielinksi, T. & Swami, A. (1993) Mining association rules between sets of items in large databases, in: Proceedings of the ACM SIGMOD Conference on Management of Data, pp. 207-216.
2. Aggarwal, C. & Yu, P. S. (2001) A new approach to online generation of association rules, IEEE Transactions on Knowledge and Data Engineering, 13(4), pp. 527-540.
3. Aumann, Y. & Lindell, Y. (1999) A statistical theory for quantitative association rules, in: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining pp.261-270 (San Diego, CA).
4. Bayardo, R. & Agrawal, R. (1999) Mining the most interesting rules, in: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 145-154 (San Diego, CA).
5. Bastide, Y., Pasquier, N., Taouil, R., Stumme, G. & Lakhal, L. (2000) Mining minimal non-redundant association rules using frequent closed itemsets, in: Proceedings of the First International Conference on Computational Logic, pp. 972-986 (Springer-Verlag).
6. Brin, S., Motwani, R., Ullman, J. D. & Tsur, S. (1997) Dynamic itemset counting and implication rules for market basket data, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 255-264.
7. Fukuda, T., Morimoto, Y., Morishita, S. & Tokuyama, T. (1996) Data mining using two-dimensional optimized association rules: scheme, algorithms and visualization, in: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data (SIGMOD'96), pp. 13-23 (Montreal, Quebec, Canada).
8. Hand, D., Mannila, H. & Smyth, P. (2001) Principles of Data Mining (Cambridge, MA: MIT Press).
9. Hilderman, R. J. & Hamilton, H. J. (1999) Knowledge discovery and interestingness measures: a survey. Technical Report CS-99-04, Department of Computer Science, University of Regina.
10. Jaroszewicz, S. & Simovici, D. A. (2002) Pruning redundant association rules using maximum entropy principle, in: Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, pp. 135-147.
11. Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H. & Verkamo, A. I. (1994) Finding interesting rules from large sets of discovered association rules, in: Proceedings of the Third International Conference on Information and Knowledge Management, pp. 401-407.
12. Liu, B. & Hsu, W. (1996) Post-analysis of learned rules, in: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI'96), pp. 828-834.
13. Liu, B., Hsu, W. & Ma, Y. (1999) Pruning and summarizing the discovered rules, in: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 125-134 (San Diego, CA).
14. Piatetsky-Shapiro, G. (1991) Discovery, analysis, and presentation of strong rules, in: G. Piatetsky-Shapiro & W. J. Frawley (Eds) Knowledge Discovery in Databases, pp. 229-248 (Menlo Park, CA: AAAI/MIT Press).
15. Piatetsky-Shapiro, G. & Mathens, C. J. (1994) The interestingness of deviations, in: Proceedings of the AAAI-94 Workshop on Knowledge Discovery in Databases, pp. 25-36.
16. Padmanabhan, B. & Tuzhilin, A. (1998) A belief-driven method for discovering unexpected patterns, in: Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, pp.94-100.
17. Padmanabhan, B. & Tuzhilin, A. (2000) Small is beautiful: discovering the minimal set of unexpected patterns, in: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 54-63 (Boston, MA).
18. Sahar, S. (2001) Interestingness preprocessing, in: Proceedings of the IEEE International Conference on Data Mining, pp. 489-496.
19. Sahar, S. (2003) What is interesting: studies on interestingness in knowledge discovery, PhD Thesis, Tel-Aviv University.
20. Shah, D., Lakshmanan, L. V. S., Ramamritham, K. & Sudarshan, S. (1999) Interestingness and pruning of mined patterns, in: Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD) (Philadelphia).
21. Silberschatz, A. & Tuzhilin, A. (1995) On subjective measures of interestingness in knowledge discovery, in: Proceedings of the First International Conference on Knowledge Discovery and Data Mining, pp.275-281.
22. Srkant, R. & Agrawal, R. (1996) Mining quantitative association rules in large relational tables, in: Proceedings of the ACM SIGMOD Conference on Management of Data.
23. Suzuki, E. (1997) Autonomous discovery of reliable exception rules, in: Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, pp. 259-262.
24. Toivonen, H., Klemetinen, M., Ronkainen, P., Hatonen, K. & Mannila, H. (1995) Pruning and grouping discovered association rules, in: MLNet Workshop on Statistics, Machine Learning and Discovery in Databases, pp. 47-52.
25. Webb, G. I. (2001) Discovering associations with numeric variables, in: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (San Francisco).
26. Zaki, M. J. (2000) Generating non-redundant association rules, in: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 34-43.
27. Zhang, H., Padmanabhan, B. & Tuzhilin, A. (2004) On the discovery of significant statistical quantitative rules. To appear, in Proceedings of KDD-2004.