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

Entropy-based active sparse subspace clustering

Photo by roberto_sorin from unsplash

Sparse Subspace Clustering (SSC) is widely used in data mining and machine learning. Some studies have been developed to add pairwise constraints as side information to improve the clustering results.… Click to show full abstract

Sparse Subspace Clustering (SSC) is widely used in data mining and machine learning. Some studies have been developed to add pairwise constraints as side information to improve the clustering results. However, most of these algorithms are “passive” in the sense that the side information is provided beforehand. In this paper, we propose a novel extension for SSC with active learning framework, in which we aim to select the most informative pairwise constraints to guide the SSC for accurate clustering results. Specifically, in the first step, an entropy-based query strategy is proposed to select the most uncertain pairwise constraints. Next, constrained sparse subspace clustering algorithms are followed to integrate the selected pairwise constraints and obtain the final clustering results. Two steps are effectively performed in an iterative manner until satisfactory results are achieved. Experimental results on two face datasets clustering well demonstrate the effectiveness of the proposed method.

Keywords: pairwise constraints; entropy based; sparse subspace; subspace clustering

Journal Title: Multimedia Tools and Applications
Year Published: 2018

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.