An Efficient and Scalable Algorithm for Multi-Relational Frequent Pattern Discovery
暂无分享,去创建一个
[1] Joost N. Kok,et al. Faster Association Rules for Multiple Relations , 2001, IJCAI.
[2] Jörg-Uwe Kietz,et al. An Efficient Subsumption Algorithm for Inductive Logic Programming , 1994, ICML.
[3] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[4] Hannu Toivonen,et al. Discovery of frequent DATALOG patterns , 1999, Data Mining and Knowledge Discovery.
[5] Heikki Mannila,et al. Levelwise Search and Borders of Theories in Knowledge Discovery , 1997, Data Mining and Knowledge Discovery.
[6] Bart Demoen,et al. Executing Query Packs in ILP , 2000, ILP.
[7] Hendrik Blockeel,et al. Top-Down Induction of First Order Logical Decision Trees , 1998, AI Commun..
[8] Stefan Wrobel,et al. An Algorithm for Multi-relational Discovery of Subgroups , 1997, PKDD.
[9] Stephen Muggleton. Inverting Entailment and Progol , 1993, Machine Intelligence 14.
[10] Stefan Wrobel,et al. Inductive Logic Programming for Knowledge Discovery in Databases , 2001 .
[11] M J Sternberg,et al. Structure-activity relationships derived by machine learning: the use of atoms and their bond connectivities to predict mutagenicity by inductive logic programming. , 1996, Proceedings of the National Academy of Sciences of the United States of America.
[12] Luc De Raedt,et al. Relational Knowledge Discovery in Databases , 1996, Inductive Logic Programming Workshop.
[13] Ulrich Güntzer,et al. Algorithms for association rule mining — a general survey and comparison , 2000, SKDD.