Concise representation of frequent patterns based on disjunction-free generators

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2001, Pages 305-312

  Kryszkiewicz, Marzena ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038122164     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, A. I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI Press, Menlo Park, California, 1996.
2. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, L. Lakhal. Mining frequent patterns with counting inference. ACM SIGKDD Explorations, Vol. 2(2):66-75, December 2000.
3. J-F. Boulicaut. A. Bykowski, C. Rigotti. Approximation of frequency queries by means of free-sets. In Proc. of PKDD '00, pages 75-85, Springer. September 2000.
4. J-F. Boulicaut, A. Bykowski, C. Rigotti. Free-Sets: a condensed representation of Boolean data for the approximation of frequency queries. Research Report, LISI, INSA-Lyon, June 2001.
5. A. Bykowski, C. Rigotti. A condensed representation to find frequent patterns. In Proc. of the 12th ACM SIGACT-SIGMOD-SIGART PODS' 01, May 2001.
6. J. Han, M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 2000.
7. M. Kryszkiewicz. Closed set based discovery of representative association rules. In Proc. of IDA '01, Springer, September 2001.
8. N. Pasquier. Data mining: Algorithmes d'extraction et de réduction des règles d'association dans les bases de données. Thèse de Doctorat, Université Blaise Pascal - Clermont-Ferrand II, January 2000.
9. J. Pei, J. Han, R. Mao. CLOSET: An efficient algorithm for mining frequent closed itemsets. In Proc. of the ACM-SIGMOD DMKD '00, pages 21-30, Dallas, May 2000.
10. J. Saquer, J. S. Deogun. Using closed itemsets for discovering representative association rules. In Proc. of ISMIS '00, pages 495-504, Springer, October 2000.
11. M. J. Zaki. Generating non-redundant association rules. In Proc. of the 6th ACM SIGKDD Intl Conf. on Knowledge Discovery and Data Mining, pages 34-43, August 2000.