Click to open the HelpDesk interface
AECE - Front page banner

Menu:


FACTS & FIGURES

JCR Impact Factor: 0.700
JCR 5-Year IF: 0.700
SCOPUS CiteScore: 1.8
Issues per year: 4
Current issue: Nov 2024
Next issue: Feb 2025
Avg review time: 57 days
Avg accept to publ: 60 days
APC: 300 EUR


PUBLISHER

Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229
ROMANIA

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 643243560
doi: 10.4316/AECE


TRAFFIC STATS

3,013,196 unique visits
1,169,582 downloads
Since November 1, 2009



Robots online now
DotBot
Googlebot


SCOPUS CiteScore

SCOPUS CiteScore


SJR SCImago RANK

SCImago Journal & Country Rank




TEXT LINKS

Anycast DNS Hosting
MOST RECENT ISSUES

 Volume 24 (2024)
 
     »   Issue 4 / 2024
 
     »   Issue 3 / 2024
 
     »   Issue 2 / 2024
 
     »   Issue 1 / 2024
 
 
 Volume 23 (2023)
 
     »   Issue 4 / 2023
 
     »   Issue 3 / 2023
 
     »   Issue 2 / 2023
 
     »   Issue 1 / 2023
 
 
 Volume 22 (2022)
 
     »   Issue 4 / 2022
 
     »   Issue 3 / 2022
 
     »   Issue 2 / 2022
 
     »   Issue 1 / 2022
 
 
 Volume 21 (2021)
 
     »   Issue 4 / 2021
 
     »   Issue 3 / 2021
 
     »   Issue 2 / 2021
 
     »   Issue 1 / 2021
 
 
  View all issues  


FEATURED ARTICLE

A Proposed Signal Reconstruction Algorithm over Bandlimited Channels for Wireless Communications, ASHOUR, A., KHALAF, A., HUSSEIN, A., HAMED, H., RAMADAN, A.
Issue 1/2023

AbstractPlus






LATEST NEWS

2024-Jun-20
Clarivate Analytics published the InCites Journal Citations Report for 2023. The InCites JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.700 (0.700 without Journal self-cites), and the InCites JCR 5-Year Impact Factor is 0.600.

2023-Jun-28
Clarivate Analytics published the InCites Journal Citations Report for 2022. The InCites JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.800 (0.700 without Journal self-cites), and the InCites JCR 5-Year Impact Factor is 1.000.

2023-Jun-05
SCOPUS published the CiteScore for 2022, computed by using an improved methodology, counting the citations received in 2019-2022 and dividing the sum by the number of papers published in the same time frame. The CiteScore of Advances in Electrical and Computer Engineering for 2022 is 2.0. For "General Computer Science" we rank #134/233 and for "Electrical and Electronic Engineering" we rank #478/738.

2022-Jun-28
Clarivate Analytics published the InCites Journal Citations Report for 2021. The InCites JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.825 (0.722 without Journal self-cites), and the InCites JCR 5-Year Impact Factor is 0.752.

2022-Jun-16
SCOPUS published the CiteScore for 2021, computed by using an improved methodology, counting the citations received in 2018-2021 and dividing the sum by the number of papers published in the same time frame. The CiteScore of Advances in Electrical and Computer Engineering for 2021 is 2.5, the same as for 2020 but better than all our previous results.

Read More »


    
 

  2/2015 - 10

 HIGHLY CITED PAPER 

Data Clustering on Breast Cancer Data Using Firefly Algorithm with Golden Ratio Method

DEMIR, M. See more information about DEMIR, M. on SCOPUS See more information about DEMIR, M. on IEEExplore See more information about DEMIR, M. on Web of Science, KARCI, A. See more information about KARCI, A. on SCOPUS See more information about KARCI, A. on SCOPUS See more information about KARCI, A. on Web of Science
 
Extra paper information in View the paper record and citations in Google Scholar View the paper record and similar papers in Microsoft Bing View the paper record and similar papers in Semantic Scholar the AI-powered research tool
Click to see author's profile in See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (926 KB) | Citation | Downloads: 1,091 | Views: 4,572

Author keywords
artificial intelligence, heuristic algorithms, clustering algorithms

References keywords
algorithm(30), optimization(24), applications(12), karci(11), search(7), sciences(7), intelligence(7), inspired(6), global(6), evolutionary(6)
Blue keywords are present in both the references section and the paper title.

About this article
Date of Publication: 2015-05-31
Volume 15, Issue 2, Year 2015, On page(s): 75 - 84
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2015.02010
Web of Science Accession Number: 000356808900010
SCOPUS ID: 84979827793

