{"type":"ScholarlyArticle","title":"An Improved Latent Low Rank Representation for Automatic Subspace Clustering","authors":[{"name":"Ya-nan Han","slug":"ya-nan-han","given":"Ya-nan","family":"Han","affiliation":""},{"name":"Jian-wei Liu","slug":"jian-wei-liu","given":"Jian-wei","family":"Liu","affiliation":""},{"name":"Xiong-lin Luo","slug":"xiong-lin-luo","given":"Xiong-lin","family":"Luo","affiliation":""}],"abstract":"There is growing interest in low rank representation (LRR) for subspace clustering. Existing latent LRR methods can exploit the global structure of data when the observations are insufficient and/or grossly corrupted, but it cannot capture the intrinsic structure due to the neglect of the local information of data. In this paper, we proposed an improved latent LRR model with a distance regularization and a non-negative regularization jointly, which can effectively discover the global and local structure of data for graph learning and improve the expression of the model. Then, an efficiently iterative algorithm is developed to optimize the improved latent LRR model.  In addition,  traditional subspace clustering characterizes a fixed numbers of cluster, which cannot efficiently make model selection. An efficiently automatic subspace clustering is developed via the bias and variance trade-off,  where  the numbers of cluster can be automatically added and discarded on the fly.","doi":"10.24963/ijcai.2020/734","url":"https://ijcai.org/proceedings/2020/734","pdf":"https://ijcai.org/proceedings/2020/0734.pdf","markdown":"https://ijcai.org/proceedings/2020/734.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/734","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Doctoral Consortium","track":"Doctoral Consortium","number":734,"pages":{"first":5188,"last":5189},"keywords":["Constraints and SAT: Constraint Optimization","Machine Learning: Feature Selection; Learning Sparse Models","Machine Learning: Clustering","Computer Vision: Statistical Methods and Machine Learning"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24070/file_24070.m3u8","length_sec":289,"provider":"hls"}],"references":[{"position":1,"raw":"[Lai et al., 2017] Taotao Lai, Hanzi Wang et al. Motion Segmentation Via a Sparsity Constraint. IEEE Trans. Intelligent Transportation Systems,18(4):973-983, 2017.","title":"Motion Segmentation Via a Sparsity Constraint","authors":"Taotao Lai, Hanzi Wang","year":"2017","venue":"IEEE Trans. Intelligent Transportation Systems","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Vidal, 2011] René Vidal. Subspace clustering.IEEE Signal Processing Magazine, 28(2):52-68, 2011.","title":"Subspace clustering","authors":"René Vidal, Vidal","year":"2011","venue":"IEEE Signal Processing Magazine","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Liu et al., 2011] Guangcan Liu, Shuichen Yan. Latent low-rank representation for subspace segmentation and feature extraction, In IEEE International Conference on Computer Vision, 2011, pp. 1615-1622.","title":"Latent low-rank representation for subspace segmentation and feature extraction","authors":"Liu","year":"2011","venue":"IEEE International Conference on Computer Vision","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Zhuang et al., 2017] Zhuang, L., Gao, H., Lin, Z., et al., Non-negative low rank and sparse graph for semisupervised learning.In IEEE Conference on CVPR. IEEE, pp. 2328-2335, 2017.","title":"Non-negative low rank and sparse graph for semisupervised learning","authors":"L Zhuang, H Gao, Z Lin","year":"2017","venue":"IEEE Conference on CVPR","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Jie et al., 2018] Jie Wen, Xiaozhao Fang et al. , Low-rank representation with adaptive graph regularization. Neural Networks, 108: 83-96, 2018.","title":"Low-rank representation with adaptive graph regularization","authors":"Jie Wen, Xiaozhao Fang","year":"2018","venue":"Neural Networks","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Liu et al., 2010] G. Liu, Z. Lin, and Y. Yu, Robust subspace segmentation by low-rank representation, in International Conference of Machine Learning, 2010.","title":"Robust subspace segmentation by low-rank representation","authors":"G Liu, Z Lin, Y Yu","year":"2010","venue":"International Conference of Machine Learning","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Andri et al., 2019] Andri Ashfahani, Mahardhika Pratama, Edwin Lughofer, Yew-Soon Ong: DEVDAN: Deep Evolving Denoising Autoencoder. CoRR, 2019.","title":"DEVDAN: Deep Evolving Denoising Autoencoder","authors":"Andri Ashfahani, Mahardhika Pratama, Edwin Lughofer, Yew-Soon Ong","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}