Mining frequent δ-free patterns in large databases

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

Volumn 3735 LNAI, Issue , 2005, Pages 124-136

  Hébert, Céline ^a   Crémilleux, Bruno ^a  

^a Centre National de la Recherche Scientifique   (France)

Author keywords

Condensed representations; Extensions; Large databases; Rules; free patterns

Indexed keywords

ALGORITHMS; BENCHMARKING; CONSTRAINT THEORY; DATABASE SYSTEMS; KNOWLEDGE BASED SYSTEMS;

CONDENSED REPRESENTATIONS; EXTENSIONS; LARGE DATABASES; RULES; Δ-FREE PATTERNS;

DATA MINING;

EID: 33745291038     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11563983_12     Document Type: Conference Paper

References (19)

1. R. Agrawal, H. Mannila, R. Srikant, and H. Toivonen. Fast discovery of associations rules. In Advances in Knowledge Discovery and Data Mining, 1996.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In J. B. Bocca, M. Jarke, and C. Zaniolo, editors, Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pages 487-499. Morgan Kaufmann, 12-15 1994.
3. R. J. Bayardo. The hows, whys, and whens of constraints in itemset and rule discovery. In proceedings of the workshop on Inductive Databases and Constraint Based Mining, 2005.
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, pages 62-73, Kyoto, Japan, 2000. Springer-Verlag.
5. J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Approximation of frequency queries by means of free-sets. In The Fourth European Conference on Principles and Practice of Knowledge Discovery in Databases, Lyon, 2000.
6. 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.
7. B. Crémilleux and J.-F. Boulicaut. Simplest rules characterizing classes generated by delta-free sets. In 22nd Int. Conf. on Knowledge Based Systems and Applied Artificial Intelligence (ES'02), pages 33-46, Cambridge, UK, December 2002.
8. T. Eiter and G. Gottlob. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing archive, 24(6):1278-1304, 1995.
9. R. E. Jamison and J. L. Pfaltz. Closure spaces that are not uniquely generated. In Ordinal and Symbolic Data Analysis, Brussels, 2000.
10. B. Jeudy and F. Rioult. Database transposition for constrained closed pattern mining. In Third International Workshop on Knowledge Discovery in Inductive Databases, 2004.
11. 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), pages 189-194, Portland, Oregon, 1996.
12. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997.
13. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. Lecture Notes in Computer Science, 1999.
14. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Data Mining and Knowledge Discovery journal, 24(1):25-46, 1999.
15. J. Pei, J. Han, and R. Mao. CLOSET: An efficient algorithm for mining frequent closed itemsets. In ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pages 21-30, 2000.
16. J. L. Pfaltz and C. Taylor. Closed set mining of biological data. In Workshop on Data Mining and Bioinformatics, 2002.
17. F. Rioult, J.-F. Boulicaut, B. Crémilleux, and J. Besson. Using transposition for pattern discovery from microarray data. In M. J. Zaki and C. C. Aggarwal, editors, proceedings of the 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD'03), pages 73-79, San Diego, CA, 2003
18. M. J. Zaki. Generating non-redundant association rules. In proceedings of the 6th International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD'00), pages 34-43, Boston, MA, 2000.
19. M. J. Zaki and C. J. Hsiao. CHARM: an efficient algorithm for closed itemset mining. In proceedings of the 2th SIAM international conference on Data Mining, pages 33-43, Arlington, 2002.