Return to search

Voting in clustering and finding the number of clusters

In this paper we present an unsupervised algorithm which performs clustering given a data set and which can also find the number of clusters existing in it. This algorithm consists of two techniques. The first, the voting technique, allows us to combine several runs of clustering algorithms, with the number of clusters predefined, resulting in a common partition. We introduce the idea that there are cases where an input point has a structure with a certain degree of confidence and may belong to more than one cluster with a certain degree of "belongingness". The second part consists of an index measure which receives the results of every voting process for diffrent number of clusters and makes the decision in favor of one. This algorithm is a complete clustering scheme which can be applied to any clustering method and to any type of data set. Moreover, it helps us to overcome instabilities of the clustering algorithms and to improve the ability of a clustering algorithm to find structures in a data set. / Series: Report Series SFB "Adaptive Information Systems and Modelling in Economics and Management Science"
Date January 1999
CreatorsDimitriadou, Evgenia, Weingessel, Andreas, Hornik, Kurt
PublisherSFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business
Source SetsWirtschaftsuniversität Wien
Detected LanguageEnglish
TypePaper, NonPeerReviewed

Page generated in 0.0019 seconds