Local Patterns: Theory and Practice of Constraint-Based Relational Subgroup Discovery
| 详细信息 | 推荐本文 | |
- 作者：Nada Lavra膷 ; Filip 沤elezn媒 ; Sa拧o D啪eroski
- 刊名：Lecture Notes in Computer Science
- 出版时间：2005
- 出版年：2005
- 期刊代码：99_0302-9743
- 类别：cp
- 卷：3539
- 期：1
- 页码：p.71
- 数据来源：sp
摘要
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.