Finding relational redescriptions

DOI10.1007/s10994-013-5402-3zbMath1317.68157OpenAlexW2017439955MaRDI QIDQ479473

Angelika Kimmig, Esther Galbrun

Publication date: 5 December 2014

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: http://orca.cf.ac.uk/106740/1/galbrun-mlj13.pdf

zbMATH Keywords

inductive logic programminggraph miningredescription miningrelational data miningrelational query mining

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

On the complexity of redescription mining

Uses Software

• gSpan
• YAGO
• DBpedia

Cites Work

• Unnamed Item
• Unnamed Item
• Mining the semantic web statistical learning for next generation knowledge bases
• Itemset mining: a constraint programming perspective
• Relational retrieval using a combination of path-constrained random walks
• From black and white to full color: extending redescription mining outside the Boolean world
• Journal on Data Semantics IV

This page was built for publication: Finding relational redescriptions