DBC: A condensed representation of frequent patterns for efficient mining

Information Systems

Volumn 28, Issue 8, 2003, Pages 949-977

  Bykowski, Artur ^a   Rigotti, Christophe ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Condensed representations; Data mining; Frequent patterns

Indexed keywords

ALGORITHMS; KNOWLEDGE BASED SYSTEMS; KNOWLEDGE REPRESENTATION; SET THEORY;

CONDENSED REPRESENTATIONS; DISJUNCTION BORDERED CONDENSATION; FREQUENT PATTERNS;

DATA MINING;

EID: 0142008547     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0306-4379(03)00002-4     Document Type: Article

References (24)

1. R. Agrawal, R. Srikant, Fast algorithms for mining association rules in large databases, in: J.B. Bocca, M. Jarke, C. Zaniolo (Eds.), Proceedings of the 20th International Conference on Very Large Data Bases (VLDB'94), Santiago de Chile, Chile, 1994, pp. 487-499.
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, A.I. Verkamo, Fast discovery of association rules, in: U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, R. Uthurusamy (Eds.), Advances in Knowledge Discovery and Data Mining, AAAI Press, New York, 1996, pp. 307-328.
3. H. Toivonen, Sampling large databases for association rules, in: T.M. Vijayaraman, A.P. Buchmann, C. Mohan, N.L. Sarda (Eds.), Proceedings of the 22nd International Conference on Very Large Data Bases (VLDB'96), Bombay, India, 1996, pp. 134-145.
4. S. Brin, R. Motwani, J.D. Ullman, S. Tsur, Dynamic itemset counting and implication rules for market basket data, in: J. Peckham (Ed.), Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'97), Tucson, AZ, USA, 1997, pp. 255-264.
5. R.C. Agarwal, C.C. Aggarwal, V.V Prasad, A tree projection algorithm for finding frequent itemsets, J. Parallel Distrib. Comput. 61 (3) (2001) 350-371.
6. J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, in: W. Chen, J.F. Naughton, P.A. Bernstein (Eds.), Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (SIGMOD'00), Dallas, TX, 2000, pp. 1-12.
7. L. Dehaspe, L.D. Raedt, Mining association rules in multiple relations, in: S. Dẑeroski, N. Lavraĉ (Eds.), Proceedings of the Seventh International Workshop on Inductive Logic Programming (ILP'97), Prague, Czech Republic, Lecture Notes in Computer Science, Vol. 1297, Springer, Berlin, 1997, pp. 125-132.
8. V. Crestana-Jensen, N. Soparkar, Frequent itemset counting across multiple tables, in: T. Terano, H. Liu, A.L.P. Chen (Eds.), Proceedings of the Fourth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'00), Kyoto, Japan, Lecture Notes in Artificial Intelligence, Vol. 1805, Springer, Berlin, 2000, pp. 49-61.
9. B. Liu, W. Hsu, Y. Ma, Integrating classification and association rule mining, in: R. Agrawal, P.E., Stolorz, G. Piatetsky-Shapiro (Eds.), Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD'98), New York City, NY, USA, 1998, pp. 80-86.
10. J. Dougherty, R. Kohavi, M. Sahami, Supervised and unsupervised discretization of continuous features, in: A. Prieditis, S.J. Russell (Eds.), Proceedings of the 12th International Conference on Machine Learning (ICML'95), Tahoe City, CA, USA, 1995, pp. 194-202.
11. U.M. Fayyad, K.B. Irani, Multi-interval discretization of continuous-valued attributes for classification learning, in: R. Bajcsy (Ed.), Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI'93), Chambéry, France, 1993, pp. 1022-1029.
12. N. Pasquier, Y. Bastide, R. Taouil L. Lakhal, Efficient mining of association rules using closed itemset lattices, Inform. Systems 24 (1) (199) 25-46.
13. J.-F. Boulicaut, A. Bykowski, C. Rigotti, Approximation of frequency queries by mean of free-sets, in: D.A. Zighed, H.J. Komorowski, J.M. Zytkow (Eds.), Proceedings of the Fourth European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'00), Lyon, France, 2000, pp. 75-85.
14. J.-F. Boulicaut, A. Bykowski, C. Rigotti, Free-sets: a condensed representation of boolean data for the approximation of frequency queries, Data Mining Knowledge Discovery 7 (1) (2003) 5-22.
15. H. Mannila, H. Toivonen, Multiple uses of frequent sets and condensed representations, in: E. Simoudis, J. Han, U.M. Fayyad (Eds.), Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD'96), Portland, USA, 1996, pp. 189-194.
16. Y. Bastide, N. Pasquier, R. Taouil, L. Lakhal, G. Stumme, Mining minimal non-redundant association rules using frequent closed itemsets, in: J.W. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau, C. Palamidessi, L.M. Pereira, Y. Sagiv, P.J. Stuckey (Eds.), Proceedings of the Sixth International Conference on Rules and Objects in Databases (DOOD'00), London, UK, Lecture Notes in Computer Science, Vol. 1861, Springer, Berlin, 2000, pp. 972-986.
17. A. Bykowski, C. Rigotti, A condensed representation to find frequent patterns, in: P. Buneman (Ed.), Proceedings of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'01), Santa Barbara, CA, USA, 2001, pp. 267-273.
18. H. Mannila, H. Toivonen, Levelwise search and borders of theories in knowledge discovery, Data Mining Knowledge Discovery 1 (3) (1997) 241-258.
19. R.J. Bayardo, Efficiently mining long patterns from databases, in. L.M. Haas, A. Tiwary (Eds.), Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (SIGMOD'98), Seattle, WA, USA, 1998, pp. 85-93.
20. A. Bykowski, Condensed representations of frequent sets: application to descriptive pattern discovery, Ph.D. Thesis, INSA-Lyon, 20, Avenue A. Einstein, F-69621 Villeurbanne Cedex, France (October 2002).
21. J. Pei, J. Han, R. Mao, CLOSET: An efficient algorithm for mining frequent closed itemsets, in: D. Gunopulos, R. Rastogi (Eds.), Proceedings of the 2000 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD'00), Dallas, TX, 2000, pp. 21-30.
22. R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases, in: P. Buneman, S. Jajodia (Eds.), Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (SIGMOD'93), Washington, DC, USA, 1993, pp. 207-216.
23. R. Srikant, Q. Vu, R. Agrawal, Mining association rules with item constraints, in: D. Heckerman, H. Mannila, D. Pregibon, R. Uthurusamy (Eds.), Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, (KDD'97), Newport Beach, CA, USA, 1997, pp. 67-73.
24. B. Jeudy, J.-F. Boulicaut, Optimization of association rule mining queries, Intelligent Data Anal. 6 (4) (2002) 341-357.