Understanding the crucial role of attribute interaction in data mining

被引:94
作者
Freitas, AA [1 ]
机构
[1] Pontificia Univ Catolica Parana, Postgrad Program Comp Sci, BR-80215901 Curitiba, Parana, Brazil
关键词
attribute interaction; classification; constructive induction; data mining; evolutionary algorithms; inductive logic programming; rule induction; rule interestingness; Simpson's paradox; small disjuncts;
D O I
10.1023/A:1011996210207
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This is a review paper, whose goal is to significantly improve our understanding of the crucial role of attribute interaction in data mining. The main contributions of this paper are as follows. Firstly, we show that the concept of attribute interaction has a crucial role across different kinds of problem in data mining, such as attribute construction, coping with small disjuncts, induction of first-order logic rules, detection of Simpson's paradox, and finding several types of interesting rules. Hence, a better understanding of attribute interaction can lead to a better understanding of the relationship between these kinds of problems, which are usually studied separately from each other. Secondly, we draw attention to the fact that most rule induction algorithms are based on a greedy search which does not cope well with the problem of attribute interaction, and point out some alternative kinds of rule discovery methods which tend to cope better with this problem. Thirdly, we discussed several algorithms and methods for discovering interesting knowledge that, implicitly or explicitly, are based on the concept of attribute interaction.
引用
收藏
页码:177 / 199
页数:23
相关论文
共 53 条
[1]  
ANGLANO C, 1997, P 7 INT C GEN ALG, P434
[2]  
[Anonymous], P 11 INT JOINT C ART
[3]  
[Anonymous], 1998, Genetic programming: an introduction
[4]  
[Anonymous], P C GEN EV COMP
[5]  
[Anonymous], 1998, MINING VERY LARGE DA
[6]  
[Anonymous], P 10 CAN C ART INT
[7]  
ARAUJO DLA, 1999, P 1999 IEEE SYST MAN, V3, P940
[8]  
BHANDARI I, 1994, P AAAI 94 WORKSH KNO, P61
[9]  
BHANDARI I, 1993, P 1993 WORKSH KNOWL, P61
[10]  
BRAZDIL P, 1994, MACHINE LEARNING NEU, pCH10