finding relational redescriptions

we propose an alternating scheme for solving this problem. its core consists of a novel relational query miner that efficiently identifies discriminative connection patterns between pairs of objects. compared to a baseline inductive logic programming (ilp) approach, our query miner is able to mine more complex queries, much faster. we performed extensive experiments on three real world relational datasets, and present examples of redescriptions found, exhibiting the power of the method to expressively capture relations present in these networks.