ExAnte: Anticipated data reduction in constrained pattern mining

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

Volumn 2838, Issue , 2003, Pages 59-70

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

^a Pisa KDD Laboratory   (Italy)

^b ISTI CNR   (Italy)

^c UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SCIENCE; CONSTRAINT THEORY; DATA PROCESSING; DATA REDUCTION; DATABASE SYSTEMS; SEMANTICS; SUPERVISORY AND EXECUTIVE PROGRAMS; DATA HANDLING;

ANTI-MONOTONE CONSTRAINTS; CONSTRAINT PUSHING TECHNIQUES; DATASETS; PATTERN MINING; DATA-REDUCTION ALGORITHMS; FREQUENT PATTERN MINING; IMPROVING EFFICIENCY; ORDERS OF MAGNITUDE; PATTERN MINING ALGORITHMS; PRE-PROCESSING;

DATA MINING;

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

References (12)

1. R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In P. Buneman and S. Jajodia, editors, Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 207-216, Washington, D.C., 26-28 May 1993.
2. R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules in Large Databases. In Proceedings of the Twentieth International Conference on Very Large Databases, pages 487-499, Santiago, Chile, 1994.
3. J.-F. Boulicaut and B. Jeudy. Using constraints during set mining: Should we prune or not? In Actes des Seizième Journúes Bases de Donnúes Avancúes BDA '00, Blois (F), pages 221-237, 2000.
4. C. Bucila, J. Gehrke, D. Kifer, and W. White. Dualminer: A dual-pruning algorithm for itemsets with constraints. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2002.
5. F.Bonchi, F.Giannotti, A.Mazzanti, and D.Pedreschi. Exante: a preprocessing algorithm for constrained frequent pattern mining. Technical Report ISTI-B4-2003-07, ISTI, 2003.
6. G. Grahne, L. Lakshmanan, and X. Wang. Efficient mining of constrained correlated sets. In 16th International Conference on Data Engineering (ICDE' 00), pages 512-524. IEEE, 2000.
7. J. Han, L. V. S. Lakshmanan, and R. T. Ng. Constraint-based, multidimensional data mining. Computer, 32(8):46-50, 1999.
8. L. V. S. Lakshmanan, R. T. Ng, J. Han, and A. Pang. Optimization of constrained frequent set queries with 2-variable constraints. SIGMOD Record (ACM Special Interest Group on Management of Data), 28(2), 1999.
9. R. T. Ng, L. V. S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD-98), volume 27,2 of ACM SIGMOD Record, pages 13-24, New York, June 1-4 1998. ACM Press.
10. J. Pei and J. Han. Can we push more constraints into frequent pattern mining? In R. Ramakrishnan, S. Stolfo, R. Bayardo, and I. Parsa, editors, Proceedinmgs of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'00), pages 350-354, N. Y., Aug. 20-23 2000. ACM Press.
11. J. Pei, J. Han, and L. V. S. Lakshmanan. Mining frequent item sets with convertible constraints. In (ICDE'01), pages 433-442, 2001.
12. R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In D. Heckerman, H. Mannila, D. Pregibon, and R. Uthurusamy, editors, Proc. 3rd Int. Conf. Knowledge Discovery and Data Mining, KDD, pages 67-73. AAAI Press, 14-17 Aug. 1997.