LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Multi-geometric Sparse Subspace Clustering

Photo from archive.org

Recently, the Riemannian manifold has received special attention in unsupervised clustering since the real-world visual data usually resides on a special manifold where Euclidean geometry fails to capture. Although many… Click to show full abstract

Recently, the Riemannian manifold has received special attention in unsupervised clustering since the real-world visual data usually resides on a special manifold where Euclidean geometry fails to capture. Although many clustering algorithms have been proposed, most of them use only a single geometric model to describe the data. In this paper, a multi-geometric subspace clustering model is proposed, and the subspace representation is learned together by constructing a shared affinity matrix of multi-order data. Experimental results on several different types of datasets show that the clustering performance of our proposed algorithm is better than most of subspaces algorithms.

Keywords: subspace clustering; multi geometric; geometry; sparse subspace; geometric sparse

Journal Title: Neural Processing Letters
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.