Call for Papers:Vol.11 Issue.3

Submission
Last date		 28-Jun-2025
Acceptance Status In One Day
Paper Publish In Two Days
Submit ManuScript

News & Updates

Submit Article

Dear Authors, Article publish in our journal for Volume-11,Issue-3. For article submission on below link: Submit Manuscript


Join As Board

Dear Reviewer, You can join our Reviewer team without given any charges in our journal. Submit Details on below link: Join As Board


Paper Publication Charges

IJARIIE APP
Download Android App

For Authors

Archives

IJARIIE Board

Downloads

Android App

Download IJARIIE APP

Authors

Title: :  IMPROVEMENT OF INITIAL CENTROIDS IN K MEANS CLUSTERING ALGORITHM
PaperId: :  1968
Published in:   International Journal Of Advance Research And Innovative Ideas In Education
Publisher:   IJARIIE
e-ISSN:   2395-4396
Volume/Issue:    Volume 2 Issue 2 2016
DUI:    16.0415/IJARIIE-1968
Licence: :   IJARIIE is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Author NameAuthor Institute
AVNI GODARA, VARUN SHARMAAMITY UNIVERSITY
varun sharmaAMITY UNIVERSITY

Abstract

K MEANS CLUSTERING, DATAMINING
clustering, k means, prim's algorithm, centroid.
Clustering is an approach of data mining which classifies data according to correspondences and alterations and finds result frequently. Clustering has a method with name partition based clustering which tries to find out similarities and differences between data points with help of calculating distances between data points and relocate them again and again until no relocation is needed , and find accurate results. K means is also a part of partition based clustering, which also use distance measure to find similarities and differences between neighbourhood data points with Euclidean distance measure. The k means clustering algorithm generally consider as iteration based algorithm which used in daily life. The k means clustering algorithm works with spherical type clusters. In k means clustering randomly choose centroids, apply Euclidean distance measure, and form cluster of data points with minimum distance in respect to centroid. But the k means clustering has encountered a dilemma in preliminary centroid selection for the specified dataset. K means is insightful for preliminary centroids because result can vary according these preliminary centroids. The prim’s algorithm makes available an enhancement in k means of giving packed in the dataset and truthful data points as preliminary centroids. This enhanced k means afford better experimental results and better accuracy then classical k means. This enhanced k means provides less iterations comparatively with classical k means clustering. The prim’s algorithm tries to compact a cluster and gives centroids that has maximum probability of become center of that compact cluster and provide less re-allocation of centroids.

Citations

Copy and paste a formatted citation or use one of the links to import into a bibliography manager and reference.

