Constraint-Based pattern set mining

Proceedings of the 7th SIAM International Conference on Data Mining

Volumn , Issue , 2007, Pages 237-248

  De Raedt, Luc ^a   Zimmermann, Albrecht ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ANTI-MONOTONICITY; CLASSIFICATION RULE SELECTION; CONSTRAINT-BASED; CONSTRAINT-BASED MINING; GLOBAL MODELS; GLOBAL PATTERNS; LOCAL PATTERNS; PATTERN SET; SET MINING; TOP-K QUERY;

ALGORITHMS; DATA MINING; MINING;

SET THEORY;

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

References (15)

1. Francesco Bonchi, Fosca Giannotti, Alessio Mazzanti, and Dino Pedreschi. Examiner: Optimized level-wise frequent pattern mining with monotone constraint. In ICDM,pages 11-18. IEEE Computer Society, 2003.
2. Toon Calders, Christophe Rigotti, and Jean-Franfois Bouli-caut. A survey on condensed representations for frequent sets. In Jean-Franfois Boulicaut, Luc De Raedt, and Heikki Mannila, editors, Constraint-Based Mining and Inductive Databases.Springer, 2005.
3. L. De Raedt. A perspective on inductive databases. SIGKDD Explorations,4(2), 2002.
4. Jiawei Han, Jian Pei, Yiwen Yin, and Runying Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov.,8(l):53-87, 2004.
5. Christian Hidber. Online association rule mining. In Alex Delis, Christos Faloutsos, and Shahram Ghandeharizadeh, editors, SIGMOD Conference,pages 145-156. ACM Press, 1999.
6. Tomasz Imielinski and Heikki Mannila. A database perspective on knowledge discovery. Commun. ACM,39(11):58-64, 1996.
7. Stefan Kramer, Luc De Raedt, and Christoph Helma. Molecular feature mining in hiv data. In KDD-2001,2001.
8. Laks V. S. Lakshmanan, Carson Kai-Sang Leung, and Raymond T. Ng. Efficient dynamic mining of constrained frequent sets. ACM Trans. Database Syst.,28(4):337-389,2003.
9. Bing Liu, Wynne Hsu, and Yiming Ma. Integrating classification and association rule mining. In Rakesh Agrawal, Paul E. Stolorz, and Gregory Piatetsky-Shapiro, editors, KDD 1998,pages 80-86, New York City, New York, USA, August 1998. AAAI Press.
10. Heikki Mannila and Hannu Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery,l(3):241-258, 1997.
11. S. Morishita and J. Sese. Traversing itemset lattice with statistical metric pruning. In PODS,2000.
12. Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han, and Alex Pang. Exploratory mining and pruning optimizationsof constrained associations rules. In SIGMOD Conference,pages 13-24,1998.
13. Jian Pei, Jiawei Han, and Laks V. S. Lakshmanan. Pushing convertible constraints in frequent itemset mining. Data Min. Knowl. Discov.,8(3): 227-252,2004.
14. Luc De Raedt, Manfred Jaeger, Sau Dan Lee, and Heikki Mannila. A theory of inductive query answering. In ICDM,pages 123-130. IEEE Computer Society, 2002.
15. Yoshikazu Shima, Kouichi Hirata, and Masateru Harao. Extraction of frequent few-overlapped monotone dnf formulas with depth-first pruning. In Tu Bao Ho, David Cheung, and Huan Liu, editors, PAKDD,pages 50-60. Springer, 2005.