Cargando…
Non-Convex Sparse and Low-Rank Based Robust Subspace Segmentation for Data Mining
Parsimony, including sparsity and low-rank, has shown great importance for data mining in social networks, particularly in tasks such as segmentation and recognition. Traditionally, such modeling approaches rely on an iterative algorithm that minimizes an objective function with convex l(1)-norm or...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
MDPI
2017
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5539778/ https://www.ncbi.nlm.nih.gov/pubmed/28714886 http://dx.doi.org/10.3390/s17071633 |