3260 papers • 126 benchmarks • 313 datasets
This task has no description! Would you like to contribute one?
(Image credit: Papersgraph)
These leaderboards are used to track progress in clustering-ensemble-10
Use these libraries to find clustering-ensemble-10 models and implementations
No subtasks available.
It is demonstrated that the choice of random model can have a drastic impact on the ranking of similar clustering pairs, and the evaluation of a clustering method with respect to a random baseline; thus, the choices of random clustering model should be carefully justified.
A new robust distance measure, one into which density is incorporated, is designed to solve the problem, and an internal validity index based on this separation measure is then proposed, which can cope with both the spherical and non-spherical structure of clusters.
A novel low-rank tensor approximation based method to solve the problem of clustering ensemble from a global perspective, which is fundamentally different from previous approaches and achieves a breakthrough in clustering performance, compared with 12 state-of-the-art methods.
This paper removes multiple level evidences having low occurrence frequencies from the co-association matrix, and uses normalized cut to achieve multiple clustering results, demonstrating that the proposed scheme outperforms some state-of-the-art clustering ensemble approaches.
Adding a benchmark result helps the community track progress.