Efficient breadth-first mining of frequent pattern with monotone constraints

Knowledge and Information Systems

Volumn 8, Issue 2, 2005, Pages 131-153

  Bonchi, Francesco ^a   Giannotti, Fosca ^a   Mazzanti, Alessio ^b   Pedreschi, Dino ^c  

^a ISTI CNR   (Italy)

^b List SpA   (Italy)

^c UNIVERSITY OF PISA   (Italy)

Author keywords

Constraints; Datareduction; Frequent itemsets mining

Indexed keywords

DATA REDUCTION; INFORMATION SYSTEMS;

ANTI-MONOTONE CONSTRAINTS; APRIORI ALGORITHMS; BREADTH-FIRST ALGORITHMS; COMPUTATIONAL PROBLEM; CONSTRAINTS; FREQUENT ITEMSETS MININGS; FREQUENT PATTERN MINING; PRE-PROCESSING ALGORITHMS;

DATA MINING;

EID: 21844433972     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-004-0164-7     Document Type: Article

References (19)

1. Agrawal R, Srikant R (1994) (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the twentieth international conference on very large databases. Santiago de Chile, Chile, September 1994, pp 487-499
2. Agrawal R, Imielinski T, Swami A (1993) Mining associations between sets of items in massive databases. In: Proceedings of the ACM SIGMOD international conference on management of data. Washington DC, May 1993, pp 207-216
3. Bonchi F, Giannotti F, Mazzanti A, Pedreschi D (2003) Adaptive constraint pushing in frequent pattern mining. In: Proceedings of the 7th European conference on principles and practice of knowledge discovery in databases. Cavtat-Dubrovnik, Croatia, September 2003. (Lecture notes in computer science), vol 2838. Springer, Berlin Heidelberg New York, pp 47-58
4. Bonchi F, Giannotti F, Mazzanti A, Pedreschi D (2003) ExAnte: anticipated data reduction in constrained pattern mining. In: Proceedings of the 7th European conference on principles and practice of knowledge discovery in databases. Cavtat-Dubrovnik, Croatia, September 2003. (Lecture notes in computer science), vol 2838. Springer, Berlin Heidelberg New York, pp 59-70
5. Boulicaut JF, Jeudy B (2002) Optimization of association rule mining queries. Intell Data Anal J 6:341-357
6. Bucila C, Gehrke J, Kifer D, White W (2002) DualMiner: A dual-pruning algorithm for itemsets with constraints. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining. July 2002, Edmonton, Alberta, Canada, pp 42-51
7. De Raedt L, Kramer S (2001) The levelwise version space algorithm and its application to molecular fragment finding. In: Proceedings of the seventeenth international joint conference on artificial intelligence, Seattle, Washington, August 2001, pp 853-862
8. Grahne G, Lakshmanan L, Wang X (2000) Efficient mining of constrained correlated sets. In: Proceedings of the 16th IEEE international conference on data engineering, March 2000, San Diego, California, pp 512-524
9. Han J, Lakshmanan L, Ng R (1999) Constraint-based, multidimensional data mining. Computer 32:46-50
10. Inokuchi A, Washio T, Motoda H (2000) An Apriori-based algorithm for mining frequent substructures from graph data. In: Proceedings of the 4th European conference on principles and practice of knowledge discovery in databases. Lyon, France, September 2000 (Lecture notes in computer science), vol 1910. Springer, Berlin Heidelberg New York, pp 13-23
11. Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: Proceedings of the 2001 IEEE international conference on data mining. December 2001, San Jose, California, pp 313-320
12. Lakshmanan L, Ng R, Han J, Pang A (1999) Optimization of constrained frequent set queries with 2-variable constraints. In: Proceedings ACM SIGMOD international conference on management of data. June 1999, Philadelphia, Pennsylvania, pp 157-168
13. Ng R, Lakshmanan L, Han J, Pang A (1998) exploratory mining and pruning optimizations of constrained associations rules. In: Proceedings ACM SIGMOD international conference on management of data. June 1998, Seattle, Washington, pp 13-24
14. Orlando S, Palmerini P, Perego R, Silvestri F (2002) Adaptive and resource-aware mining of frequent sets. In: Proceedings of the 2002 IEEE international conference on data mining. December 2002, Maebashi City, Japan, pp 338-345
15. Park JS, Chen MS, Yu PS (1995) An effective hash based algorithm for mining association rules. In: Proceedings ACM SIGMOD international conference on management of data. May 1995, San Jose, California, pp 175-186
16. Pei J, Han J (2000) Can we push more constraints into frequent pattern mining? In: Proceedings ACM SIGKDD international conference on knowledge discovery and data mining. August 2000, Boston, MA, pp 350-354
17. Pei J, Han J, Lakshmanan L (2001) Mining frequent item sets with convertible constraints. In: Proceedings of the 17th IEEE international conference on data engineering. April 2001, Heidelberg, Germany, pp 433-442
18. Srikant R, Vu Q, Agrawal R (1997) Mining association rules with item constraints. In: Proceedings ACM SIGKDD international conference on knowledge discovery and data mining. August 1997, Newport Beach, California, pp 67-73
19. Zheng Z, Kohavi R, Mason L (2001) Real world performance of association rule algorithms. In: Proceedings ACM SIGKDD international conference on knowledge discovery and data mining. August 2001, San Francisco, California, pp 401-406