Sep 2026· International journal of pattern recognition and artificial intelligence· 0 citations
TL;DR
Experimental results on some public datasets show that the proposed LRRLM method can build a more discriminative graph and can achieve higher classification accuracy when compared with existing state-of-the-art graph construction methods.
Abstract
Graphs can be applied to graph-based semi-supervised learning and play an important role in data classification tasks. A good graph can reveal the underlying relationships between data and capture hidden structural information. This paper proposes a Low- Rank Representation with Local Manifold (LRRLM) method for graph construction. Low-Rank Representation (LRR) can capture the global structure of data. For capturing the local structure of data, a local constraint term, which utilizes distance metrics to weight the representation coefficients, is integrated into the LRR framework. Furthermore, manifold regularization is also introduced to describe the manifold information between data using the K-nearest neighbors method. An efficient linearized alternating direction technique with adaptive penalty is developed to solve the proposed LRRLM problem. Based on the representation coefficients obtained by the LRRLM, a weighted graph is constructed for semi-supervised classification tasks. Experimental results on some public datasets show that the proposed LRRLM method can build a more discriminative graph and can achieve higher classification accuracy when compared with existing state-of-the-art graph construction methods. Moreover, the LRRLM graph is robust to noise and occlusions that could occur in real-world applications.
Tensor-based multi-view clustering with anchor graphs effectively exploits complementary information across views while reducing computational complexity, leading to impressive results. Existing methods typically impose low-rank constraints to capture global consistency, but often overlook the local smoothness prior in...
Yuxuan Liu, Quan-Xue Gao, Yu Duan et al.· Proceedings of the 34th ACM...· 0 citations
Deep clustering uncovers latent structure in the data, but the number of clusters K is rarely known in advance. Because the true K is unknown, data analysts cluster the data under many candidate values of K and compare the results to find the most reasonable clusters. Many recent deep clustering methods improve accurac...
Yongdam Kim, Sungwon Jung· Proceedings of the 35th ACM...· 0 citations
Tensorized anchor graph-based multi-view clustering (MVC) has shown promising performance on high-dimensional data. However, existing methods generally underexploit latent data structures, while conventional tensor low-rank constraints cannot simultaneously capture intra-view smoothness and inter-view high-order correl...
Ya-Peng Wang, Yu Yun, Quan-Xue Gao et al.· Proceedings of the 34th ACM...· 0 citations
Visualizing and interpreting the dependence structure in relational data often benefits from geometric representations via low-dimensional Euclidean embeddings. However, existing approaches are typically restricted to specific response types, rely on burdensome high-dimensional nonconvex optimization, or lack uniform t...
Multi-view clustering aims to learn a consistent clustering structure by utilizing complementary information across different feature views, but balancing discriminative representation learning and computational efficiency remains challenging. Existing anchor-based tensor methods exploit high-order cross-view correlati...
Extensive experiments demonstrate that USMF outperforms existing state-of-the-art unsupervised feature selection methods in terms of Clustering Accuracy (ACC) and Normalized Mutual Information (NMI).
Guo-Qiu Wen, Xin-Jie Han, Peng-Cheng Liu et al.· Tsinghua Science and Technol...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.