Abstract
Quick view
Full text preview
Heuristic methods are problem solving methods. In general, they obtain near-optimal solutions, and they do not take the care of provability of this case. The heuristic methods do not guarantee to obtain the optimal results; however, they guarantee to obtain near-optimal solutions in considerable time. In this paper, an application was performed by using firefly algorithm - one of the heuristic methods. The golden ratio was applied to different steps of firefly algorithm and different parameters of firefly algorithm to develop a new algorithm - called Firefly Algorithm with Golden Ratio (FAGR). It was shown that the golden ratio made firefly algorithm be superior to the firefly algorithm without golden ratio. At this aim, the developed algorithm was applied to WBCD database (breast cancer database) to cluster data obtained from breast cancer patients. The highest obtained success rate among all executions is 96% and the highest obtained average success rate in all executions is 94.5%.


References | Cited By  «-- Click to see who has cited this paper

[1] K.G. Murty, "Optimization Models For Decision Making", Internet Edition, Models for Decision Making, vol 1, Chapter 1, pp. 1-8, 2003.

[2] B. Alatas, "ACROA: Artificial Chemical Reaction Optimization Algorithm for Global Optimization", Expert Systems with Applications, vol 38, pp. 13170-13180, 2011,
[CrossRef] [Web of Science Times Cited 295] [SCOPUS Times Cited 356]


[3] L. Lamberti, C. Pappalettere, "Weight optimization of skeletal structures with multi-point simulated annealing", Computer Modelling in Engineering and Sciences, vol. 18, no. 3, pp. 183-221, 2007,
[CrossRef]


[4] R.-E. Precup, R.-C. David, E. M. Petriu, S. Preitl, A. S. Paul, "Gravitational search algorithm-based tuning of fuzzy control systems with a reduced parametric sensitivity", in Soft Computing in Industrial Applications, A. Gaspar-Cunha, R. Takahashi, G. Schaefer, and L. Costa, Eds., Springer-Verlag, Berlin, Heidelberg, Advances in Intelligent and Soft Computing, vol. 96, pp. 141-150, 2011,
[CrossRef] [SCOPUS Times Cited 80]


[5] S.I. Birbil, S.C. Fang, "An electromagnetism-like mechanism for global optimization", Journal of Global Optimization, vol 25, pp. 263-282, 2003,
[CrossRef] [Web of Science Times Cited 533] [SCOPUS Times Cited 698]


[6] R. Özdag, A. Karci, "The Application of Electromagnetism-like Algorithm for the Dynamic Deployment Problem in Wireless Sensor Networks", in Proc. 2nd International Eurasain Conference on Mathematical Sciences and Applications, Sarajevo, Bosnia and Hersegovina, Aug. 26-29, 2013, pp. 199.

[7] O.K. Erol, I. Eksin, "A new optimization method: Big bang-big crunch", Advances in Engineering Software, vol 37, no. 2, pp. 106-111, February 2006,
[CrossRef] [Web of Science Times Cited 1086] [SCOPUS Times Cited 1300]


[8] J.-T. Tsai, "Solving Japanese nongrams by Taguch-based genetic algorithm", Applied Intelligence, vol 37, no. 3, pp. 405-419, 2012,
[CrossRef] [Web of Science Times Cited 12] [SCOPUS Times Cited 12]


[9] H. Xing, R. Qu, "A compact genetic algorithm for the network coding based resource minimization problem", Applied Intelligence, vol 36, no. 4, pp. 809-823, 2011,
[CrossRef] [Web of Science Times Cited 26] [SCOPUS Times Cited 35]


[10] J. Rivero, D. Coadra, J. Calle, P. Isasi, "Using the ACO algorithm for path searches in social networks", Applied Intelligence, vol 36, no. 4, pp. 899-917, 2011,
[CrossRef] [Web of Science Times Cited 15] [SCOPUS Times Cited 21]


[11] D. Karaboga, B. Basturk, "A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm", Journal of Global Optimization, vol 39, no. 3, pp. 459-471, 2007,
[CrossRef] [Web of Science Times Cited 5138] [SCOPUS Times Cited 6394]


[12] B. Akay, D. Karaboga, "A Modified Artificial Bee Colony Algorithm for Real-Parameter Optimization", Information Sciences, vol 192, no. 1, pp. 120-142, 2012,
[CrossRef] [Web of Science Times Cited 829] [SCOPUS Times Cited 1055]


[13] L.N. De Castro, F.J. Von Zuben, "Learning and optimization using the clonal selection principle", IEEE Transactions on Evolutionary Computation, vol 6, no. 3, pp. 239-251, 2002,
[CrossRef] [Web of Science Times Cited 1529] [SCOPUS Times Cited 2182]


