Return to search

A voting-merging clustering algorithm

In this paper we propose an unsupervised voting-merging scheme that is capable of clustering data sets, and also of finding the number of clusters existing in them. The voting part of the algorithm allows us to combine several runs of clustering algorithms resulting in a common partition. This helps us to overcome instabilities of the clustering algorithms and to improve the ability to find structures in a data set. Moreover, we develop a strategy to understand, analyze and interpret these results. In the second part of the scheme, a merging procedure starts on the clusters resulting by voting, in order to find the number of clusters in the data set. / Series: Working Papers 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.002 seconds