Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1947940.1948025acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicccsConference Proceedingsconference-collections
research-article

Parallel multi-objective genetic algorithms for associative classification rule mining

Published: 12 February 2011 Publication History

Abstract

Association and classification rule mining are two well-known techniques used in data mining. The integrated approach is known as associative classification rule mining (ACRM), which has helped in developing a compact and efficient classifier for the classification of unknown samples. In this paper, we treated the ACRM as a multi-objective problem and applied the Parallel Multi-objective Genetic Algorithms (PMOGAs) to solve it. ACRM is associated with two phases like rule extraction and rule selection. As ACRM is a multi-objective problem so by applying PMOGA on it we can optimize the measures like support and confidence of association rule mining to extract classification rules in rule extraction phase and in rule selection phase a small number of rules are targeted from the extracted rules to design an accurate and compact classifier, which can maximize the accuracy of the rule set and minimize their complexity. Experiments are conducted on UCI data set by using MOGA and PMOGA. Finally the computational results are analyzed and concluded that the PMOGA for multi-objective rule selection generates a Pareto optimal rule sets with a compact set of classification rules in less time vis-a-vis to MOGA without severely degrading their classification accuracy.

References

[1]
R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. Advances in knowledge discovery and data mining, pages 307--328, 1996.
[2]
J. Branke, H. Schmeck, K. Deb, and R. S. Maheshwar. Parallelizing multi-objective evolutionary algorithms: Cone separation. In Congress on Evolutionary Computation (CEC 2004), pages 1952--1957, Portland, Oregon, USA, 2004. IEEE Press.
[3]
F. Coenen, P. Leng, and L. Zhang. Threshold tuning for improved classification association rule mining. In Advances in Knowledge Discovery and Data Mining - PAKDD 2005, volume 3518 of Lecture Notes in Artificial Intelligence, pages 216--225. Springer, 2005.
[4]
B. de la Iglesia, A. Reynolds, and V. J. Rayward-Smith. Developments on a multi-objective metaheuristic (MOMH) algorithm for finding interesting sets of classification rules. In Evolutionary Multi Criterion Optimization EMO 2005, Lecture Notes in Computer Science, volume 3410, pages 826--840, Berlin, 2005. Springer.
[5]
K. Deb, A. Pratap, S. Agrawal, and T. Meyarivan. A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182--197, 2002.
[6]
C. Grosan. How to compare the multi-objective evolutionary algorithms performances? Zilele Academice, 2003.
[7]
H. Ishibuchi, I. Kunwajima, and Y. Nojima. Multi-objective evolutionary algorithms for knowledge discovery from databases. In A. Ghosh, S. Dehuri, and S. Ghosh, editors, Evolutionary Multi-objective Rule Selection for classification rule mining, pages 47--70. Springer, Berlin, March 2008.
[8]
W. Li, J. Han, and J. Pei. Cmar: Accurate and efficient classification based on multiple class-association rules. IEEE International Conference on Data Mining, ICDM '01, pages 369--376, 2001.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences
ICCCS '11: Proceedings of the 2011 International Conference on Communication, Computing & Security
February 2011
656 pages
ISBN:9781450304641
DOI:10.1145/1947940
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 February 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. association
  2. associative classifier
  3. classification
  4. multi-objective genetic algorithms
  5. parallel multi-objective genetic algorithms

Qualifiers

  • Research-article

Conference

ICCCS '11

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)1
Reflects downloads up to 10 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2016)Rules Extraction using Data Mining in Historical DataBusiness Intelligence10.4018/978-1-4666-9562-7.ch014(263-279)Online publication date: 2016
  • (2015)GPU-based bees swarm optimization for association rules miningThe Journal of Supercomputing10.1007/s11227-014-1366-871:4(1318-1344)Online publication date: 1-Apr-2015
  • (2014)Rules Extraction using Data Mining in Historical DataData Mining and Analysis in the Engineering Field10.4018/978-1-4666-6086-1.ch006(89-106)Online publication date: 2014
  • (2013)Revisiting evolutionary algorithms in feature selection and nonfuzzy/fuzzy rule based classificationWIREs Data Mining and Knowledge Discovery10.1002/widm.10873:2(83-108)Online publication date: 20-Feb-2013
  • (2011)Parallel Single and Multiple Objectives Genetic AlgorithmsInternational Journal of Applied Evolutionary Computation10.4018/jaec.20110401022:2(21-57)Online publication date: 1-Apr-2011

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media