Abstract
An efficient clustering algorithm is proposed in an unsupervised manner to cluster the given data set. This method is based on regulating a similarity measure and replacing movable vectors so that the appropriate clusters are determined by a performance for the classification validity. The proposed clustering algorithm needs not to predetermine the number of clusters, to choose the appropriate cluster centers in the initial step, and to choose a suitable similarity measure according to the shapes of the data. The location of the cluster centers can be efficiently determined and the data can be correctly classified by the proposed method. Several examples are considered to illustrate the effectiveness of the proposed method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.