[14] X.-S. Yang, "Firefly algorithm, Levy flights and global optimization", in Proc. Research and Development in Intelligent Systems XXVI (Eds M. Bramer, R. Ellis, M. Petridis), Springer London, 2010, pp. 209-218,
[CrossRef] [Web of Science Times Cited 734] [SCOPUS Times Cited 950]


[15] X.-S. Yang, " Firefly algorithms for multimodal optimization" , Stochastic Algorithms:Foundations and Applications, Lecture Notes in Computer Science, Springer-Verlag, Berlin, vol 5792, pp. 169-178, 2009,
[CrossRef] [SCOPUS Times Cited 3545]


[16] X.-S. Yang, " Firefly algorithm, stochastic test functions and design optimisation", International Journal of Bio-Inspired Computation , vol 2, no. 2, pp. 78-84, 2010,
[CrossRef] [Web of Science Times Cited 570] [SCOPUS Times Cited 2216]


[17] X.-S. Yang, "Harmony Search as a Metaheuristic Algorithm", Music-Inspired Harmony Search Algorithm: Theory and Applications, Studies in Computational Intelligence, Springer Berlin, vol. 191, pp. 1-14, 2009,
[CrossRef] [SCOPUS Times Cited 205]


[18] A. Karci, "Theory of saplings growing-up algorithm", in Proc. ICANNGA-2007: Adaptive and Natural Computing Algorithms, Editors: Bartlomiej Beliczynski, Andrej Dzielinski, Marcin Iwanowski, Bernardete Ribeiro, Berlin Heidelberg, LNCS, vol 4431, pp 450-460, 2007,
[CrossRef] [SCOPUS Times Cited 24]


[19] A. Karci, Bilal Alatas, "Thinking Capability of Saplings Growing Up Algorithm", in Proc. IDEAL-2006: 7th International Conference on Intelligent Data Engineering and Automated Learning, LNCS, vol 4224, 2006, pp.386-393,
[CrossRef] [SCOPUS Times Cited 27]


[20] A. Karci, "Saplings Sowing and Growing up Algorithm Convergence Properties", in Proc. INISTA-2007: International Symposium on Innovations in Intelligent Systems and Applications, Yildiz Technical University, Istanbul, 2007, pp. 322-326.

[21] A. Karci, M. Yigiter, M. Demir, "Natural Inspired Computational Intelligence Method:Saplings Growing Up Algorithm", in Proc. Ikecco'2007 International Kyrgyz-Kazak Electronics And Computer Conference, Bishkek-Almaty, 2007, pp.1-8.

[22] M. Demir, M. Yigiter, A. Karci, "Application of Saplings Growing Up Algorithm to Clustering Medical Data", in Proc. Ikecco'2007 International Kyrgyz-Kazak Electronics And Computer Conference, Bishkek-Almaty , 2007, pp.9-15.

[23] M. Demir, A. Karci, M. Özdemir, "Fidan Gelisim Algoritmasi Yardimi ile DNA Motiflerinin Kesfi", Çankaya University Journal of Science and Engineering, volume 8, no. 1, pp. 51-62, 2011.

[24] A.R. Mehrabian, C. Lucas, "A novel numerical optimization algorithm inspired from weed colonization", Ecological Informatics, vol 1, no. 4, pp. 355-366, 2006,
[CrossRef] [Web of Science Times Cited 988] [SCOPUS Times Cited 1281]


[25] A. Mucherino, O. Seref, "Monkey search: A novel metaheuristics search for global optimization I. Continuous parameter optimization", Evolutionary Computation, vol 953, no. 1, pp. 25-49, 2007,
[CrossRef] [SCOPUS Times Cited 247]


[26] K.M. Passino, "Biomimicity of bacterial foraging for distributed optimization and control", IEEE Control Systems Magazine, vol 22, no. 3, pp. 52-67, 2002,
[CrossRef] [Web of Science Times Cited 2000] [SCOPUS Times Cited 2760]


[27] M. Canayaz, A. Karci, "A New Metaheuristic Cricket-Inspired Algorithm", in Proc. 2nd International Eurasain Conference on Mathematical Sciences and Applications, Sarajevo, Bosnia and Hersegovina, Aug. 26-29, 2013, pp. 176.

[28] E. Deniz 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]


[29] D. Niizuma, K. Yasuda, A. Ishigame, "Multi-point tabu search for traveling salesman problems", IEEE Transactions on Electrical and Electronic Engineering, vol 1, no. 1, pp. 126-129, 2006,
[CrossRef] [Web of Science Times Cited 5]


