Using condensed representations for interactive association rule mining

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

Volumn 2431, Issue , 2002, Pages 225-236

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

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Association rule; Inductive databases; Knowledge cache

Indexed keywords

CLOSED ITEMSETS; CONDENSED REPRESENTATIONS; DATA MINING TASKS; HIGHLY-CORRELATED; INDUCTIVE DATABASE; INTERACTIVE PROCESS; KNOWLEDGE CACHE; MINING TECHNIQUES;

ARTIFICIAL INTELLIGENCE; ASSOCIATION RULES; ITERATIVE METHODS;

DATA MINING;

EID: 84864832820     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45681-3_19     Document Type: Article

References (20)

1. Rakesh Agrawal, Heikki Mannila, Ramakrishnan Srikant, Hannu Toivonen, and A. Inkeri Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI Press, Menlo Park, CA, 1996. 225, 230
2. Elena Baralis and Giuseppe Psaila. Incremental refinement of mining queries. In Proc. DaWaK'99, volume 1676 of LNCS, pages 173-182. Springer-Verlag, 1999. 227
3. Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, and Lotfi Lakhal. Mining frequent patterns with counting inference. SIGKDD Explorations, 2(2):66-75, December 2000. 229
4. Jean-François Boulicaut and Artur Bykowski. Frequent closures as a concise representation for binary data mining. In Proc. PAKDD'00, volume 1805 of LNAI, pages 62-73, Kyoto, JP, April 2000. Springer-Verlag. 226, 228
5. Jean-François Boulicaut, Artur Bykowski, and Christophe Rigotti. Approximation of frequency queries by means of free-sets. In Proc. PKDD'00, volume 1910 of LNAI, pages 75-85, Lyon, F, September 2000. Springer-Verlag. 226, 229
6. Jean-François Boulicaut and Baptiste Jeudy. Mining free-sets under constraints. In Proc. IDEAS'01, pages 322-329, Grenoble, F, July 2001. IEEE Computer Society. 226, 230
7. Artur Bykowski and Christophe Rigotti. A condensed representation to find frequent patterns. In Proc. PODS'01, pages 267-273, Santa Barbara, California, USA, May 2001. ACM Press. 226
8. Cheikh T. Diop, Arnaud Giacometti, Dominique Laurent, and Nicolas Spyratos. Composition of mining contexts for efficient extraction of association rules. In Proc. EDBT'02, Praha, CZ, March 2002. Springer-Verlag. To appear. 227
9. Bart Goethals and Jan van den Bussche. On implementing interactive association rule mining. In Proc. DMKD'99, Philadelphia, USA, May 1999. 227
10. Baptiste Jeudy and Jean-François Boulicaut. Optimization of association rule mining queries. Intelligent Data Analysis, IOS Press, 6(5), 2002. To appear. 226, 230
11. Heikki Mannila and Hannu Toivonen. Multiple uses of frequent sets and condensed representations. In Proc. SIGKDD'96, pages 189-194, Portland, USA, August 1996. AAAI Press. 226
12. Heikki Mannila and Hannu Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997. 228, 232
13. Rosa Meo, Giuseppe Psaila, and Stefano Ceri. An extension of SQL for mining association rules. Data Mining and Knowledge Discovery, 2(2):195-224, 1998. 235
14. Tadeusz Morzy, Marek Wojciechowski, and Maciej Zakrzewicz. Materialized data mining views. In Proc. PKDD'00, volume 1910 of LNAI, pages 65-74, Lyon, F, September 2000. Springer-Verlag. 227
15. Biswadeep Nag, Prasad M. Deshpande, and David J. DeWitt. Using a knowledge cache for interactive discovery of association rules. In Proc. SIGKDD'99, pages 244-253. ACM Press, 1999. 227, 233, 234, 235
16. Raymond Ng, Laks V. S. Lakshmanan, Jiawei Han, and Alex Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. SIGMOD' 98, pages 13-24, Seattle, Washington, USA, 1998. ACM Press. 226, 228
17. Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25-46, January 1999. 226, 228, 229, 230
18. Ramakrishnan Srikant, Quoc Vu, and Rakesh Agrawal. Mining association rules with item constraints. In Proc. SIGKDD'97, pages 67-73, Newport Beach, California, USA, 1997. AAAI Press. 226
19. Marek Wojciechowski. Interactive constraint-based sequencial pattern mining. In Proc. ADBIS'01, volume 2151 of LNCS, pages 169-181, Vilnius, Lithuania, September 2001. Springer-Verlag. 227
20. Mohammed Javeed Zaki. Generating non-redundant association rules. In Proc. SIGKDD'00, pages 34-43, Boston, USA, August 2000. AAAI Press. 226, 231