Graph-based multi-view clustering (G-MVC) constructs a graphical representation of each view and then fuses them to unified graph for clustering. Though demonstrating promising performance in various applications, we observe that their formulations are usually non-convex, leading local optimum. In this paper, propose novel MVC algorithm termed robust graph-based (RG-MVC) address issue. particul...

In this paper, the problem of clustering data points that lie near or on a union independent low-dimensional subspaces is addressed. To end, popular spectral clustering-based algorithms usually follow two-stage strategy initially builds an affinity matrix and then applies clustering. However, inappropriate does not sufficiently connect lying same subspace will easily lead to issue over-segmenta...

Abstract Data clustering is an important method used to discover naturally occurring structures in datasets. One of the most popular approaches grid-based concept algorithms. This kind characterized by a fast processing time and it can also clusters arbitrary shapes These properties allow these methods be many different applications. Researchers have created versions using approach. However, ke...