Discriminant analysis-based cluster ensemble Online publication date: Wed, 06-May-2015
by Vasudha Bhatnagar; Sangeeta Ahuja; Sharanjit Kaur
International Journal of Data Mining, Modelling and Management (IJDMMM), Vol. 7, No. 2, 2015
Abstract: The problem of instability and non-robustness in K-means clustering has been recognised as a serious problem in both scientific and business applications. Further, these problems get accentuated in the presence of outliers in data. Cluster ensemble technique has been recently developed to combat such problems and improve overall quality of clustering scheme. In this paper, we propose a cluster ensemble method based on discriminant analysis to obtain robust clustering and report noise to the user. Clustering schemes are generated by the partitional clustering algorithm (K-means) for constructing the ensemble. The proposed algorithm operates in three phases. During the first phase, input clustering schemes are reconciled by relabeling the clusters corresponding to an arbitrary reference scheme. This is accomplished using Hungarian algorithm, which is a well-known optimisation approach. The second phase uses discriminant analysis and constructs a label matrix that is used for generating consensus partition. In the final stage, clustering scheme is refined to deliver robust and stable clustering scheme. Empirical evaluation of the algorithm shows that the proposed method significantly improves the quality of resultant ensemble. Further, comparison with the cluster ensembles generated by package R for 20 public datasets demonstrated improved quality of ensembles generated by the proposed algorithm.
Online publication date: Wed, 06-May-2015
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining, Modelling and Management (IJDMMM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org