Sparse subspace clustering for data with missing entries and high-rank matrix completion-Reference-Cited by-同舟云学术

Sparse subspace clustering for data with missing entries and high-rank matrix completion

Published:2017-09 Issue: Volume:93 Page:36-44
ISSN:0893-6080
Container-title:Neural Networks
language:en
Short-container-title:Neural Networks

Author:

Fan Jicong^ORCID,Chow Tommy W.S.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Cognitive Neuroscience

Reference57 articles.

1. Agarwal, P.K., & Mustafa, N.H. (2004). K-means projective clustering. In Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems (pp. 155–165).

2. A fast iterative shrinkage-Thresholding algorithm for linear inverse problems;Beck;SIAM Journal on Imaging Sciences,2009

3. Bhojanapalli, S., & Jain, P. (2014). Universal matrix completion. In Proceedings of the 31st international conference on machine learning (pp. 1881–1889).

4. Pattern recognition and machine learning;Bishop,2006

5. Distributed optimization and statistical learning via the alternating direction method of multipliers;Boyd;Foundations and Trends in Machine Learning,2011

Cited by 38 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deep graph-level clustering using pseudo-label-guided mutual information maximization network;Neural Computing and Applications;2024-03-07

2. Semi-supervised sparse representation collaborative clustering of incomplete data;Applied Intelligence;2023-12

3. Handling data sparsity via item metadata embedding into deep collaborative recommender system;Journal of King Saud University - Computer and Information Sciences;2022-11

4. Deep Matrix Factorization Based on Convolutional Neural Networks for Image Inpainting;Entropy;2022-10-20

5. Orthogonal matching pursuit with adaptive restriction for sparse subspace clustering;Fourteenth International Conference on Digital Image Processing (ICDIP 2022);2022-10-12