Finding relational redescriptions
作者:Esther Galbrun, Angelika Kimmig
摘要
We introduce relational redescription mining, that is, the task of finding two structurally different patterns that describe nearly the same set of object pairs in a relational dataset. By extending redescription mining beyond propositional and real-valued attributes, it provides a powerful tool to match different relational descriptions of the same concept.
论文关键词:Redescription mining, Relational query mining, Inductive Logic Programming, Graph mining, Relational data mining
论文评审过程:
论文官网地址:https://doi.org/10.1007/s10994-013-5402-3