ONLINE SPARSE SUBSPACE CLUSTERING

被引：0

作者：

Madden, Liam ^{[1
]}

Becker, Stephen ^{[1
]}

Dall'Anese, Emiliano ^{[2
]}

机构：

[1] Univ Colorado Boulder, Dept Appl Math, Boulder, CO 80309 USA

[2] Univ Colorado Boulder, Dept Elect Comp & Energy Engn, Boulder, CO USA

来源：

2019 IEEE DATA SCIENCE WORKSHOP (DSW) | 2019年

关键词：

Subspace clustering; sparse representation; time-varying optimization; online algorithms; OPTIMIZATION;

D O I：

10.1109/dsw.2019.8755556

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper focuses on the sparse subspace clustering problem, and develops an online algorithmic solution to cluster data points on-the-fly, without revisiting the whole dataset. The strategy involves an online solution of a sparse representation (SR) problem to build a (sparse) dictionary of similarities where points in the same subspace are considered "similar," followed by a spectral clustering based on the obtained similarity matrix. When the SR cost is strongly convex, the online solution converges to within a neighborhood of the optimal time-varying batch solution. A dynamic regret analysis is performed when the SR cost is not strongly convex.

引用

页码：248 / 252

页数：5

共 50 条

[41] SPARSE SUBSPACE CLUSTERING WITH MISSING AND CORRUPTED DATA
Charles, Zachary
Jalali, Amin
Willett, Rebecca
[J]. 2018 IEEE DATA SCIENCE WORKSHOP (DSW), 2018, : 180 - 184
[42] Multi-geometric Sparse Subspace Clustering
Wen-Bo Hu
Xiao-Jun Wu
[J]. Neural Processing Letters, 2020, 52 : 849 - 867
[43] Subspace Clustering with Block Diagonal Sparse Representation
Xian Fang
Ruixun Zhang
Zhengxin Li
Xiuli Shao
[J]. Neural Processing Letters, 2021, 53 : 4293 - 4312
[44] Sparse subspace clustering for bearing fault classification
Sun, Chuang
Wang, Bojian
Tian, Shaohua
Chen, Xuefeng
[J]. 2016 10TH INTERNATIONAL CONFERENCE ON SENSING TECHNOLOGY (ICST), 2016,
[45] On Geometric Analysis of Affine Sparse Subspace Clustering
Li, Chun-Guang
You, Chong
Vidal, Rene
[J]. IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2018, 12 (06) : 1520 - 1533
[46] Alternating Direction Method for Sparse Subspace Clustering
Yang Min
[J]. 2015 27TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2015, : 3632 - 3634
[47] Unbiased Sparse Subspace Clustering By Selective Pursuit
Ackermann, Hanno
Rosenhahn, Bodo
Yang, Michael Ying
[J]. 2017 14TH CONFERENCE ON COMPUTER AND ROBOT VISION (CRV 2017), 2017, : 1 - 7
[48] SPARSE SUBSPACE CLUSTERING FOR EVOLVING DATA STREAMS
Sui, Jinping
Liu, Zhen
Liu, Li
Jung, Alexander
Liu, Tianpeng
Peng, Bo
Li, Xiang
[J]. 2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2019, : 7455 - 7459
[49] Subspace Clustering with Block Diagonal Sparse Representation
Fang, Xian
Zhang, Ruixun
Li, Zhengxin
Shao, Xiuli
[J]. NEURAL PROCESSING LETTERS, 2021, 53 (06) : 4293 - 4312
[50] l0-Sparse Subspace Clustering
Yang, Yingzhen
Feng, Jiashi
Jojic, Nebojsa
Yang, Jianchao
Huang, Thomas S.
[J]. COMPUTER VISION - ECCV 2016, PT II, 2016, 9906 : 731 - 747

← 1 2 3 4 5 →