A Modified Version of the K-means Clustering Algorithm

α
Juhi Katara
Juhi Katara
σ
Naveen Choudhary
Naveen Choudhary
α Maharana Pratap University of Agriculture and Technology Maharana Pratap University of Agriculture and Technology

Send Message

To: Author

A Modified Version of the K-means Clustering Algorithm

Article Fingerprint

ReserarchID

CSTSDE333S8

A Modified Version of the K-means Clustering Algorithm Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

Clustering is a technique in data mining which divides given data set into small clusters based on their similarity. K-means clustering algorithm is a popular, unsupervised and iterative clustering algorithm which divides given dataset into k clusters. But there are some drawbacks of traditional k-means clustering algorithm such as it takes more time to run as it has to calculate distance between each data object and all centroids in each iteration. Accuracy of final clustering result is mainly depends on correctness of the initial centroids, which are selected randomly. This paper proposes a methodology which finds better initial centroids further this method is combined with existing improved method for assigning data objects to clusters which requires two simple data structures to store information about each iteration, which is to be used in the next iteration. Proposed algorithm is compared in terms of time and accuracy with traditional k-means clustering algorithm as well as with a popular improved k-means clustering algorithm.

References

11 Cites in Article
  1. Xiuyun Li,Jie Yang,Qing Wang,Jinjin Fan,Peng Liu (2008). Research and Application of Improved K-Means Algorithm Based on Fuzzy Feature Selection.
  2. K Abdul Nazeer,M Sebastian (2009). Improving the accuracy and efficiency of the k-means clustering algorithm.
  3. Na Shi,Guan Liu Xumin,Yong Research on kmeans Clustering Algorithm : An Improved k-means Clustering Algorithm.
  4. Mohammed Agha,M Wesam,Ashour (2012). Efficient and Fast Initialization Algorithm for K-means Clustering.
  5. Wang Shunye,Cui Yeqin,Jin Zuotao,Liu Xinyuan (2013). K-means algorithm in the optimal initial centroids based on dissimilarity.
  6. Charles Elkan (2003). Using the Triangle Inequality to Accelerate k-Means.
  7. Hong Liu,Xiaohong Yu (2009). Application Research of k-means Clustering Algorithm in Image Retrieval System.
  8. Jiawei Han,Michelinekamber,Morgan Kauffman (2006). Data Mining: Concepts and Techniques.
  9. Osama Abu,Abbas (2008). Comparisons between data clustering algorithms.
  10. J Oyeladeo,O Oladipupo,I Obagbuwa (2010). Application of k-Means Clustering algorithm for prediction of Students Academic Performance.
  11. Chunfei Zhang,Zhiyi Fang (2013). An Improved K-means Clustering Algorithm.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Juhi Katara. 2015. \u201cA Modified Version of the K-means Clustering Algorithm\u201d. Global Journal of Computer Science and Technology - C: Software & Data Engineering GJCST-C Volume 15 (GJCST Volume 15 Issue C7): .

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-C Classification: B.2.4, B.7.1
Version of record

v1.2

Issue date

November 6, 2015

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 8300
Total Downloads: 2073
2026 Trends
Related Research

Published Article

Clustering is a technique in data mining which divides given data set into small clusters based on their similarity. K-means clustering algorithm is a popular, unsupervised and iterative clustering algorithm which divides given dataset into k clusters. But there are some drawbacks of traditional k-means clustering algorithm such as it takes more time to run as it has to calculate distance between each data object and all centroids in each iteration. Accuracy of final clustering result is mainly depends on correctness of the initial centroids, which are selected randomly. This paper proposes a methodology which finds better initial centroids further this method is combined with existing improved method for assigning data objects to clusters which requires two simple data structures to store information about each iteration, which is to be used in the next iteration. Proposed algorithm is compared in terms of time and accuracy with traditional k-means clustering algorithm as well as with a popular improved k-means clustering algorithm.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

A Modified Version of the K-means Clustering Algorithm

Juhi Katara
Juhi Katara Maharana Pratap University of Agriculture and Technology
Naveen Choudhary
Naveen Choudhary

Research Journals