Abstract
Clustering method is divided into hierarchical clustering, partitioning clustering, and more. K-Means algorithm is one of partitioning clustering methods and is adequate to cluster a lot of data rapidly and easily. The problem is it is too dependent on initial centers of clusters and needs the time of allocation and recalculation. We compare random method, max average distance method and triangle height method for selecting initial seeds in KMeans algorithm. It reduces total clustering time by minimizing the number of allocation and recalculation.
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Database Theory and Application
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
