TY - GEN
T1 - Self-adaptive mechanism in genetic network programming for mining association rules
AU - Taboada, Karla
AU - Shimada, Kaoru
AU - Mabu, Shingo
AU - Hirasawa, Kotaro
AU - Hu, Jinglu
PY - 2006/12/1
Y1 - 2006/12/1
N2 - In this paper we propose a method of association rule mining using Genetic Network Programming (GNP) with a self-adaptation mechanism in order to improve the performance of association rule extraction systems. GNP is a kind of evolutionary methods, whose directed graphs are evolved to find a solution as individuals. Self-adaptation behavior in GNP is related to adjust the setting of control parameters such as crossover and mutation rates. It is called self-adaptive because the algorithm controls the setting of these parameters itself - embedding them into an individual's genome and evolving them. The aim is not only to find suitable adjustments but to do this efficiently. Our method can measure the significance of the association via the chi-squared test and obtain a sufficient number of important association rules. Extracted association rules are stored in a pool all together through generations and reflected in three genetic operators as acquired information. Further, our method can contain negation of attributes in association rules and suit association rule mining from dense databases.
AB - In this paper we propose a method of association rule mining using Genetic Network Programming (GNP) with a self-adaptation mechanism in order to improve the performance of association rule extraction systems. GNP is a kind of evolutionary methods, whose directed graphs are evolved to find a solution as individuals. Self-adaptation behavior in GNP is related to adjust the setting of control parameters such as crossover and mutation rates. It is called self-adaptive because the algorithm controls the setting of these parameters itself - embedding them into an individual's genome and evolving them. The aim is not only to find suitable adjustments but to do this efficiently. Our method can measure the significance of the association via the chi-squared test and obtain a sufficient number of important association rules. Extracted association rules are stored in a pool all together through generations and reflected in three genetic operators as acquired information. Further, our method can contain negation of attributes in association rules and suit association rule mining from dense databases.
KW - Association rules
KW - Data mining
KW - Evolutionary computation
KW - Genetic network programming
KW - Self-adaptation
UR - http://www.scopus.com/inward/record.url?scp=34250775514&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34250775514&partnerID=8YFLogxK
U2 - 10.1109/SICE.2006.315846
DO - 10.1109/SICE.2006.315846
M3 - Conference contribution
AN - SCOPUS:34250775514
SN - 8995003855
SN - 9788995003855
T3 - 2006 SICE-ICASE International Joint Conference
SP - 6007
EP - 6012
BT - 2006 SICE-ICASE International Joint Conference
T2 - 2006 SICE-ICASE International Joint Conference
Y2 - 18 October 2006 through 21 October 2006
ER -