Matches in SemOpenAlex for { <https://semopenalex.org/work/W4301659200> ?p ?o ?g. }
Showing items 1 to 80 of
80
with 100 items per page.
- W4301659200 abstract "In many real-world problems, we are dealing with collections of high-dimensional data, such as images, videos, text and web documents, DNA microarray data, and more. Often, high-dimensional data lie close to low-dimensional structures corresponding to several classes or categories the data belongs to. In this paper, we propose and study an algorithm, called Sparse Subspace Clustering (SSC), to cluster data points that lie in a union of low-dimensional subspaces. The key idea is that, among infinitely many possible representations of a data point in terms of other points, a sparse representation corresponds to selecting a few points from the same subspace. This motivates solving a sparse optimization program whose solution is used in a spectral clustering framework to infer the clustering of data into subspaces. Since solving the sparse optimization program is in general NP-hard, we consider a convex relaxation and show that, under appropriate conditions on the arrangement of subspaces and the distribution of data, the proposed minimization program succeeds in recovering the desired sparse representations. The proposed algorithm can be solved efficiently and can handle data points near the intersections of subspaces. Another key advantage of the proposed algorithm with respect to the state of the art is that it can deal with data nuisances, such as noise, sparse outlying entries, and missing entries, directly by incorporating the model of the data into the sparse optimization program. We demonstrate the effectiveness of the proposed algorithm through experiments on synthetic data as well as the two real-world problems of motion segmentation and face clustering." @default.
- W4301659200 created "2022-10-05" @default.
- W4301659200 creator A5011256828 @default.
- W4301659200 creator A5088989912 @default.
- W4301659200 date "2012-03-05" @default.
- W4301659200 modified "2023-10-09" @default.
- W4301659200 title "Sparse Subspace Clustering: Algorithm, Theory, and Applications" @default.
- W4301659200 doi "https://doi.org/10.48550/arxiv.1203.1005" @default.
- W4301659200 hasPublicationYear "2012" @default.
- W4301659200 type Work @default.
- W4301659200 citedByCount "0" @default.
- W4301659200 crossrefType "posted-content" @default.
- W4301659200 hasAuthorship W4301659200A5011256828 @default.
- W4301659200 hasAuthorship W4301659200A5088989912 @default.
- W4301659200 hasBestOaLocation W43016592001 @default.
- W4301659200 hasConcept C105611402 @default.
- W4301659200 hasConcept C11413529 @default.
- W4301659200 hasConcept C121332964 @default.
- W4301659200 hasConcept C12362212 @default.
- W4301659200 hasConcept C124066611 @default.
- W4301659200 hasConcept C124101348 @default.
- W4301659200 hasConcept C154771677 @default.
- W4301659200 hasConcept C154945302 @default.
- W4301659200 hasConcept C15744967 @default.
- W4301659200 hasConcept C160920958 @default.
- W4301659200 hasConcept C163716315 @default.
- W4301659200 hasConcept C184509293 @default.
- W4301659200 hasConcept C21080849 @default.
- W4301659200 hasConcept C2524010 @default.
- W4301659200 hasConcept C26517878 @default.
- W4301659200 hasConcept C2776029896 @default.
- W4301659200 hasConcept C32834561 @default.
- W4301659200 hasConcept C33923547 @default.
- W4301659200 hasConcept C38652104 @default.
- W4301659200 hasConcept C41008148 @default.
- W4301659200 hasConcept C56372850 @default.
- W4301659200 hasConcept C62520636 @default.
- W4301659200 hasConcept C73555534 @default.
- W4301659200 hasConcept C77805123 @default.
- W4301659200 hasConceptScore W4301659200C105611402 @default.
- W4301659200 hasConceptScore W4301659200C11413529 @default.
- W4301659200 hasConceptScore W4301659200C121332964 @default.
- W4301659200 hasConceptScore W4301659200C12362212 @default.
- W4301659200 hasConceptScore W4301659200C124066611 @default.
- W4301659200 hasConceptScore W4301659200C124101348 @default.
- W4301659200 hasConceptScore W4301659200C154771677 @default.
- W4301659200 hasConceptScore W4301659200C154945302 @default.
- W4301659200 hasConceptScore W4301659200C15744967 @default.
- W4301659200 hasConceptScore W4301659200C160920958 @default.
- W4301659200 hasConceptScore W4301659200C163716315 @default.
- W4301659200 hasConceptScore W4301659200C184509293 @default.
- W4301659200 hasConceptScore W4301659200C21080849 @default.
- W4301659200 hasConceptScore W4301659200C2524010 @default.
- W4301659200 hasConceptScore W4301659200C26517878 @default.
- W4301659200 hasConceptScore W4301659200C2776029896 @default.
- W4301659200 hasConceptScore W4301659200C32834561 @default.
- W4301659200 hasConceptScore W4301659200C33923547 @default.
- W4301659200 hasConceptScore W4301659200C38652104 @default.
- W4301659200 hasConceptScore W4301659200C41008148 @default.
- W4301659200 hasConceptScore W4301659200C56372850 @default.
- W4301659200 hasConceptScore W4301659200C62520636 @default.
- W4301659200 hasConceptScore W4301659200C73555534 @default.
- W4301659200 hasConceptScore W4301659200C77805123 @default.
- W4301659200 hasLocation W43016592001 @default.
- W4301659200 hasLocation W43016592002 @default.
- W4301659200 hasOpenAccess W4301659200 @default.
- W4301659200 hasPrimaryLocation W43016592001 @default.
- W4301659200 hasRelatedWork W1984110133 @default.
- W4301659200 hasRelatedWork W1993962865 @default.
- W4301659200 hasRelatedWork W2016708865 @default.
- W4301659200 hasRelatedWork W2080431135 @default.
- W4301659200 hasRelatedWork W2215207823 @default.
- W4301659200 hasRelatedWork W2505602116 @default.
- W4301659200 hasRelatedWork W2527399347 @default.
- W4301659200 hasRelatedWork W2952285266 @default.
- W4301659200 hasRelatedWork W3000569786 @default.
- W4301659200 hasRelatedWork W4229079467 @default.
- W4301659200 isParatext "false" @default.
- W4301659200 isRetracted "false" @default.
- W4301659200 workType "article" @default.