Interestingness of frequent itemsets using Bayesian networks as background knowledge

KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2004, Pages 178-186

  Jaroszewicz, Szymon ^a   Simovici, Dan A ^b  

^a WEST POMERANIAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF MASSACHUSETTS BOSTON   (United States)

Author keywords

Association rule; Background knowledge; Bayesian network; Frequent itemset; Interestingness

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA MINING; DATABASE SYSTEMS; GRAPH THEORY; LOGIC PROGRAMMING; NEURAL NETWORKS; PROBLEM SOLVING;

ASSOCIATION RULE; BACKGROUND KNOWLEDGE; BAYESIAN NETWORK; FREQUENT ITEMSET; INTERESTINGNESS;

KNOWLEDGE ENGINEERING;

EID: 12244313033     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014052.1014074     Document Type: Conference Paper

References (33)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD Conference on Management of Data, pages 207-216, Washington, D.C., 1993.
2. American Heart Association. Risk factors: High blood cholesterol and other lipids. http://www.americanheart.org/downloadable/ heart/ 1045754065601FS13CH03.pdf, 2003.
3. R. J. Bayardo and R. Agrawal. Mining the most interesting rules. In Proc. of the 5th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pages 145-154, August 1999.
4. Susanne G. Bøttcher and Claus Dethlefsen. Deal: A package for learning bayesian networks. www.math.auc.dk/novo/Publications/ bottcher:dethlefsen:03.ps, 2003.
5. Rina Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113(1-2):41-85, 1999.
6. Guozhu Dong and Jinyan Li. Efficient mining of emerging patterns: Discovering trends and differences. In Proc. of the 5th Intl. Conf. on Knowledge Discovery and Data Mining (KDD'99), pages 43-52, San Diego, CA, 1999.
7. William DuMouchel and Daryl Pregibon. Empirical bayes screening for multi-item associations. In Proceedings of the Seventh International Conference on Knowledge Discovery and Data Mining, pages 67-76, 2001.
8. H. Gray. Gray's Anatomy. Grammercy Books, New York, 1977.
9. Venky Harinarayan, Anand Rajaraman, and Jeffrey D. Ullman. Implementing data cubes efficiently. In Proc. ACM SIGMOD, pages 205-216, 1996.
10. David Heckerman. A tutorial on learning with Bayesian networks. Technical Report MSR-TR-95-06, Microsoft Research, Redmond, WA, 1995.
11. R. Hilderman and H. Hamilton. Knowledge discovery and interestingness measures: A survey. Technical Report CS 99-04, Department of Computer Science, University of Regina, 1999.
12. C. Huang and A. Darwiche. Inference in belief networks: A procedural guide. Intl. Journal of Approximate Reasoning, 15(3):225-263, 1996.
13. S. Jaroszewicz and D. A. Simovici. A general measure of rule interestingness. In 5th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD 2001), pages 253-265, 2001.
14. S. Jaroszewicz and D. A. Simovici. Pruning redundant association rules using maximum entropy principle. In Advances in Knowledge Discovery and Data Mining, 6th Pacific-Asia Conference, PAKDD'02, pages 135-147, Taipei, Taiwan, May 2002.
15. Finn V. Jensen. Bayesian Networks and Decision Graphs. Springer Verlag, New York, 2001.
16. Bing Liu, Wynne Hsu, and Shu Chen. Using general impressions to analyze discovered classification rules. In Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), page 31. AAAI Press, 1997.
17. Bing Liu, Wynne Jsu, Yiming Ma, and Shu Chen. Mining interesting knowledge using DM-II. In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 430-434, N.Y., August 15-18 1999.
18. Heikki Mannila. Local and global methods in data mining: Basic techniques and open problems. In ICALP 2002, 29th International Colloquium on Automata, Languages, and Programming, Malaga, Spain, July 2002. Springer-Verlag.
19. Heikki Mannila and Hannu Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997.
20. T.M. Mitchell. Machine Learning. McGraw-Hill, 1997.
21. Kevin Murphy. A brief introduction to graphical models and bayesian networks, http://www.ai.mit.edu/~murphyk/Bayes/bnintro.html, 1998.
22. B. Padmanabhan and A. Tuzhilin. Belief-driven method for discovering unexpected patterns. In Proceedings, of the 4th International Conference on Knowledge Discovery and Data Mining (KDD'98), pages 94-100, August 1998.
23. B. Padmanabhan and A. Tuzhilin. Small is beautiful: discovering the minimal set of unexpected patterns. In Proceedinmgs of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'00), pages 54-63, N. Y., August 2000.
24. B. Padmanabhan and A. Tuzhilin. Methods for knowledge refinement based on unexpected patterns. Decision Support Systems, 33(3):221-347, July 2002.
25. Judea Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, Los Altos, CA, 1998.
26. P.Myllymäki, T.Silander, H.Tirri, and P.Uronen. B-course: A web-based tool for bayesian and causal data analysis. International Journal on Artificial Intelligence Tools, 11(3):369-387, 2002.
27. D. Poole and N. L. Zhang. Exploiting contextual independence in probablisitic inference. Journal of Artificial Intelligence Research, 18:263-313, 2003.
28. D. Shah, L. V. S. Lakshmanan, K. Ramamritham, and S. Sudarshan. Interestingness and pruning of mined patterns. In 1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 1999.
29. Abraham Silberschatz and Alexander Tuzhilin. On subjective measures of interestingness in knowledge discovery. In Knowledge Discovery and Data Mining, pages 275-281, 1995.
30. E. Suzuki. Autonomous discovery of reliable exception rules. In Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), page 259. AAAI Press, 1997.
31. E. Suzuki and Y. Kodratoff. Discovery of surprising exception rules based on intensity of implication. In Proc of PKDD-98, Nantes, France, pages 10-18, 1998.
32. P.-N. Tan, V. Kumar, and J. Srivastava. Selecting the right interestingness measure for association patterns. In Proc of the Eighth ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining (KDD-2002), pages 32-41, 2002.
33. M. J. Zaki. Generating non-redundant association rules. In Proceedinmgs of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-00), pages 34-43, N. Y., August 20-23 2000.