IJARIIE AVNI GODARA, VARUN SHARMA, and varun sharma. "IMPROVEMENT OF INITIAL CENTROIDS IN K MEANS CLUSTERING ALGORITHM" International Journal Of Advance Research And Innovative Ideas In Education Volume 2 Issue 2 2016 Page 1773-1778
MLA AVNI GODARA, VARUN SHARMA, and varun sharma. "IMPROVEMENT OF INITIAL CENTROIDS IN K MEANS CLUSTERING ALGORITHM." International Journal Of Advance Research And Innovative Ideas In Education 2.2(2016) : 1773-1778.
APA AVNI GODARA, VARUN SHARMA, & varun sharma. (2016). IMPROVEMENT OF INITIAL CENTROIDS IN K MEANS CLUSTERING ALGORITHM. International Journal Of Advance Research And Innovative Ideas In Education, 2(2), 1773-1778.
Chicago AVNI GODARA, VARUN SHARMA, and varun sharma. "IMPROVEMENT OF INITIAL CENTROIDS IN K MEANS CLUSTERING ALGORITHM." International Journal Of Advance Research And Innovative Ideas In Education 2, no. 2 (2016) : 1773-1778.
Oxford AVNI GODARA, VARUN SHARMA, and varun sharma. 'IMPROVEMENT OF INITIAL CENTROIDS IN K MEANS CLUSTERING ALGORITHM', International Journal Of Advance Research And Innovative Ideas In Education, vol. 2, no. 2, 2016, p. 1773-1778. Available from IJARIIE, https://ijariie.com/AdminUploadPdf/IMPROVEMENT_OF_INITIAL_CENTROIDS_IN_K_MEANS_CLUSTERING_ALGORITHM_ijariie1968.pdf (Accessed : 11 July 2017).
Harvard AVNI GODARA, VARUN SHARMA, and varun sharma. (2016) 'IMPROVEMENT OF INITIAL CENTROIDS IN K MEANS CLUSTERING ALGORITHM', International Journal Of Advance Research And Innovative Ideas In Education, 2(2), pp. 1773-1778IJARIIE [Online]. Available at: https://ijariie.com/AdminUploadPdf/IMPROVEMENT_OF_INITIAL_CENTROIDS_IN_K_MEANS_CLUSTERING_ALGORITHM_ijariie1968.pdf (Accessed : 11 July 2017)
IEEE AVNI GODARA, VARUN SHARMA, and varun sharma, "IMPROVEMENT OF INITIAL CENTROIDS IN K MEANS CLUSTERING ALGORITHM," International Journal Of Advance Research And Innovative Ideas In Education, vol. 2, no. 2, pp. 1773-1778, Mar-App 2016. [Online]. Available: https://ijariie.com/AdminUploadPdf/IMPROVEMENT_OF_INITIAL_CENTROIDS_IN_K_MEANS_CLUSTERING_ALGORITHM_ijariie1968.pdf [Accessed : 11 July 2017].
Turabian AVNI GODARA, VARUN SHARMA, and varun sharma. "IMPROVEMENT OF INITIAL CENTROIDS IN K MEANS CLUSTERING ALGORITHM." International Journal Of Advance Research And Innovative Ideas In Education [Online]. volume 2 number 2 (11 July 2017).
Vancouver AVNI GODARA, VARUN SHARMA, and varun sharma. IMPROVEMENT OF INITIAL CENTROIDS IN K MEANS CLUSTERING ALGORITHM. International Journal Of Advance Research And Innovative Ideas In Education [Internet]. 2016 [Cited : 11 July 2017]; 2(2) : 1773-1778. Available from: https://ijariie.com/AdminUploadPdf/IMPROVEMENT_OF_INITIAL_CENTROIDS_IN_K_MEANS_CLUSTERING_ALGORITHM_ijariie1968.pdf
BibTex EndNote RefMan RefWorks

Number Of Downloads


Last download on 7/11/2017 10:54:42 PM

Save in Google Drive

Similar-Paper

TitleArea of ResearchAuther NameAction
An Overview of Cybersecurity in Connected and Autonomous Vehicles (CAVs) Computer EngineeringVaishali Kailas Shinde Download
"Lossless Data Hiding in the NTRU Cryptosystem Using Polynomial Encoding and Modulation"Computer EngineeringSanjana Sanjay Udare Download
"Real-Time Forest Fire Detection Using FireNet-CNN and Explainable AI Methods"Computer EngineeringPriyanka Navanath Bale Download
Deep Convolutional Neural Network-Based Recognition of Air-WritingComputer Engineering Dhongde.V.S Download
Medical Assistance Chatbot using Artificial Intelligence and Machine LearningComputer Engineering Shaikh Akhil Shadul Pasha Download
AGRICARD: ONE PLATFORM FOR ALL AGRICUTURAL NEEDSComputer Engineering Patil Kalpesh Prashant Download
CHANGE DETECTION APPROACH FOR DETECTING DEFORESTATIONComputer EngineeringAbhishek Kailas Tekale Download
Transforming Rural Administration Through Digital Innovation: The E-Gram Panchayat ApproachComputer EngineeringMiss. Mali Mansi Kishor Download
AI-Augmented Systems for Medication AdherenceComputer scienceSushritha Harthi H.Y Download
AI-Based Analytics for Chronic Obstructive Pulmonary DiseaseComputer scienceAnusha B.C Download
Dynamic AI Models for Real-Time ICU MonitoringComputer scienceMouna Shree Gowda Download
Predictive AI Models for Emergency Room TriageComputer scienceAkshatha H.U Download
AI for Monitoring Neonatal Intensive Care UnitsComputer scienceDimple M.D Download
The Concept of AI-Enhanced Mental Health Analysis Through social mediaComputer scienceVarsha S Download
Enhancing Cardiovascular Disease Prediction Accurancy Through Optimized Machine Learning Techniquecomputer engineeringRajan Raman Download
12