This paper investigates local patterns in the multi-relational constraint-based data mining framework. Given this framework, it contributes to the theory of local patterns by providing the definition of local patterns, and a set of objective and subjective measures for evaluating the quality of induced patterns. These notions are illustrated on a description task of subgroup discovery, taking a propositionalization approach to relational subgroup discovery (RSD), based on adapting rule learning and first-order feature construction, applicable in individual-centered domains. It focuses on the use of constraints in RSD, both in feature construction and rule learning. We apply the proposed RSD approach to the Mutagenesis benchmark known from relational learning and a real-life telecommunications dataset. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Lavrač, N., Železný, F., & Džeroski, S. (2005). Local patterns: Theory and practice of constraint-based relational subgroup discovery. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3539 LNAI, pp. 71–88). Springer Verlag. https://doi.org/10.1007/11504245_5
Mendeley helps you to discover research relevant for your work.