Utilizing Coverage Lists as a Pruning Mechanism for Concept Discovery


29th Annual Symposium on Computer and Information Sciences, Krakow, Poland, 27 - 28 October 2014, pp.269-276 identifier

  • Publication Type: Conference Paper / Full Text
  • Doi Number: 10.1007/978-3-319-09465-6_28
  • City: Krakow
  • Country: Poland
  • Page Numbers: pp.269-276
  • Middle East Technical University Affiliated: Yes


Inductive logic programming (ILP)-based concept discovery systems lack computational efficiency due to the evaluation of the large search spaces they build. One way to tackle this issue is employing pruning mechanisms. In this work, we propose a two-phase pruning mechanism for concept discovery systems that employ an Apriori-like refinement operator and evaluate the goodness of the concept descriptors based on their support value. The first step, which is novel in this work, is computationally inexpensive and prunes the search space based on the coverages of the concept descriptors. The second step employs a widely employed pruning mechanism based on the support value of the concept descriptors. The experimental results show that the first step leaves a search space reduced by 4-22% to be evaluated by the second step, which is more costly.