Abstract

Clustering ensemble aims to obtain final clustering combining multiple diverse clustering solutions. It has already been established as an effective tool to yield a robust, accurate and stable consensus from the input clustering solutions. So far, a spectrum of approaches has already been proposed over the years to generate final ensemble from multiple solutions. One major drawback of most of the existing cluster ensemble approaches is that they require the final number of clusters as an input. In this paper, we propose a multi-objective optimization based algorithm for cluster ensemble problem that optimizes two objective functions simultaneously. The first objective is to maximize the overall similarity of the reference clustering solution to the input solutions, whereas the second objective is to minimize the standard deviation of the similarity values to avoid any bias. Moreover, in this proposed model, there is no need to supply the number of clusters a apriori to apply the algorithm, which is missing in most of the state-of-the-art approaches. The effectiveness of the proposed technique over the existing approaches is demonstrated by applying it on eight real-life datasets.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.