Please use this identifier to cite or link to this item:
|Title:||A SimRank based Ensemble Method for Resolving Challenges of Partition Clustering Methods|
|Authors:||Patibandla, R S M Lakshmi|
|Keywords:||Partition clustering;Cluster ensemble;Similarity matrix|
|Abstract:||Traditional clustering techniques alone cannot resolve all challenges of partition-based clustering methods. In the partition based clustering, particularly in variants of K-means, initial cluster centre selection is a significant and crucial point. The dependency of final cluster is totally based on initial cluster centres; hence, this process is delineated to be most significant in the entire clustering operation. The random selection of initial cluster centres is unstable, since different cluster centre points are achieved during each run of the algorithm. Ensemble based clustering methods resolve challenges of partition-based methods. The clustering ensembles join several partitions generated by different clustering algorithms into a single clustering solution. The proposed ensemble methodology resolves initial centroid problems and improves the efficiency of cluster results. This method finds centroid selection through overall mean distance measure. The SimRank based similarity matrix find that the bipartite graph helps to ensemble.|
|ISSN:||0975-1084 (Online); 0022-4456 (Print)|
|Appears in Collections:||JSIR Vol.79(04) [April 2020]|
Items in NOPR are protected by copyright, with all rights reserved, unless otherwise indicated.