Home
  • English
  • ÄŒeÅ¡tina
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • LatvieÅ¡u
  • Magyar
  • Nederlands
  • Português
  • Português do Brasil
  • Suomi
  • Log In
    New user? Click here to register. Have you forgotten your password?
Home
  • Browse Our Collections
  • Publications
  • Researchers
  • Research Data
  • Institutions
  • Statistics
    • English
    • ÄŒeÅ¡tina
    • Deutsch
    • Español
    • Français
    • Gàidhlig
    • LatvieÅ¡u
    • Magyar
    • Nederlands
    • Português
    • Português do Brasil
    • Suomi
    • Log In
      New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Resources
  3. UniMAP Index Publications
  4. Publications 2023
  5. K-means Algorithm Based on Flower Pollination Algorithm and Calinski-Harabasz Index
 
Options

K-means Algorithm Based on Flower Pollination Algorithm and Calinski-Harabasz Index

Journal
Journal of Physics: Conference Series
ISSN
17426588
Date Issued
2023-01-01
Author(s)
Lim Eng Aik
Universiti Malaysia Perlis
Tan Wee Choon
Universiti Malaysia Perlis
Mohd Syafarudy Abu
Universiti Malaysia Perlis
DOI
10.1088/1742-6596/2643/1/012019
Abstract
Aiming at the problems that the Flower Pollination (FP) algorithm is easy to fall into the local optimum, the searchability is weak, and the k-means algorithm is easily affected by the selection of the initial clustering centre, a k-means algorithm based on the FP algorithm is proposed. Six benchmark functions test the improved FP algorithm. The effectiveness of the k-means algorithm based on the improved FP algorithm was tested and verified with UCI machine learning and artificial datasets. The verification results showed that the improved FP algorithm improved based on ensuring a faster convergence speed. Compared with other algorithms, the performance of this algorithm has been significantly improved in all aspects.
File(s)
research repository notification.pdf (4.4 MB)
google-scholar
Views
Downloads
  • About Us
  • Contact Us
  • Policies