• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Editorial Staff
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
 
  • Login
  • Register
Home Articles List Article Information
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • How to cite Export to
    RIS EndNote BibTeX APA MLA Harvard Vancouver
  • |
  • Share Share
    CiteULike Mendeley Facebook Google LinkedIn Twitter
Journal of Computer & Robotics
arrow Articles in Press
arrow Current Issue
Journal Archive
Volume Volume 12 (2019)
Volume Volume 11 (2018)
Volume Volume 10 (2017)
Volume Volume 9 (2016)
Issue Issue 2
Issue Issue 1
Volume Volume 8 (2015)
Volume Volume 7 (2014)
Volume Volume 6 (2013)
Volume Volume 5 (2012)
Volume Volume 4 (2011)
Volume Volume 3 (2010)
Volume Volume 1 (2008)
Poor Ramezani Kalashami, S., Seyyed Mahdavi Chabok, S. (2016). Use of the Improved Frog-Leaping Algorithm in Data Clustering. Journal of Computer & Robotics, 9(2), 19-26.
Sahifeh Poor Ramezani Kalashami; Seyyed Javad Seyyed Mahdavi Chabok. "Use of the Improved Frog-Leaping Algorithm in Data Clustering". Journal of Computer & Robotics, 9, 2, 2016, 19-26.
Poor Ramezani Kalashami, S., Seyyed Mahdavi Chabok, S. (2016). 'Use of the Improved Frog-Leaping Algorithm in Data Clustering', Journal of Computer & Robotics, 9(2), pp. 19-26.
Poor Ramezani Kalashami, S., Seyyed Mahdavi Chabok, S. Use of the Improved Frog-Leaping Algorithm in Data Clustering. Journal of Computer & Robotics, 2016; 9(2): 19-26.

Use of the Improved Frog-Leaping Algorithm in Data Clustering

Article 3, Volume 9, Issue 2, Summer and Autumn 2016, Page 19-26  XML PDF (251.14 K)
Document Type: Original Research (Full Papers)
Authors
Sahifeh Poor Ramezani Kalashami* ; Seyyed Javad Seyyed Mahdavi Chabok
Faculty of Engineering, Department of Artificial Intelligence, Mashhad Branch, Islamic Azad University, Mashhad, Iran
Receive Date: 05 February 2016,  Accept Date: 24 March 2016 
Abstract
Clustering is one of the known techniques in the field of data mining where data with similar properties is within the set of categories. K-means algorithm is one the simplest clustering algorithms which have disadvantages sensitive to initial values of the clusters and converging to the local optimum. In recent years, several algorithms are provided based on evolutionary algorithms for clustering, but unfortunately they have shown disappointing behavior. In this study, a shuffled frog leaping algorithm (LSFLA) is proposed for clustering, where the concept of mixing and chaos is used to raise the accuracy of the algorithm. Because the use of concept of entropy in the fitness functions, we are able to raise the efficiency of the algorithm for clustering. To perform the test, the four sets of real data are used which have been compared with the algorithms K-menas, GA, PSO, CPSO. The results show better performance of this method in the clustering.
Keywords
Sales Forecast; ANFIS; Time Series Analysis; PSO & BPN methods
Statistics
Article View: 1,136
PDF Download: 744
Home | Glossary | News | Aims and Scope | Sitemap
Top Top

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Journal Management System. Designed by sinaweb.