An efficient augmented Lagrangian algorithm for graph regularized sparse coding in clustering
文献类型：会议论文
| 作者 | Liu, Qiegen; Ying, Leslie; Liang, Dong |
| 出版日期 | 2013 |
| 会议名称 | 2013 38th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2013 |
| 会议地点 | Vancouver, BC, Canada |
| 英文摘要 | The combination of sparse coding and manifold learning has received much attention recently. However, the computational complexity of the resulting optimization problem hinders its practical application. In this paper, an augmented Lagrangian method is proposed to address this issue, which first transforms the unconstrained problem to an equivalent constrained problem and then an alternating direction method is used to iteratively solve the subproblems. Experimental results validate the effectiveness of the propose algorithm. |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/4919]  |
| 专题 | 深圳先进技术研究院_医工所 |
| 作者单位 | 2013 |
| 推荐引用方式 GB/T 7714 | Liu, Qiegen,Ying, Leslie,Liang, Dong. An efficient augmented Lagrangian algorithm for graph regularized sparse coding in clustering[C]. 见:2013 38th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2013. Vancouver, BC, Canada. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。