Database Reference
In-Depth Information
11. 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.
12. Minos N. Garofalakis, Rajeev Rastogi, and Kyuseok Shim. Spirit: Sequential pattern mining
with regular expression constraints. In VLDB'99, Proceedings of 25th International Conference
on Very Large Data Bases, September 7-10, 1999, Edinburgh, Scotland, UK , pages 223-234.
Morgan Kaufmann, 1999.
13. Tias Guns, Anton Dries, Guido Tack, Siegfried Nijssen, and Luc De Raedt. Miningzinc: A
modeling language for constraint-based mining. In IJCAI , 2013.
14. Tias Guns, Siegfried Nijssen, and Luc De Raedt. Itemset mining: A constraint programming
perspective. Artif. Intell ., 175(12-13):1951-1983, 2011.
15. Jiawei Han, Yongjian Fu, Krzystzof Koperski, Wei Wang, and Osmar Zaiane. Dmql: A data
mining query language for relational databases. In SIGMOD'96 Workshop. on Research Issues
on Data Mining and Knowledge Discovery (DMKD'96) , 1996.
16. T. Imielinski and H. Mannila. A database perspectivce on knowledge discovery. Communica-
tions of the ACM , 39(11):58-64, 1996.
17. Daniel Kifer, Johannes Gehrke, Cristian Bucila, and Walker M. White. How to quickly find a
witness. In PODS , pages 272-283. ACM, 2003.
18. Stefan Kramer, Luc De Raedt, and Christoph Helma. Molecular feature mining in hiv data. In
KDD-2001: The Seventh ACM SIGKDD International Conference on Knowledge Discovery
and Data Mining , 2001.
19. Sau Dan Lee and Luc De Raedt. An algebra for inductive query evaluation. In ICDM , pages
147-154, 2003.
20. Heikki Mannila and Hannu Toivonen. Levelwise search and borders of theories in knowledge
discovery. Data Mining and Knowledge Discovery , 1(3):241-258, 1997.
21. Rosa Meo, Giuseppe Psaila, and Stefano Ceri. A new sql-like operator for mining association
rules. In VLDB , pages 122-133, 1996.
22. Jean-Philippe Métivier, Patrice Boizumault, Bruno Crémilleux, Mehdi Khiari, and Samir
Loudni. A constraint-based language for declarative pattern discovery. In ICDM Workshops ,
pages 1112-1119, 2011.
23. Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han, and Alex Pang. Exploratory mining and
pruning optimizations of constrained associations rules. In Proceedings of the ACM-SIGMOD
Conference on Management of Data , pages 13-24, 1998.
24. Siegfried Nijssen and Tias Guns. Integrating constraint programming and itemset mining. In
ECML/PKDD (2) , pages 467-482, 2010.
25. Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Discovering frequent closed
itemsets for association rules. In Catriel Beeri and Peter Buneman, editors, ICDT , volume 1540
of Lecture Notes in Computer Science , pages 398-416. Springer, 1999.
26. Jian Pei and Jiawei Han. Can we push more constraints into frequent pattern mining? In KDD ,
pages 350-354, 2000.
27. Jian Pei and Jiawei Han. Constrained frequent pattern mining: a pattern-growth view. SIGKDD
Explorations , 4(1):31-39, 2002.
28. 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.
29. Arnaud Soulet and Bruno Crémilleux. Mining constraint-based patterns using automatic
relaxation. Intell. Data Anal. , 13(1):109-133, 2009.
30. Takeaki Uno, Tatsuya Asai, Yuzo Uchida, and Hiroki Arimura. An efficient algorithm for
enumerating closed patterns in transaction databases. In Discovery Science , pages 16-31,
2004.
Search WWH ::




Custom Search