Abstract
Consensus clustering is a well studied methodology to find partitions through the combination of different formulations or clustering partitions. Different approaches for dealing with this issue using graph clustering have been proposed. Additionally, strategies to find consensus partitions by using graph-based ensemble algorithms have attracted a good deal of attention lately. A particular class of graph clustering algorithms based on spectral theory, named spectral clustering algorithms, has been successfully used in several clustering applications. However, in spite of this, few ensemble approaches based on spectral theory has been investigated. This paper proposes a consensus clustering algorithm based on spectral clustering. Preliminary results presented in this paper show the good potential of the proposed approach.
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 callDisclaimer: 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.
