Minimal k-Free Representations of Frequent Sets-Reference-Cited by-同舟云学术

Minimal k-Free Representations of Frequent Sets

Published:2003 Issue: Volume: Page:71-82
ISSN:0302-9743
Container-title:Knowledge Discovery in Databases: PKDD 2003
language:
Short-container-title:

Author:

Calders Toon,Goethals Bart

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-39804-2_9

Reference17 articles.

1. Agrawal, R., Imilienski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. ACM SIGMOD, Washington, D.C, pp. 207–216 (1993)

2. Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining frequent patterns with counting inference. SIGKDD Explorations 2(2), 66–75 (2000)

3. Blake, C.L., Merz, C.J.: UCI Repository of machine learning databases. University of California, Irvine, Dept. of Information and Computer Sciences (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html

4. Lecture Notes in Computer Science;J.-F. Boulicaut,2000

5. Lecture Notes in Artificial Intelligence;J.-F. Boulicaut,2000

Cited by 30 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Apriori Property and Breadth-First Search Algorithms;Encyclopedia of Database Systems;2018

2. Apriori Property and Breadth-First Search Algorithms;Encyclopedia of Database Systems;2017

3. Exact and Approximate Minimal Pattern Mining;Advances in Knowledge Discovery and Management;2016-11-04

4. Sampling frequent and minimal boolean patterns: theory and application in classification;Data Mining and Knowledge Discovery;2015-03-12

5. Mining Frequent Boolean Expressions;International Journal of Knowledge Discovery in Bioinformatics;2010-07