Distributed multi-relational data mining based on genetic algorithm

Wenxiang Dou, Takayuki Furuzuki, Kotaro Hirasawa, Gengfeng Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

An efficient algorithm for mining important association rule from multi-relational database using distributed mining ideas. Most existing data mining approaches look for rules in a single data table. However, most databases are multi-relational. In this paper, we present a novel distributed data-mining method to mine important rules in multiple tables (relations) and combine the method with genetic algorithm to enhance the mining efficiency. Genetic algorithm is in charge of finding antecedent rules and aggregate of transaction set that produces the corresponding rule from the chief attributes. Apriori and statistic method is in charge of mining consequent rules from the rest relational attributes of other tables according to the corresponding transaction set producing the antecedent rule in a distributed way. Our method has several advantages over most exiting data mining approaches. First, it can process multi-relational database efficiently. Second, rules produced have finer pattern. Finally, we adopt a new concept of extended association rules that contain more import and underlying information.

Original languageEnglish
Title of host publication2008 IEEE Congress on Evolutionary Computation, CEC 2008
Pages744-750
Number of pages7
DOIs
Publication statusPublished - 2008
Event2008 IEEE Congress on Evolutionary Computation, CEC 2008 - Hong Kong
Duration: 2008 Jun 12008 Jun 6

Other

Other2008 IEEE Congress on Evolutionary Computation, CEC 2008
CityHong Kong
Period08/6/108/6/6

Fingerprint

Data mining
Data Mining
Genetic algorithms
Association rules
Genetic Algorithm
Mining
Relational Database
Transactions
Tables
Statistics
Attribute
Charge
Distributed Data Mining
Association Rule Mining
Association Rules
Statistic
Table
Efficient Algorithms

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Dou, W., Furuzuki, T., Hirasawa, K., & Wu, G. (2008). Distributed multi-relational data mining based on genetic algorithm. In 2008 IEEE Congress on Evolutionary Computation, CEC 2008 (pp. 744-750). [4630879] https://doi.org/10.1109/CEC.2008.4630879

Distributed multi-relational data mining based on genetic algorithm. / Dou, Wenxiang; Furuzuki, Takayuki; Hirasawa, Kotaro; Wu, Gengfeng.

2008 IEEE Congress on Evolutionary Computation, CEC 2008. 2008. p. 744-750 4630879.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dou, W, Furuzuki, T, Hirasawa, K & Wu, G 2008, Distributed multi-relational data mining based on genetic algorithm. in 2008 IEEE Congress on Evolutionary Computation, CEC 2008., 4630879, pp. 744-750, 2008 IEEE Congress on Evolutionary Computation, CEC 2008, Hong Kong, 08/6/1. https://doi.org/10.1109/CEC.2008.4630879
Dou W, Furuzuki T, Hirasawa K, Wu G. Distributed multi-relational data mining based on genetic algorithm. In 2008 IEEE Congress on Evolutionary Computation, CEC 2008. 2008. p. 744-750. 4630879 https://doi.org/10.1109/CEC.2008.4630879
Dou, Wenxiang ; Furuzuki, Takayuki ; Hirasawa, Kotaro ; Wu, Gengfeng. / Distributed multi-relational data mining based on genetic algorithm. 2008 IEEE Congress on Evolutionary Computation, CEC 2008. 2008. pp. 744-750
@inproceedings{07b26520bda14404b3ddd96539219329,
title = "Distributed multi-relational data mining based on genetic algorithm",
abstract = "An efficient algorithm for mining important association rule from multi-relational database using distributed mining ideas. Most existing data mining approaches look for rules in a single data table. However, most databases are multi-relational. In this paper, we present a novel distributed data-mining method to mine important rules in multiple tables (relations) and combine the method with genetic algorithm to enhance the mining efficiency. Genetic algorithm is in charge of finding antecedent rules and aggregate of transaction set that produces the corresponding rule from the chief attributes. Apriori and statistic method is in charge of mining consequent rules from the rest relational attributes of other tables according to the corresponding transaction set producing the antecedent rule in a distributed way. Our method has several advantages over most exiting data mining approaches. First, it can process multi-relational database efficiently. Second, rules produced have finer pattern. Finally, we adopt a new concept of extended association rules that contain more import and underlying information.",
author = "Wenxiang Dou and Takayuki Furuzuki and Kotaro Hirasawa and Gengfeng Wu",
year = "2008",
doi = "10.1109/CEC.2008.4630879",
language = "English",
isbn = "9781424418237",
pages = "744--750",
booktitle = "2008 IEEE Congress on Evolutionary Computation, CEC 2008",

}

TY - GEN

T1 - Distributed multi-relational data mining based on genetic algorithm

AU - Dou, Wenxiang

AU - Furuzuki, Takayuki

AU - Hirasawa, Kotaro

AU - Wu, Gengfeng

PY - 2008

Y1 - 2008

N2 - An efficient algorithm for mining important association rule from multi-relational database using distributed mining ideas. Most existing data mining approaches look for rules in a single data table. However, most databases are multi-relational. In this paper, we present a novel distributed data-mining method to mine important rules in multiple tables (relations) and combine the method with genetic algorithm to enhance the mining efficiency. Genetic algorithm is in charge of finding antecedent rules and aggregate of transaction set that produces the corresponding rule from the chief attributes. Apriori and statistic method is in charge of mining consequent rules from the rest relational attributes of other tables according to the corresponding transaction set producing the antecedent rule in a distributed way. Our method has several advantages over most exiting data mining approaches. First, it can process multi-relational database efficiently. Second, rules produced have finer pattern. Finally, we adopt a new concept of extended association rules that contain more import and underlying information.

AB - An efficient algorithm for mining important association rule from multi-relational database using distributed mining ideas. Most existing data mining approaches look for rules in a single data table. However, most databases are multi-relational. In this paper, we present a novel distributed data-mining method to mine important rules in multiple tables (relations) and combine the method with genetic algorithm to enhance the mining efficiency. Genetic algorithm is in charge of finding antecedent rules and aggregate of transaction set that produces the corresponding rule from the chief attributes. Apriori and statistic method is in charge of mining consequent rules from the rest relational attributes of other tables according to the corresponding transaction set producing the antecedent rule in a distributed way. Our method has several advantages over most exiting data mining approaches. First, it can process multi-relational database efficiently. Second, rules produced have finer pattern. Finally, we adopt a new concept of extended association rules that contain more import and underlying information.

UR - http://www.scopus.com/inward/record.url?scp=55749093971&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=55749093971&partnerID=8YFLogxK

U2 - 10.1109/CEC.2008.4630879

DO - 10.1109/CEC.2008.4630879

M3 - Conference contribution

SN - 9781424418237

SP - 744

EP - 750

BT - 2008 IEEE Congress on Evolutionary Computation, CEC 2008

ER -