Caricamento...
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...
Salvato in:
| Pubblicato in: | Sensors (Basel) |
|---|---|
| Autori principali: | , , , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
MDPI
2017
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5539778/ https://ncbi.nlm.nih.gov/pubmed/28714886 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/s17071633 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|