In the last few years, multi-view clustering has arisen in a large variety of applications. Properly, the clustering performance is greatly improved by exploiting the rich information among the different views. To this end, we propose a new method which achieve an efficient multi-view clustering of large-scale data. The key idea is to integrate simultaneously the random projection across multiple views in clustering process and applying K-means several times, by increasing the data dimension after each convergence of K-means. Extensive experiments are conducted on a high-dimensional data set to compare the proposed method with a number of mono-view and multi-view baselines methods. Empirical evaluations show the potential and the effectiveness of our method in terms of accuracy, purity and normalized mutual information compared with several improved methods proposed in the literature.
CITATION STYLE
Bettoumi, S., Jlassi, C., & Arous, N. (2018). Multi-view iterative random projections on big data clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10884 LNCS, pp. 215–224). Springer Verlag. https://doi.org/10.1007/978-3-319-94211-7_24
Mendeley helps you to discover research relevant for your work.