Optimization of association rule mining queries

Intelligent Data Analysis

Volumn 6, Issue 4, 2002, Pages 341-357

  Jeudy, Baptiste ^a   Boulicaut, Jean François ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

association rules; condensed representations; constraints; inductive queries

Indexed keywords

DATA MINING;

APRIORI ALGORITHMS; CONDENSED REPRESENTATIONS; CONSTRAINTS; EXPERIMENTAL VALIDATIONS; FREQUENCY THRESHOLD; FREQUENT CLOSED SETS; INDUCTIVE QUERIES; LEVEL-WISE ALGORITHMS;

ASSOCIATION RULES;

EID: 0141983698     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/ida-2002-6404     Document Type: Article

References (28)

1. R. Agrawal, T. Imielinski and A. Swami, Mining association rules between sets of items in large databases, in: Proceedings of ACMSIGMOD Conference on Management of Data (SIGMOD'93), ACM,Washington, DC, USA, May 1993, pp. 207-216.
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen and A.I. Verkamo, Fast discovery of association rules, in: Advances in Knowledge Discovery and Data Mining, AAAI Press, Menlo Park, CA, 1996, pp. 307-328.
3. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme and L. Lakhal, Mining frequent patterns with counting inference, SIGKDD Explorations 2(2) (Dec 2000), 66-75.
4. J.-F. Boulicaut and A. Bykowski, Frequent closures as a concise representation for binary data mining, in: Proceedings of the Fourth Pacific-Asia Conference on Knowledge Discovery and Data Mining PAKDD'00, volume 1805 of Lecture Notes in Artificial Intelligence, Springer-Verlag, Kyoto, JP, April 2000, pp. 62-73.
5. J.-F. Boulicaut, A. Bykowski and B. Jeudy, Mining association rules with negations, Technical Report 2000-19, INSA Lyon-LISI, Institut National des Sciences Appliqúees de Lyon, B̂atiment Blaise Pascal, F-69621 Villeurbanne, France, 2000.
6. J.-F. Boulicaut, A. Bykowski and C. Rigotti, Approximation of frequency queries by mean of free-sets, in: Proceedings of the Fourth European Conference on Principles and Practice of Knowledge Discovery in Databases PKDD'00, volume 1910 of Lecture Notes in Artificial Intelligence, Springer-Verlag, Lyon, F, Sep 2000, pp. 75-85.
7. J.-F. Boulicaut and B. Jeudy, Mining free-sets under constraints, in: Proceedings of the International Database Engineering & Applications Symposium IDEAS'01, IEEE Computer Society, Grenoble, F, July 2001, pp. 322-329.
8. J.-F. Boulicaut, M. Klemettinen and H. Mannila, Modeling KDD processes within the inductive database framework, in: Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery DaWaK'99, volume 1676 of Lecture Notes in Computer Science, Springer-Verlag, Florence, I, Sep 1999, pp. 293-302.
9. S. Brin, R. Motwani and C. Silverstein, Beyond market baskets: Generalizing association rules to correlations, in: Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD'97), J.M. Peckman, ed., ACM, Tucson, AZ, May 1997, pp. 265-276.
10. B. Goethals and J. van den Bussche, A priori versus a posteriori filtering of association rules, in: Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery DMKD'99, Philadelphia, USA, May 1999.
11. G. Grahne, L.V.S. Lakshmanan and X. Wang, Efficient mining of constrained correlated sets, in: Proceedings of the 16th International Conference on Data Engineering ICDE 2000, IEEE Computer Society Press, San Diego, USA, 2000, pp. 512-521.
12. J. Han, Y. Fu, W. Wang, K. Koperski and O. Zaiane, DMQL: a data mining query language for relational databases, in: SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery DMKD'96, Montreal, Canada, June 1996.
13. T. Imielinski and H. Mannila, A database perspective on knowledge discovery, Communications of the ACM 39(11) (Nov 1996), 58-64.
14. T. Imielinski and A. Virmani, MSQL: A query language for database mining, Data Mining and Knowledge Discovery 3(4) (1999), 373-408.
15. B. Jeudy, Extraction sous contraintes de repŕesentations condenśees: application ̀a l'optimisation de reqûetes inductives sur des donńees transactionnelles, PhD thesis, Institut National des Sciences Appliqúees de Lyon, B̂atiment Blaise Pascal, F-69621 Villeurbanne cedex, 2002, in preparation.
16. L.V. Lakshmanan, R. Ng, J. Han and A. Pang, Optimization of constrained frequent set queries with 2-variable constraints, in: Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD'99), ACM Press, Philadelphia, USA, 1999, pp. 157-168.
17. H. Mannila and H. Toivonen, Multiple uses of frequent sets and condensed representations, in: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD'96), Portland, USA, Aug. AAAI Press, 1996, pp. 189-194.
18. H. Mannila and H. Toivonen, Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery 1(3) (1997), 241-258.
19. R. Meo, G. Psaila and S. Ceri, A new SQL-like operator for mining association rules, in: Proceedings of the 22nd International Conference on Very Large Data Bases (VLDB'96), Morgan Kaufmann, Mumbay, India, Sep 1996, pp. 122-133.
20. R. Ng, L.V. Lakshmanan, J. Han and A. Pang, Exploratory mining and pruning optimizations of constrained associations rules, in: Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD'98), ACM Press, Seattle, Washington, USA, 1998, pp. 13-24.
21. N. Pasquier, Y. Bastide, R. Taouil and L. Lakhal, Closed set based discovery of small covers for association rules, in: Proceedings og the 15th Jourńees Bases de Donńees Avanćees BDA'99, Bordeaux, F, Oct 1999, pp. 361-381.
22. N. Pasquier, Y. Bastide, R. Taouil and L. Lakhal, Efficient mining of association rules using closed itemset lattices, Information Systems 24(1) (Jan 1999), 25-46.
23. J. Pei, J. Han and L.V.S. Lakshmanan, Mining frequent itemsets with convertible constraints, in: Proceedings of the 17th International Conference on Data Engineering ICDE'01, IEEE Computer Society Press, Heidelberg, Germany, April 2001.
24. J. Pei, J. Han and R. Mao, CLOSET an efficient algorithm for mining frequent closed itemsets, in: Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery DMKD'00, Dallas, USA, May 2000.
25. P. Smyth and R.M. Goodman, An information theoretic approach to rule induction from databases, IEEE Transactions on Knowledge and Data Engineering 4(4) (August 1992), 301-316.
26. R. Srikant, Q. Vu and R. Agrawal, Mining association rules with item constraints, in: Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD'97), AAAI Press, Newport Beach, CA, USA, 1997, pp. 67-73.
27. M.J. Zaki, Generating non-redundant association rules, in: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining SIGKDD'00, AAAI Press, Boston, USA, Aug 2000, pp. 34-43.
28. M.J. Zaki, Sequence mining in categorical domains: incorporating constraints, in: Proceedings of the 9th International Conference on Information and Knowledge Management CIKM'01, ACM, Washington, DC, USA, Nov 2001, pp. 422-429.