| 4/2015 - 3 |
Automatic Mining of Numerical Classification Rules with Parliamentary Optimization AlgorithmKIZILOLUK, S.   , ALATAS, B. |
Extra paper information in    |
| Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF  (1,850 KB) | Citation | Downloads: 1,011 | Views: 3,725 |
Author keywords
classification algorithms, computational intelligence, data mining, heuristic algorithms, optimization
References keywords
optimization(15), algorithm(7), science(5), parliamentary(5), mining(5), classification(5), rules(4), global(4), alatas(4)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2015-11-30
Volume 15, Issue 4, Year 2015, On page(s): 17 - 24
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2015.04003
Web of Science Accession Number: 000368499800003
SCOPUS ID: 84949980538
Abstract
In recent years, classification rules mining has been one of the most important data mining tasks. In this study, one of the newest social-based metaheuristic methods, Parliamentary Optimization Algorithm (POA), is firstly used for automatically mining of comprehensible and accurate classification rules within datasets which have numerical attributes. Four different numerical datasets have been selected from UCI data warehouse and classification rules of high quality have been obtained. Furthermore, the results obtained from designed POA have been compared with the results obtained from four different popular classification rules mining algorithms used in WEKA. Although POA is very new and no applications in complex data mining problems have been performed, the results seem promising. The used objective function is very flexible and many different objectives can easily be added to. The intervals of the numerical attributes in the rules have been automatically found without any a priori process, as done in other classification rules mining algorithms, which causes the modification of datasets. |
| References | | | Cited By «-- Click to see who has cited this paper |
| [1] J. Han and M. Kamber, Data Mining: Concepts and Techniques, Second Edition, Morgan Kaufmann, San Francisco, ch. 1, 2006.
[2] P. Kosina, J. Gama, "Very fast decision rules for classification in data streams", Data Mining and Knowledge Discovery, vol. 29, no. 1, pp. 168-202, 2015. [CrossRef] [Web of Science Times Cited 27] [SCOPUS Times Cited 37] [3] M. Hacibeyoglu, A. Arslan, S. Kahramanli, "A hybrid method for fast finding the reduct with the best classification accuracy", Advances in Electrical and Computer Engineering, vol. 13, no. 4, pp. 57-64, 2013. [CrossRef] [Full Text] [Web of Science Times Cited 5] [SCOPUS Times Cited 5] [4] E. D. Ulker, A. Haydar, "Comparing the robustness of evolutionary algorithms on the basis of benchmark functions", Advances in Electrical and Computer Engineering, vol. 13, no. 2, pp. 59-64, 2013. [CrossRef] [Full Text] [Web of Science Times Cited 4] [SCOPUS Times Cited 6] [5] R. Ngamtawee, P. Wardkein, "Simplified genetic algorithm: simplify and improve RGA for parameter optimizations", Advances in Electrical and Computer Engineering, vol. 14, no. 4, pp. 55-64, 2014. [CrossRef] [Full Text] [Web of Science Times Cited 3] [SCOPUS Times Cited 5] [6] B. Alatas, "A novel chemistry based metaheuristic optimization method for mining of classification rules", Expert Systems with Applications, vol. 39, no. 12, pp. 11080-11088, 2012. [CrossRef] [Web of Science Times Cited 56] [SCOPUS Times Cited 74] [7] S. Bechikh, A. Chaabani, L.B. Said, "An efficient chemical reaction optimization algorithm for multiobjective optimization", IEEE Transactions on Cybernetics, vol. 45, no. 10, pp. 2051-2064, 2015. [CrossRef] [Web of Science Times Cited 70] [SCOPUS Times Cited 80] [8] M. Dorigo, V. Maniezzo, A. Colorni, "The ant system: Optimization by a colony of cooperating agents", IEEE Transactions on Systems, Man, and Cybernetics, Part B., vol. 26, no. 1, pp. 29-41, 2002. [CrossRef] [Web of Science Times Cited 7451] [SCOPUS Times Cited 10326] [9] B. Alatas, E. Akin, "FCACO: Fuzzy Classification Rules Mining Algorithm with Ant Colony Optimization", Lecture Notes in Computer Science, vol. 3612, pp. 787-797, 2005. [CrossRef] [SCOPUS Times Cited 11] [10] L. De Castro and J. Timmis, Artificial Immune Systems: A New Computational Intelligence Approach, Springer, ch. 3, 2002. [11] B. Alatas, E. Akin, "Mining Fuzzy Classification Rules Using an Artificial Immune System with Boosting", Lecture Notes in Computer Science, vol. 3631, pp. 283-293, 2005. [CrossRef] [SCOPUS Times Cited 32] [12] S. Kirkpatrick, C. D. Gerlatt, M. P. Vecchi, "Optimization by simulated annealing", Science, vol. 220, no. 4598, pp. 671-680, 1983. [CrossRef] [Web of Science Times Cited 28066] [SCOPUS Times Cited 34114] [13] I. Birbil and S. Fang, "An electromagnetism-like mechanism for global optimization", Journal of Global Optimization, vol. 25, no. 3, pp. 263-282, 2003. [CrossRef] [Web of Science Times Cited 533] [SCOPUS Times Cited 698] [14] F. Glover, "Tabu search-part I", ORSA Journal on Computing, vol. 1, no. 3, pp. 190-206, 1989. [CrossRef] [15] E. Atashpaz-Gargari and C. Lucas, 2007, "Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition", IEEE Congress on Evolutionary Computation, 2007, pp. 4661-4667. [CrossRef] [Web of Science Times Cited 1911] [SCOPUS Times Cited 2383] [16] A. Borji, "A new global optimization algorithm inspired by parliamentary political competitions", Lecture Notes in Computer Science, vol. 4827, pp. 61-71, 2007. [CrossRef] [SCOPUS Times Cited 36] [17] R. V. Rao, V. J. Savsani, D. P. Vakharia, "Teaching-learning-based optimization: an optimization method for continuous non-linear large scale problems", Information Sciences, vol. 183, no. 1, pp. 1-15, 2012. [CrossRef] [Web of Science Times Cited 1223] [SCOPUS Times Cited 1533] [18] A. Borji and M. Hamidi, "A new approach to global optimization motivated by parliamentary political competitions", Int. Journal of Innovative Computing, Information and Control, vol. 5, no. 6, pp. 1643-1653, 2009. [19] F. Altunbey, B. Alatas, "Overlapping community detection in social networks using parliamentary optimization algorithm", International Journal of Computer Networks and Applications, vol. 2, no. 1, 12-19, 2015. [20] L. de-Marcos, A. Garcia-Cabot, E. Garcia-Lopez, J. Medina, "Parliamentary optimization to build personalized learning paths: Case study in web engineering curriculum", The International Journal of Engineering Education, vol. 31, no. 4, 2015. [21] L. de-Marcos, A. García, E. Garcia, J. J. Martinez, J. A. Gutierrez, R. Barchino, J. M. Gutierrez, J. R. Hilera, S. Oton, "An adaptation of the parliamentary metaheuristic for permutation constraint satisfaction", IEEE Congress on Evolutionary Computation (CEC), pp.1-8, 2010. [CrossRef] [SCOPUS Times Cited 8] Web of Science® Citations for all references: 39,349 TCR SCOPUS® Citations for all references: 49,348 TCR Web of Science® Average Citations per reference: 1,789 ACR SCOPUS® Average Citations per reference: 2,243 ACR TCR = Total Citations for References / ACR = Average Citations per Reference We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more Citations for references updated on 2024-11-15 13:57 in 112 seconds. Note1: Web of Science® is a registered trademark of Clarivate Analytics. Note2: SCOPUS® is a registered trademark of Elsevier B.V. Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site. |
Copyright ©2001-2024
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
