Homepage for Mining Structured Data

Home
Structures
Graphs
Molecules
Trees
Relational Databases
Events
Relational Databases

Claudien Publication Years: 1993-2001
Purpose: enumerate all frequent clauses given a user defined DLAB bias and a relational database.
  1. Luc De Raedt, Maurice Bruynooghe. A Theory of Clausal Discovery. In: Proceedings of the International Joint Conference on Artificial Intelligence 1993, pages 1058-1063, 1993.
  2. Luc De Raedt, Luc Dehaspe, Clausal discovery. In: Machine Learning, 26, pages 99-146, 1997.
  3. Luc De Raedt, Hendrik Blockeel, Luc Dehaspe, Wim Van Laer. Three companions for first order data mining. In: Relational Data Mining, 2001.
Farmer Publication Years: 2001-2003
Purpose: efficiently enumerate all frequent queries given a user defined mode bias and a relational database.
  1. WEBPAGE
  2. Siegfried Nijssen, Joost N. Kok. Faster Associaton Rules for Multiple Relations. In: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI2001), 2001.
  3. Siegfried Nijssen, Joost N. Kok. Efficient Frequent Query Discovery in Farmer. In: Principles of Knowledge Discovery and Data Mining 2003 (PKDD2003), 2003.
FlexiMine Publication Years: 2000-2003
Purpose: enumerate all frequent queries given a metaquery and a relational database.
  1. WEBPAGE
  2. Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Giovambattista Ianni, Luigi Palopoli. Computational Properties of Metaquerying Problems. In: PODS 2000, pages 237-244, 2000.
  3. Rachel Ben-Eliyahu-Zohary, Ehud Gudes, Giovambattista Ianni. Metaqueries: Semantics, Complexity, and Efficient Algorithms. In: Artificial Intelligence 140, pages 61-87, 2003.
  4. Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Giovambattista Ianni, Luigi Palopoli. Computational properties of metaquerying problems. In: TOCL 4(2), pages 149-180, 2003.
  5. Rachel Ben-Eliyahu-Zohary, C. Domshlak, E. Gudes, N. Liusternik, A. Meisels, T. Rosen, S.E. Shimony. FlexiMine - A Flexible Platform for KDD Research and Application Development. In: Annals of Mathematics and Artificial Intelligence 39, pages 175-204, 2003.
FreeClauses Publication Year: 2004
Miner Purpose: enumerate all delta-free frequent queries given a relational database and background predicates.
  1. HOMEPAGE
  2. Jan Ramon, Luc De Raedt. Condensed Representations for Inductive Logic Programming. In: Proceedings of Ninth International Conference on the Principles of Knowledge Representation and Reasoning, 2004.
MAS Publication Year: 2002
Purpose: enumerate all frequent multi-relational itemsets in OLAP star shaped databases.
  1. Eric Ka Ka Ng, Ada Wai-Chee Fung, Ke Wang. Mining Association Rules from Stars. In: Proceedings of the ICDM2002, 2002.
MRI-Cube Publication Year: 2004
Purpose: enumerate all frequent multi-relational itemsets in OLAP star shaped databases.
  1. Damit Yimam Seid, Sharad Mehrotra. Efficient Relationship Pattern Mining using Multi-relational Iceberg-cubes. In: Proceedings of the ICDM 2004, 2004.
PolyFARM Publication Year: 2003
Purpose: enumerate all frequent queries given a user defined mode bias and a relational database; provide a parallel, lazy implementation of Warmr.
  1. WEBPAGE
  2. Amanda Clare, Ross D. King. Data mining the yeast genome in a lazy functional language. In: Practical Aspects of Declarative Languages (PADL2003), 2003.
Radar Publication Year: 2004
Purpose: enumerate all frequent queries using a user defined mode bias.
  1. Amanda Clare, Hugh E. Williams, Nicholas Lester. Scalable Multi-Relational Association Mining. In: Proceedings of the ICDM 2004, 2004.
