Frequent closures as a concise representation for binary data mining

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

Volumn 1805, Issue , 2000, Pages 62-73

  Boulicau, Jean François ^a   Bykowski, Artur ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINS;

APRIORI-BASED ALGORITHMS; BINARY DATA; BOUNDED ERRORS; CONCISE REPRESENTATIONS; DESCRIPTIVE RULES; EXPERIMENTAL EVIDENCE; FREQUENT SETS; HIGHLY-CORRELATED;

DATA MINING;

EID: 84942749652     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (13)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In: Proc SIGMOD'93, Washington DC (USA), pages 207-216, May 1993, ACM Press.
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, pages 307 - 328, 1996, AAAI Press.
3. R.J. Bayardo. Efficiently mining of long patterns from databases. In: Proc SIGMOD' 98, Seattle (USA), pages 85 - 93, June 1998, ACM Press.
4. J-F. Boulicaut, M. Klemettinen, and H. Mannila. Modeling KDD processes within the Inductive Database Framework. In: Proc DaWak'99, Florence (I), pages 293 -302, September 1999, Springer-Verlag, LNCS 1676.
5. J-F. Boulicaut, A. Bykowski, and C. Rigotti. Mining almost-closures in highly correlated data. Research Report LISI INSA Lyon, 2000, 20 pages.
6. A. Bykowski. Frequent set discovery in highly correlated data. Master of Science thesis, INSA Lyon, July 1999, 30 pages.
7. H. Toivonen. Sampling large databases for association rules. In: Proc VLDB'96, Mumbay (India), pages 134 - 145, September 1996, Morgan Kaufmann.
8. H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations. In; Proc KDD'96, Portland (USA), pages 189 - 194, August 1996, AAAI Press.
9. H. Mannila. Inductive databases and condensed representations for data mining. In: Proc ILPS'97, Port Jefferson, Long Island N.Y. (USA), pages 21 - 30, October 1997, MIT Press.
10. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, Volume 24 (1), pages 25 - 46, 1999.
11. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Closed set discovery of small covers for association rules. In: Proc BDA'99, Bordeaux (F), pages 53 - 68, October 1999.
12. M. Zaki and M. Ogihara. Theoretical foundations of association rules. In: Proc Workshop post-SIGMOD DMKD'98, Seattle (USA), pages 85 - 93, June 1998.
13. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241 - 258, 1997.