-
1
Structured sparse representations for supervised and unsupervised learning
Published 2020“…When a rank constraint is further imposed on the Laplacian of the data graph to enforce the graph's connected components to match a predefined class number, the learned graph exhibits clear cluster structure and is easy to partition. …”
Get full text
Thesis-Doctor of Philosophy