A co-training approach for multi-view density peak clustering

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we propose a multi-view clustering algorithm based on fast search and find of density peaks. We combined the original clustering algorithm with co-training to handle multi-view data and implement self-adapting cluster center selecting through cluster fusion. Based on the assumption that a point would be assigned to the same cluster in all views, we search for the clustering result that agree across the views by continually modifying one view with the clustering from another view. We demonstrate the efficacy of the proposed algorithm on several test cases.

Cite

CITATION STYLE

APA

Ling, Y., He, J., Ren, S., Pan, H., & He, G. (2018). A co-training approach for multi-view density peak clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11258 LNCS, pp. 503–513). Springer Verlag. https://doi.org/10.1007/978-3-030-03338-5_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free