A survey on condensed representations for frequent sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3848 LNAI, Issue , 2006, Pages 64-80

  Calders, Toon ^a   Rigotti, Christophe ^b   Boulicaut, Jean François ^b  

^a UNIVERSITY OF ANTWERP   (Belgium)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; DATA MINING; PATTERN RECOGNITION; QUERY LANGUAGES;

BOOLEAN MATRICES; FEATURE CONSTRUCTION; FREQUENCY QUERIES; PATTERNS;

SET THEORY;

EID: 33745145777     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11615576_4     Document Type: Conference Paper

References (55)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. ACM Int. Conf. on Management of Data SIGMOD'93, pages 207-216, Washington, D.C., USA, May 1993. ACM Press.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proc. Int. Conf. on Very Large Data Bases VLDB'94, pages 487-499, Santiago de Chile, Chile, Sept. 1994. Morgan Kaufmann.
3. Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal. Mining minimal non-redundant association rules using frequent closed itemsets. In Proc. Int. Conf. on Deductive and Object-Oriented Databases DOOD'00, volume 1861 of LNCS, pages 972-986, London, UK, July 2000. Springer-Verlag.
4. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal. Mining frequent patterns with counting inference. SIGKDD Explorations, 2(2):66-75, Dec. 2000.
5. R. J. Bayardo. Efficiently mining long patterns from databases. In Proc. ACM Int. Conf. on Management of Data SIGMOD'98, pages 85-93, Seattle, USA, June 1998. ACM Press.
6. R. J. Bayardo, B. Goethals, and M. J. Zaki, editors. Proc. Int. Workshop on Frequent Itemset Mining Implementations FIMI'04, Brighton, UK, Nov. 2004.
7. C. Becquet, S. Blachon, B. Jeudy, J.-F. Boulicaut, and O. Gandrillon. Strong association rule mining for large gene expression data analysis: a case study on human SAGE data. Genome Biology, 12, 2002.
8. J. Besson, C. Robardet, J.-F. Boulicaut, and S. Rome. Constraint-based bi-set mining for biologically relevant pattern discovery in microarray data. Intelligent Data Analysis, 9(1):59-82, 2005.
9. F. Bonchi and C. Lucchese. On closed constrained frequent pattern mining. In Proc. IEEE Int. Conf. on Data Mining ICDM'04, pages 35-42, Brighton, UK, Nov. 2004. IEEE Computer Press.
10. J.-F. Boulicaut. Inductive databases and multiple uses of frequent itemsets: the clnQ approach. In Database Technologies for Data Mining - Discovering Knowledge with Inductive Queries, volume 2682 of LNCS, pages 1-23. Springer-Verlag, 2004.
11. J.-F. Boulicaut and A. Bykowski. Frequent closures as a concise representation for binary data mining. In Proc. Pacific-Asia Conf. on Knowledge Discovery and Data Mining PAKDD'00, volume 1805 of LNAI, pages 62-73, Kyoto, JP, Apr. 2000. Springer-Verlag.
12. J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Approximation of frequency queries by mean of free-sets. In Proc. Principles and Practice of Knowledge Discovery in Databases PKDD'00, volume 1910 of LNAI, pages 75-85, Lyon, F, Sept. 2000. Springer-Verlag.
13. J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery journal, 7(1):5-22, 2003.
14. J.-F. Boulicaut and B. Jeudy. Mining free itemsets under constraints. In Proc. Int. Database Engineering and Application Symposium IDEAS'01, pages 322-329, Grenoble, F, July 2001. IEEE Computer Press.
15. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In Proc. ACM Int. Conf. on Management of Data SIGMOD'97, pages 255-264, Tucson, USA, May 1997. ACM Press.
16. A. Bykowski, T. Daurel, N. Méger, and C. Rigotti. Integrity constraints over association rules. In Database Technologies for Data Mining - Discovering Knowledge with Inductive Queries, volume 2682 of LNCS, pages 311-330. Springer-Verlag, 2004.
17. A. Bykowski and C. Rigotti. A condensed representation to find frequent patterns. In Proc. ACM Symposium on Principles of Database Systems PODS'01, pages 267-273, Santa Barbara, CA, USA, May 2001. ACM Press.
18. A. Bykowski and C. Rigotti. DBC: A condensed representation of frequent patterns for efficient mining. Information Systems, 28(8):949-977, 2003.
19. T. Calders. Deducing bounds on the support of itemsets. In Database Technologies for Data Mining - Discovering Knowledge with Inductive Queries, volume 2682 of LNCS, pages 214-233. Springer-Verlag, 2004.
20. T. Calders and B. Goethals. Mining all non derivable frequent itemsets. In Proc. Principles and Practice of Knowledge Discovery in Databases PKDD'02, volume 2431 of LNAI, pages 74-85, Helsinki, FIN, Aug. 2002. Springer-Verlag.
21. T. Calders and B. Goethals. Minimal k-free representations of frequent sets. In Proc. Principles and Practice of Knowledge Discovery in Databases PKDD'03, volume 2838 of LNAI, pages 71-82, Cavtat-Dubrovnik, HR, Sept. 2003. Springer-Verlag.
22. T. Calders and B. Goethals. Depth-first non derivable itemset mining. In Proc. SIAM Int. Conf. on Data Mining SDM'05, Newport Beach, USA, Apr. 2005.
23. B. Crémilleux and J.-F. Boulicaut. Simplest rules characterizing classes generated by delta-free sets. In Proc. BCS Int. Conf. on Knowledge Based Systems and Applied Artificial Intelligence ES'02, pages 33-46, Cambridge, UK, Dec. 2002. Springer-Verlag.
24. L. De Raedt. A perspective on inductive databases. SIGKDD Explorations, 4(2):69-77, 2003.
25. L. De Raedt. Towards query evaluation in inductive databases using version spaces. In Database Technologies for Data Mining - Discovering Knowledge with Inductive Queries, volume 2682 of LNCS, pages 117-134. Springer-Verlag, 2004.
26. L. De Raedt, M. Jaeger, S. D. Lee, and H. Mannila. A theory of inductive query answering. In Proc. IEEE Int. Conf. on Data Mining ICDM'02, pages 123-130, Maebashi City, JP, Dec. 2002. IEEE Computer Press.
27. J. Galambos and I. Simonelli. Bonferroni-type Inequalities with Applications. Springer, 1996.
28. B. Ganter and R. Wille. Formal Concept Analysis, Mathematical Foundations. Springer-Verlag, 1999.
29. A. Giacometti, D. Laurent, and C. T. Diop. Condensed representations for sets of mining queries. In Database Technologies for Data Mining - Discovering Knowledge with Inductive Queries, volume 2682 of LNCS, pages 250-269. Springer-Verlag, 2004.
30. B. Goethals, J. Muhonen, and H. Toivonen. Mining non derivable association rules. In Proc. SIAM Int. Conf. on Data Mining SDM'05, Newport Beach, USA, Apr. 2005.
31. B. Goethals and M. J. Zaki, editors. Proc. Int. Workshop on Frequent Itemset Mining Implementations FIMI'OS, Melbourne, Florida, USA, Nov. 2003.
32. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. ACM Int. Conf. on Management of Data SIGMOD'00, pages 1 - 12, Dallas, Texas, USA, May 2000. ACM Press.
33. T. Imielinski and H. Mannila. A database perspective on knowledge discovery. Communications of the ACM, 39(11):58-64, 1996.
34. B. Jeudy and J.-F. Boulicaut. Using condensed representations for interactive association rule mining. In Proc. Principles and Practice of Knowledge Discovery in Databases PKDD'02, volume 2431 of LNAI, pages 225-236, Helsinki, FIN, Aug. 2002. Springer-Verlag.
35. D. Kifer, J. Gehrke, C. Bucila, and W. M. White. How to quickly find a witness. In Proc. ACM Symposium on Principles of Database Systems PODS'03, pages 272-283, San Diego, USA, June 2003. ACM Press.
36. M. Kryszkiewicz. Concise representation of frequent patterns based on disjunction-free generators. In Proc. IEEE Int. Conf. on Data Mining ICDM'01, pages 305-312, San Jose, USA, Nov. 2001. IEEE Computer Press.
37. M. Kryszkiewicz and M. Gajek. Concise representation of frequent patterns based on generalized disjunction-free generators. In Proc. Pacific-Asia Conf. on Knowledge Discovery and Data Mining PAKDD'02, volume 2336 of LNCS, pages 159-171, Taipei, Taiwan, 2002. Springer-Verlag.
38. B. Liu, W. Hsu, and Y. Ma. Integrating classification and association rules mining. In Proc. Int. Conf. on Knowledge Discovery and Data Mining KDD'98, pages 80-86, New York, USA, 1998. AAAI Press.
39. H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations. In Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining KDD'96, pages 189-194, Portland, USA, 1996. AAAI Press.
40. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997.
41. T. Mielikäinen. Summarization Techniques for Pattern Collections in Data Mining. PhD thesis, University of Helsinki, Department of Computer Science, Ph.D. thesis Report A-2005-1, 2005.
42. N. Novelli and R. Cicchetti. Mining functional and embedded dependencies using free sets. In Actes Bases de Données Avancées BDA'00, pages 201-220, 2000.
43. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhai. Pruning closed itemset lattices for association rules. In Actes Bases de Données Avancées BDA '98, Hammamet, Tunisie, Oct. 1998.
44. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhai. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25-46, Jan. 1999.
45. J. Pei, J. Han, and R. Mao. CLOSET an efficient algorithm for mining frequent closed itemsets. In Proc. SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery DMKD'00, Dallas, USA, May 2000.
46. G. Piatetsky-Shapiro. Discovery, analysis, and presentation of strong rules. In Knowledge Discovery in Databases, pages 229-248. AAAI Press, 1991.
47. U. Rückert and S. Kramer. Generalized version space trees. In Proc. Int. Workshop on Inductive Databases KDID'03, pages 119-129, Cavtat-Dubrovnik, HR, 2003. Rudjer Boskovic Institute, Zagreb, HR.
48. A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. Int. Conf. on Very Large Data Bases VLDB'95, pages 432 - 444, Zürich, CH, Sept. 1995. Morgan Kaufmann.
49. H. Toiyonen. Sampling large databases for association rules. In Proc. Int. Conf. on Very Large Data Bases VLDB'96, pages 134-145, Mumbay, India, Sept. 1996. Morgan Kaufmann.
50. J. Wang and J. Han. BIDE: Efficient mining of frequent closed sequences. In Proc. IEEE Int. Conf. on Data Engineering ICDE'04, pages 79-90, Boston, USA, Apr. 2004. IEEE Computer Press.
51. R. Wille. Restructuring lattice theory: An approach based on hierarchies of concepts. In I. Rival, editor, Ordered Sets, pages 445-470. Reidel, Dordrecht-Boston, 1982.
52. A. Xu and H. Lei. LCGMiner: Levelwise closed graph pattern mining from large databases. In Proc. Int. Conf. on Scientific and Statistical Database Management SSDBM'04, pages 421-422, Santorini Island, EL, June 2004. IEEE Computer Press.
53. M. J. Zaki. Generating non-redundant association rules. In Proc. ACM Int. Conf. on Knowledge Discovery and Data Mining SIGKDD'00, pages 34-43, Boston, USA, Aug. 2000. ACM Press.
54. M. J. Zaki and C.-J. Hsiao. CHARM: An efficient algorithm for closed itemset mining. In Proc. SIAM Int. Conf. on Data Mining SDM'05, Arlington, USA, Apr. 2002.
55. M. J. Zaki and M. Ogihara. Theoretical foundations of association rules. In Proc. SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery DMKD'98, pages 1-8, June 1998.