Please use this identifier to cite or link to this item:
|Title:||Forward basis selection for pursuing sparse representations over a dictionary|
|Keywords:||Gaussian graphical models|
|Citation:||Yuan, X.-T., Yan, S. (2013). Forward basis selection for pursuing sparse representations over a dictionary. IEEE Transactions on Pattern Analysis and Machine Intelligence 35 (12) : 3025-3036. ScholarBank@NUS Repository. https://doi.org/10.1109/TPAMI.2013.85|
|Abstract:||The forward greedy selection algorithm of Frank and Wolfe has recently been applied with success to coordinate-wise sparse learning problems, characterized by a tradeoff between sparsity and accuracy. In this paper, we generalize this method to the setup of pursuing sparse representations over a prefixed dictionary. Our proposed algorithm iteratively selects an atom from the dictionary and minimizes the objective function over the linear combinations of all the selected atoms. The rate of convergence of this greedy selection procedure is analyzed. Furthermore, we extend the algorithm to the setup of learning nonnegative and convex sparse representation over a dictionary. Applications of the proposed algorithms to sparse precision matrix estimation and low-rank subspace segmentation are investigated with efficiency and effectiveness validated on benchmark datasets. © 2013 IEEE.|
|Source Title:||IEEE Transactions on Pattern Analysis and Machine Intelligence|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 15, 2018
WEB OF SCIENCETM
checked on May 21, 2018
checked on Apr 21, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.