[30] E.A. Gargari, C. Lucas, "Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition", in Proc. IEEE congress on evolutionary computation, Singapore, 2007, pp. 4661-4667,
[CrossRef] [Web of Science Times Cited 1914] [SCOPUS Times Cited 2388]


[31] A. Karci, "A new Metaheuristic Algorithm Based Chemical Process: Atom Algorithm", in Proc. 1st International Eurasain Conference on Mathematical Sciences and Applications, Prishtine, Kosovo, Sep. 3-7, 2012, pp. 83-84.

[32] A.Erdogan Yildirim, A. Karci, "Solutions of Travelling Salesman Problem Using Genetic Algorithm and Atom Algorithm", in Proc. 2nd International Eurasain Conference on Mathematical Sciences and Applications, Sarajevo, Bosnia and Hercegovina, Aug. 26-29, 2013, pp. 134.

[33] A. Karadogan, A. Karci, "Artificial Atom Algorithm for Reinforcement Learning", in Proc. 2nd International Eurasain Conference on Mathematical Sciences and Applications, Sarajevo, Bosnia and Hercegovina, Aug. 26-29, 2013, pp. 379.

[34] J. Kennedy, R.C. Eberhart, "Particle swarm optimization", in Proc. of IEEE international conference on neural Networks, Australia, 1995, vol 4, pp. 1942-1948,
[CrossRef] [Web of Science Times Cited 32956]


[35] N. A. El-Hefnawy, "Solving Bi-level Problems Using Modified Particle Swarm Optimization Algorithm", International Journal of Artificial Intelligence, vol. 12, no. 2, pp. 88-101, 2014.

[36] S.C. Chu, P.W. Tsai, J.S. Pan, "Cat swarm optimization", PRICAI 2006: Trends in Artificial Intelligence Lecture Notes in Computer Science, Volume 4099, pp 854-858, 2006,
[CrossRef]


[37] D. Simon, "Biogeography-based optimization", IEEE Transactions on Evolutionary Computation, vol 12, no. 6, pp. 702-713, 2008,
[CrossRef] [Web of Science Times Cited 3017] [SCOPUS Times Cited 3676]


[38] K.S. Lee, Z.W. Geem, "A new metaheuristics algorithm for continues engineering optimization: Harmony search theory and practice", Computer Methods in Applied Mechanics and Engineering, vol 194, no. 36-38, pp. 3902-3933, 2005,
[CrossRef] [Web of Science Times Cited 1311] [SCOPUS Times Cited 1669]


[39] F. Valdez, P. Malin, O. Castillo, "An improved evolutionary method with fuzzy logic for combining Particle Swarm Optimization and Genetic Algorithms", Applied Soft Computing, vol. 11, no. 2, pp. 2625-2632, 2011,
[CrossRef] [Web of Science Times Cited 158] [SCOPUS Times Cited 205]


[40] G. Markowsky, "Misconceptions about the Golden Ratio", The College Mathematics Journal, Vol. 23, No. 1, pp. 2-19, 1992.

[41] G. Wang, L. Guo, H. Duan, L. Liu and H. Wang, " A Modified Firefly Algorithm for UCAV Path Planning ", International Journal of Hybrid Information Technology, vol. 5, no. 3, pp. 123-144, 3 July, 2012.

[42] A. E. Temiz " Determination Of Breast Cancer Using ANN ", Electronic Letters on Science & Engineering , vol. 3, no. 2, pp. 15-20, 2007.

[43] T. Kiyan, T. Yildirim, "Egiticili ve Egiticisiz Nöral Algoritmalar Kullanarak Gögus Kanseri Teshisi", in Proc. Elektrik -Elektronik - Bilgisayar Muhendisligi 10. Ulusal Kongresi, Istanbul, 2003, pp. 453-456.

[44] A. Eleyan, "Breast Cancer Classification Using Moments", in Proc. Signal Processing and Communications Applications Conference (SIU) 20 th, Mugla, Turkey, 18-20 April, 2012, pp. 1-4,
[CrossRef] [SCOPUS Times Cited 7]


[45] M. Karabatak, M. C. Ince, E. Avci, " An Expert Sytem for Diagnosis Breast Cancer Based on Principal Component Analysis Method ", in Proc. Signal Processing, Communication and Applications Conference, SIU 2008, IEEE 16th , Aydin, Turkey, 20-22 April, 2008, pp. 1-4,
[CrossRef] [SCOPUS Times Cited 9]


References Weight

Web of Science® Citations for all references: 53,120 TCR
SCOPUS® Citations for all references: 31,348 TCR

Web of Science® Average Citations per reference: 1,180 ACR
SCOPUS® Average Citations per reference: 697 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-25 17:12 in 205 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.




Website loading speed and performance optimization powered by: 


DNS Made Easy