SeqLog Publication Years: 2002-2003
Purpose: enumerate all frequent sequantial queries given a user defined bias and a sequential relational database.
  1. Sau Dan Lee, Luc De Raedt. Constraint Based Mining of First Order Sequences in SeqLog. In: Database Support for Data Mining Applications, LNCS 2682, 2003.
  2. Sau Dan Lee, Luc De Raedt. Constraint Based Mining of First Order Sequences in SeqLog. In: Knowledge Discovery in Inductive Databases Workshop (KDID'02), 2002.
  3. Sau Dan Lee, Luc De Raedt. Constraint Based Mining of First Order Sequences in SeqLog (Extended Abstract). In: Workshop on Multi-Relational Data Mining (MRDM2002), 2002.
Spada/Ares Publication Years: 2001-2003
Purpose: enumerate all hierarchical frequent queries given a user defined mode bias and a relational database with hierarchies on the objects in the database.
  1. WEBPAGE
  2. Donato Malerba, Francesca A. Lisi. Discovering Associations between Spatial Objects: An ILP Application. In: Inductive Logic Programming, LNAI 2157, pages 156-163, 2001.
  3. Donato Malerba, Floriana Esposito, Francesca A. Lisi, Annalisa Appice. Mining Spatial Association Rules in Census Data. In: Research in Official Statistics, 2002.
  4. Annalisa Appice, Michelangelo Ceci, Antonietta Lanza, Francesca A. Lisi, Donato Malerba. Discovery of Spatial Association Rules in Georeferenced Census Data: A Relational Mining Approach. In: Intelligent Data Analysis 7, 2003.
  5. Francesca A. Lisi. Data Mining in Hybrid Languages via ILP. In: Proceedings of the 2003 International Workshop on Description Logics (DL2003), 2003.
  6. Francesca A. Lisi, Donato Malerba. Towards Object-Relational Data Mining. In: Atti dell'Undicesimo Convegno Nazionale su Sistemi Evoluti per Basi di Dati, pages 269-280, 2003.
  7. Francesca A. Lisi, Donato Malerba. Ideal Refinement of Descriptions in AL-log. In: Inductive Logic Programming, LNAI 2835, pages 215-232, 2003.
  8. Francesca A. Lisi, Donato Malerba. Bridging the Gap between Horn Clausal Logic and Description Logics in Inductive Learning. In: AI*IA 2003: Advances in Artificial Intelligence, LNAI 2829, pages 53-64, 2003.
Warmr Publication Years: 1997-2003
Purpose: enumerate all frequent queries given a user defined mode bias and a relational database.
  1. WEBPAGE
  2. Luc Dehaspe, Luc De Raedt. Mining association rules with multiple relations. In: Proceedings of the 7th International Workshop on Inductive Logic Programming, pages 125-132, 1997.
  3. Luc Dehaspe, Hannu Toivonen. Discovery of frequent Datalog patterns. In: Data Mining and Knowledge Discovery, pages 7-36, 1999.
  4. Hendrik Blockeel, Luc Dehaspe, Bart Demoen, Gerda Janssens, Jan Ramon, and Henk Vandecasteele. Executing query packs in ILP. In: Inductive Logic Programming, 10th International Conference (ILP2000), pages 60-77, 2000.
  5. Hendrik Blockeel, Luc Dehaspe, Bart Demoen, Gerda Janssens, Jan Ramon, and Henk Vandecasteele. Improving the efficiency of Inductive Logic Programming through the use of query packs, Journal of Artificial Intelligence Research 16, pages 135-166, 2002.
  6. Vitor Santos Costa, Ashwin Srinivasan, Rui Camacho, Hendrik Blockeel, Bart Demoen, Gerda Janssens, Jan Struyf, Henk Vandecasteele, Wim Van Laer. Query transformations for improving the efficiency of ILP systems. In: Journal of Machine Learning Research 4, pages 465-491, 2003.