The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Low-Rank Preserving Projection Via Graph Regularized Reconstruction
Abstract
Preserving global and local structures during projection learning is very important for feature extraction. Although various methods have been proposed for this goal, they commonly introduce an extra graph regularization term and the corresponding regularization parameter that needs to be tuned. However, tuning the parameter manually not only is time-consuming, but also is difficult to find the optimal value to obtain a satisfactory performance. This greatly limits their applications. Besides, projections learned by many methods do not have good interpretability and their performances are commonly sensitive to the value of the selected feature dimension. To solve the above problems, a novel method named low-rank preserving projection via graph regularized reconstruction (LRPP_GRR) is proposed. In particular, LRPP_GRR imposes the graph constraint on the reconstruction error of data instead of introducing the extra regularization term to capture the local structure of data, which can greatly reduce the complexity of the model. Meanwhile, a low-rank reconstruction term is exploited to preserve the global structure of data. To improve the interpretability of the learned projection, a sparse term with${l_{2,1}}$norm is imposed on the projection. Furthermore, we introduce an orthogonal reconstruction constraint to make the learned projection hold main energy of data, which enables LRPP_GRR to be more flexible in the selection of feature dimension. Extensive experimental results show the proposed method can obtain competitive performance with other state-of-the-art methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Turk, M., & Pentland, A. (1991) · Journal of Cognitive Neuroscience · doi:10.1162/jocn.1991.3.1.71 · Cited by 13,733
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Sparse Principal Component Analysis
Zou, H., Hastie, T., & Tibshirani, R. (2006) · Journal of Computational and Graphical Statistics · doi:10.1198/106186006x113430 · Cited by 3,152
Cited by
An Improved Ant Colony Optimization Algorithm Based on Hybrid Strategies for Scheduling Problem
Deng, W., Xu, J., & Zhao, H. (2019) · IEEE Access · doi:10.1109/access.2019.2897580 · Cited by 560
Incomplete Multiview Spectral Clustering With Adaptive Graph Learning
Wen, J., Xu, Y., & Liu, H. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2884715 · Cited by 390
Self-citationGeneralized Incomplete Multiview Clustering With Flexible Locality Structure Diffusion
Wen, J., Zhang, Z., Zhang, Z., Fei, L., & Wang, M. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2987164 · Cited by 305
Self-citation
Metadata
- Authors
- Wen, J., Han, N., Fang, X., Fei, L., Yan, K., & Zhan, S.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2019-04
- Volume
- 49
- Issue
- 4
- Pages
- 1279-1291
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2792991240
- Cited by
- 179
- References
- 4
- FWCI
- 9.35
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Low-Rank Preserving Projection Via Graph Regularized Reconstruction. https://app.cochat.ai/papers/10.1109/tcyb.2018.2799862
- The paper
- Wen, J., Han, N., Fang, X., Fei, L., Yan, K., & Zhan, S. (2019). Low-Rank Preserving Projection Via Graph Regularized Reconstruction. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2018.2799862
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.