Graph Regularized Double Log-determinant Minimization for Subspace Clustering
Journal of Computer Science and Frontier Technologies · 2025
DOI: 10.63313/jcsft.9008 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computer Science and Frontier Technologies, 2025. Verfasst von Yuang Deng. Die Arbeit nennt 21 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Subspace clustering methods have been successful in various applications such as face clustering. Existing methods usually adopt the l_1 or l_2-based norms to minimize the fitting error. However, the fitting residual constructed with such norms usually has structural information since these norms are computed in an element-wisely independent way and all elements of the residual are treat-ed equally. To maximumly minimize structural information in residual so as to maximumly retain such information in recovered data, in this paper we propose to minimize fitting error of each example with log-determinant rank approxima-tion. Extensive experiments verify the effectiveness of the proposed method.
Zitieren
APA
Deng, Y. (2025). Graph Regularized Double Log-determinant Minimization for Subspace Clustering. Journal of Computer Science and Frontier Technologies. https://doi.org/10.63313/jcsft.9008
Vancouver
Deng Y. Graph Regularized Double Log-determinant Minimization for Subspace Clustering. Journal of Computer Science and Frontier Technologies. 2025. doi:10.63313/jcsft.9008
BibTeX
@article{Deng2025,
author = {Deng, Yuang},
title = {Graph Regularized Double Log-determinant Minimization for Subspace Clustering},
journal = {Journal of Computer Science and Frontier Technologies},
year = {2025},
doi = {10.63313/jcsft.9008}
}
EUVIMED