Levelwise Search and Pruning Strategies for First-Order Hypothesis Spaces |
| |
Authors: | Irene Weber |
| |
Affiliation: | (1) Institut für Informatik, Universität Stuttgart, Breitwiesenstr. 20–22, 70565 Stuttgart, Germany |
| |
Abstract: | The discovery of interesting patterns in relational databases is an important data mining task. This paper is concerned with the development of a search algorithm for first-order hypothesis spaces adopting an important pruning technique (termed subset pruning here) from association rule mining in a first-order setting. The basic search algorithm is extended by so-called requires and excludes constraints allowing to declare prior knowledge about the data, such as mutual exclusion or generalization relationships among attributes, so that it can be exploited for further structuring and restricting the search space. Furthermore, it is illustrated how to process taxonomies and numerical attributes in the search algorithm.Several task settings using different interestingness criteria and search modes with corresponding pruning criteria are described. Three settings serve as test beds for evaluation of the proposed approach. The experimental evaluation shows that the impact of subset pruning is significant, since it reduces the number of hypothesis evaluations in many cases by about 50%. The impact of generalization relationships is shown to be less effective in our experimental set-up. |
| |
Keywords: | data mining inductive logic programming levelwise search interesting pattern discovery first order patterns |
本文献已被 SpringerLink 等数据库收录! |
|