Redundancy, deduction schemes, and minimum-size bases for association rules

Logical Methods in Computer Science

Volumn 6, Issue 2, 2010, Pages 1-33

  Balcàzar, Josè L ^a  

^a UNIVERSITY OF CANTABRIA   (Spain)

Author keywords

Association rules; Data mining; Deductive calculus; Implications; Optimum bases; Redundancy

Indexed keywords

CALCULATIONS; DATA MINING; FORMAL LOGIC; REDUNDANCY;

BASIS FOR ASSOCIATION RULES; BINARY VARIABLES; CONDITIONAL PROBABILITIES; DATA ANALYSIS-METHODS; DEDUCTIVE CALCULUS; IMPLICATION; LOW BOUND; OPTIMUM BASE; PROPOSITIONAL LOGIC; SOUND AND COMPLETE;

ASSOCIATION RULES;

EID: 77957355417     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-6(2:3)2010     Document Type: Article

References (45)

1. C C Aggarwal, P S Yu.: A New Approach to Online Generation of Association Rules. IEEE Transactions on Knowledge and Data Engineering, 13 (2001), 527-540. See also ICDE'98.
2. R Agrawal, T Imielinski, A Swami: Mining Association Rules between Sets of Items in Very Large Databases. ACM SIGMOD 1993, 207-216.
3. R Agrawal, H Mannila, R Srikant, H Toivonen, AI Verkamo: Fast Discovery of Association Rules. In: Advances in Knowledge Discovery and Data Mining, U Fayyad et al. (eds.), AAAI Press 1996, 307-328.
4. M Arias, JL Balcfiazar: Construction and Learnability of Canonical Horn Formulas. Submitted. Pre-liminary version in ALT'2009.
5. J L Balcfiazar: Minimum-Size Bases of Association Rules. ECML-PKDD'08, Antwerp, 86-101.
6. J L Balcfiazar: Deduction Schemes for Association Rules. Discovery Science 2008, 124-135.
7. J L Balcfiazar, A Bifet, A Lozano: Mining Implications from Lattices of Closed Trees. Extraction et Gestion des Connaissances 2008.
8. C Borgelt: Eficient Implementations of Apriori and Eclat. Workshop on Frequent Itemset Mining Implementations (2003). See borgelt.net
9. J-F Boulicaut, A Bykowski, C Rigotti: Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries. Data Min. Knowl. Discov. 7, 1 (2003), 5-22.
10. T Calders, B Goethals: Mining All Non-Derivable Frequent Itemsets. PKDD 2002, LNCS 2431, 74-85.
11. T Calders, C Rigotti, J-F Boulicaut: A Survey on Condensed Representations for Frequent Sets. Constraint-Based Mining and Inductive Databases 2004, 64-80.
12. A Ceglar, J F Roddick: Association Mining. ACM Computing Surveys 38 (2006).
13. L Cristofor, D Simovici: Generating an Informative Cover for Association Rules. ICDM 2002, 597-613.
14. B A Davey, H A Priestley: Introduction to Lattices and Order. Cambridge University Press, 1990.
15. R Dechter, J Pearl: Structure Identification in Relational Data. Artificial Intelligence 58 (1992), 237-270.
16. T Eiter, G Gottlob: Identifying the Minimal Transversals of a Hypergraph and Related Problems. SIAM J. Comput. 24 (1995), 1278-1304.
17. Frequent Itemset Mining Implementations Repository (http://fimi.cs.helsinki.fi).
18. A Freitas: Understanding the Crucial Difierences between Classification and Discovery of Association Rules. SIGKDD Explorations, 2 (2000), 65-69.
19. B Ganter, R Wille: Formal Concept Analysis. Springer 1999.
20. G C Garriga: Statistical Strategies for Pruning All the Uninteresting Association Rules. ECAI 2004, 430-434.
21. L Geng, H J Hamilton: Interestingness Measures for Data Mining: A Survey. ACM Computing Surveys 38 (2006).
22. B Goethals, J Muhonen, H Toivonen: Mining Non-Derivable Association Rules. SDM 2005.
23. J-L Guigues, V Duquenne: Famille minimale d'implications informatives rfiesultant d'un tableau de donnfiees binaires. Mathfiematiques et Sciences Humaines 24 (1986), 5-18.
24. D Gunopulos, R Khardon, H Mannila, S Saluja, H Toivonen, RS Sharma: Discovering All Most Specific Sentences. ACM Trans. Database Syst., 28 (2003), 140-174.
25. M Hahsler: Annotated Bibliography on Association Rule Mining http://michael.hahsler.net/research/associationrules
26. R Khardon, D Roth: Reasoning with Models. Artificial Intelligence 87 (1996), 187-213.
27. M Kryszkiewicz: Representative Association Rules. Pacific-Asia KDD Conference, PAKDD'98, LNCS 1394, 198-209.
28. M Kryszkiewicz: Fast Discovery of Representative Association Rules. RSCTC, 1998, 214-221.
29. M Kryszkiewicz: Concise Representations of Association Rules. Pattern Detection and Discovery 2002 (LNCS 2447), 187-203.
30. G Li, H Hamilton: Basic Association Rules. SDM 2004.
31. B Liu, W Hsu, Y Ma: Pruning and Summarizing the Discovered Associations. KDD 1999, 125-134.
32. B Liu, M Hu, W Hsu: Multi-Level Organization and Summarization of the Discovered Rules. KDD 2000, 208-217.
33. M Luxenburger: Implications Partielles dans un Contexte. Mathfiematiques et Sciences Humaines 29 (1991), 35-55.
34. N Megiddo, R Srikant: Discovering Predictive Association Rules. KDD 1998, 274-278
35. J Muhonen, H Toivonen: Closed Non-Derivable Itemsets. PKDD 2006, 601-608.
36. N Pasquier, R Taouil, Y Bastide, G Stumme, L Lakhal: Generating a Condensed Representation for Association Rules. Journal of Intelligent Information Systems 24 (2005), 29-60.
37. J L Pfaltz, C M Taylor: Scientific Discovery through Iterative Transformations of Concept Lattices. Workshop on Discrete Mathematics and Data Mining at SDM 2002, 65-74.
38. V Phan-Luong: The Representative Basis for Association Rules. ICDM 2001, 639-640.
39. V Phan-Luong: The Closed Keys Base of Frequent Itemsets. DaWaK 2002, 181-190.
40. J Saquer, J S Deogun: Using Closed Itemsets for Discovering Representative Association Rules. IS-MIS 2000, LNAI 1932, 495-504.
41. D A Simovici, D Cristofor, L Cristofor: Mining Purity Dependencies in Databases. Extraction et Gestion des Connaissances EGC 2002, 257-268.
42. A Tuzhilin, B Liu: Querying Multiple Sets of Discovered Rules. KDD 2002, 52-60.
43. M Wild: A Theory of Finite Closure Spaces Based on Implications. Advances in Mathematics 108 (1994), 118-139.
44. M Zaki: Mining Non-Redundant Association Rules. Data Mining and Knowledge Discovery 9 (2004), 223-248.
45. M Zaki, M Ogihara: Theoretical Foundations of Association Rules. Workshop on research issues in DMKD (1998).