eCite Digital Repository

A new evolutionary algorithm for extracting a reduced set of interesting association rules


Kabir, MMJ and Xu, S and Kang, BH and Zhao, Z, A new evolutionary algorithm for extracting a reduced set of interesting association rules, Lecture Notes in Computer Science: 22nd International Conference, ICONIP 2015 - Neural Information Processing, 09-12 November 2015, Istanbul, Turkey, pp. 133-142. ISBN 978-3-319-26534-6 (2015) [Refereed Conference Paper]

Restricted - Request a copy

Copyright Statement

Copyright 2015 Springer International

DOI: doi:10.1007/978-3-319-26535-3_16


Data mining techniques involve extracting useful, novel and interesting patterns from large data sets. Traditional association rule mining algorithms generate a huge number of unnecessary rules because of using support and confidence values as a constraint for measuring the quality of generated rules. Recently, several studies defined the process of extracting association rules as a multi-objective problem allowing researchers to optimize different measures that can present in different degrees depending on the data sets used. Applying evolutionary algorithms to noisy data of a large data set, is especially useful for automatic data processing and discovering meaningful and significant association rules. From the beginning of the last decade, multi-objective evolutionary algorithms are gradually becoming more and more useful in data mining research areas. In this paper, we propose a new multi-objective evolutionary algorithm, MBAREA, for mining useful Boolean association rules with low computational cost. To accomplish this our proposed method extends a recent multi-objective evolutionary algorithm based on a decomposition technique to perform evolutionary learning of a fitness value of each rule, while introducing a best population and a class based mutation method to store all the best rules obtained at some point of intermediate generation of a population and improving the diversity of the obtained rules. Moreover, this approach maximizes two objectives such as performance and interestingness for getting rules which are useful, easy to understand and interesting. This proposed algorithm is applied to different real world data sets to demonstrate the effectiveness of the proposed approach and the result is compared with existing evolutionary algorithm based approaches.

Item Details

Item Type:Refereed Conference Paper
Keywords:data mining, association rules, multi-objective evolutionary algorithms, conditional probability, interestingness
Research Division:Information and Computing Sciences
Research Group:Machine learning
Research Field:Neural networks
Objective Division:Information and Communication Services
Objective Group:Information systems, technologies and services
Objective Field:Information systems, technologies and services not elsewhere classified
UTAS Author:Kabir, MMJ (Mr Mir Kabir)
UTAS Author:Xu, S (Dr Shuxiang Xu)
UTAS Author:Kang, BH (Professor Byeong Kang)
UTAS Author:Zhao, Z (Dr Zongyuan Zhao)
ID Code:104670
Year Published:2015
Web of Science® Times Cited:9
Deposited By:Information and Communication Technology
Deposited On:2015-11-18
Last Modified:2018-01-16

Repository Staff Only: item control page