Minimal k-free representations of frequent sets

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2838, Issue , 2003, Pages 71-82

  Calders, Toon ^a   Goethals, Bart ^b  

^a UNIVERSITY OF ANTWERP   (Belgium)

^b HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ASSOCIATIVE PROCESSING; COMPUTER SCIENCE; DATABASE SYSTEMS; INFORMATION TECHNOLOGY; ARTIFICIAL INTELLIGENCE; COMPUTERS;

DATASETS; DISJUNCTION-FREE SETS; K-FREE REPRESENTATIONS; SUBSETS; CONCISE REPRESENTATIONS; FREQUENT SETS; LOSSLESS; TRANSACTIONAL DATABASE;

SET THEORY; DATABASE SYSTEMS;

EID: 9444245915     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39804-2_9     Document Type: Conference Paper

References (17)

1. R. Agrawal, T. Imilienski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD, pages 207-216, Washington, D.C., 1993.
2. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal. Mining frequent patterns with counting inference. SIGKDD Explorations, 2(2):66-75, 2000.
3. C.L. Blake and C.J. Merz. UCI Repository of machine learning databases. University of California, Irvine, Dept. of Information and Computer Sciences, http://www.ics.uci.edu/mlearn/MLRepository.html, 1998.
4. J.-F. Boulicaut and A. Bykowski. Frequent closures as a concise representation for binary data mining. In Proc. PaKDD, pages 62-73, 2000.
5. J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Approximation of frequency queries by means of free-sets. In Proc. PKDD, pages 75-85, 2000.
6. A. Bykowski and C. Rigotti. A condensed representation to find frequent patterns. In Proc. PODS, 2001.
7. T. Calders. Axiomatization and Deduction Rules for the Frequency of Itemsets, PhD thesis, University of Antwerp, Belgium, http://win-www.ruca.ua.ac. be/u/calders/download/thesis.pdf, May 2003.
8. T. Calders and B. Goethals. Mining all non-derivable frequent itemsets. In Proc. PKDD, pages 74-85. Springer, 2002.
9. J. Galambos and I. Simonelli. Bonferroni-type Inequalities with Applications, Springer, 1996.
10. M. Kryszkiewicz. Concise representation of frequent patterns based on disjunction-free generators. In Proc. ICDM, pages 305-312, 2001.
11. M. Kryszkiewicz and M. Gajek. Concise representation of frequent patterns based on generalized disjunction-free generators. In Proc. PaKDD, pages 159-171, 2002.
12. M. Kryszkiewicz and M. Gajek. Why to apply generalized disjunction-free generators representation of frequent patterns? In Proc. ISMIS, pages 382-392, 2002.
13. H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations. In Proc. KDD, 1996.
14. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In Proc. ICDT, pages 398-416, 1999.
15. J. Pei, J. Han, and R. Mao. Closet: An efficient algorithm for mining frequent closed itemsets. In ACM SIGMOD Workshop DMKD, Dallas, TX, 2000.
16. M.J. Zaki and C. Hsiao. ChARM: An efficient algorithm for closed association rule mining. In TR 99-10, Computer Science, Rensselaer Polytechnic Institute, 1999.
17. Z. Zheng, R. Kohavi, and L. Mason. Real world performance of association rule algorithms. In Proc. KDD, pages 401-406, 2001.