CoChat

Structured optimal graph based sparse feature extraction for semi-supervised learning

Liu, Zhonghua, Lai, Zhihui, Ou, Weihua, Zhang, Kaibing, Zheng, Ruijuan · 2020 · Signal Processing
Cited by 143

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

Abstract Graph-based feature extraction is an efficient technique for data dimensionality reduction, and it has gained intensive attention in various fields such as image processing, pattern recognition, and machine learning. However, conventional graph-based dimensionality reduction algorithms usually depend on a fixed weight graph called similarity matrix, which seriously affects the subsequent feature extraction process. In this paper, a novel structured optimal graph based sparse feature extraction (SOGSFE) method for semi-supervised learning is proposed. In the proposed method, the local structure learning, sparse representation, and label propagation are simultaneously framed to perform data dimensionality reduction. In particular the similarity matrix and the projection matrix are obtained by an iterative calculation manner. The experimental results on several public image datasets demonstrate the robustness and effectiveness of the proposed method.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.sigpro.2020.107456

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 30

  1. Liu, 2019, Discriminative low-rank preserving projection for dimensionality reduction., Applied Soft Computing, 85, 105768, 10.1016/j.asoc.2019.105768 · DOI
  2. L., 2018, On better exploring and exploiting task relationships in multitask learning: joint model and feature learning, IEEE Trans. Neural Netw. Learn. Syst., 29, 1975, 10.1109/TNNLS.2017.2690683 · DOI
  3. Luo, 2018, Adaptive unsupervised feature selection with structure regularization, IEEE Trans. Neural Netw. Learn. Syst., 29, 944, 10.1109/TNNLS.2017.2650978 · DOI · Paper page
  4. Taibi, 2019, Robust reservoir rock fracture recognition based on a new sparse feature learning and data training method, Multidimension. Syst. Signal Process., 10.1007/s11045-019-00645-8 · doi:10.1007/s11045-019-00645-8
  5. Akbarizadeh, 2012, A new statistical-based kurtosis wavelet energy feature for texture recognition of SAR images, IEEE Trans. Geosci. Remote Sens., 50, 4358, 10.1109/TGRS.2012.2194787 · DOI · Paper page
  6. Sharifzadeh, 2019, Ship classification in SAR Images using a new hybrid CNN-MLP classifier, J. Indian Soc. Remote Sens., 47, 551, 10.1007/s12524-018-0891-y · DOI · Paper page
  7. Sellami, 2019, Hyperspectral imagery classification based on semi-supervised 3-D deep neural network and adaptive band selection, Expert Syst. Appl., 129, 246, 10.1016/j.eswa.2019.04.006 · DOI
  8. Modava, 2017, Coastline extraction from SAR images using spatial fuzzy clustering and the active contour method, Int. J. Remote Sens., 38, 355, 10.1080/01431161.2016.1266104 · DOI
  9. Roweis, 2000, Nonlinear dimensionality reduction by locally linear embedding, Science, 290, 2323, 10.1126/science.290.5500.2323 · DOI · Paper page
  10. Belkin, 2003, Laplacian eigenmaps for dimensionality reduction and data representation, Neural Comput., 15, 1373, 10.1162/089976603321780317 · DOI · Paper page
  11. Yu, 2019, Learning a local manifold representation based on improved neighborhood rough set and LLE for hyperspectral dimensionality reduction, Signal Process., 164, 20, 10.1016/j.sigpro.2019.05.034 · doi:10.1016/j.sigpro.2019.05.034
  12. Yang, 2015, A collaborative representation based projections method for feature extraction, Pattern Recognit., 48, 20, 10.1016/j.patcog.2014.07.009 · DOI · Paper page
  13. Zhang, 2012, Adaptive manifold learning, IEEE Trans. Pattern Anal. Mach. Intell., 34, 253, 10.1109/TPAMI.2011.115 · DOI · Paper page
  14. Zhang, 2019, Manifold regularized discriminative feature selection for multi-label learning, Pattern Recognit., 95, 136, 10.1016/j.patcog.2019.06.003 · DOI · Paper page
  15. He, 2005, Face recognition using Laplacian faces, IEEE Trans. Pattern Anal. Mach. Intell., 27, 328, 10.1109/TPAMI.2005.55 · DOI · Paper page
  16. Lai, 2018, Robust discriminant regression for feature extraction, IEEE Trans. Cybernet., 48, 2472, 10.1109/TCYB.2017.2740949 · DOI
  17. Lu, 2016, Low-rank preserving projections, IEEE Trans. Cybernet., 46, 1900, 10.1109/TCYB.2015.2457611 · DOI
  18. Jing, 2019, Low-rank regularized tensor discriminant representation for image set classification, Signal Process., 156, 62, 10.1016/j.sigpro.2018.10.018 · DOI
  19. Wright, 2009, Robust face recognition via sparse representation, IEEE Trans. Pattern Anal. Mach. Intell., 31, 210, 10.1109/TPAMI.2008.79 · DOI · Paper page
  20. Xu, 2016, Discriminative transfer subspace learning via low-rank and sparse representation, IEEE Trans. Image Process., 25, 850, 10.1109/TIP.2015.2510498 · DOI · Paper page
  21. Peng, 2015, Enhanced low-rank representation via sparse manifold adaption for semi-supervised learning, Neural Netw., 65, 1, 10.1016/j.neunet.2015.01.001 · doi:10.1016/j.neunet.2015.01.001
  22. Zeng, 2019, Local adaptive learning for semi-supervised feature selection with group sparsity, Knowl.-Based Syst., 181, 10.1016/j.knosys.2019.05.030 · doi:10.1016/j.knosys.2019.05.030
  23. Lunga, 2014, Manifold-learning-based feature extraction for classification of hyperspectral data, IEEE Signal Process. Mag., 31, 55, 10.1109/MSP.2013.2279894 · DOI · Paper page
  24. Xu, 2014, Modified minimum squared error algorithm for robust classification and face recognition experiments, Neurocomputing, 135, 253, 10.1016/j.neucom.2013.11.025 · doi:10.1016/j.neucom.2013.11.025
  25. Xiang, 2012, Discriminative least squares regression for multiclass classification and feature selection, IEEE Trans. Neural Netw. Learn. Syst., 23, 1738, 10.1109/TNNLS.2012.2212721 · DOI · Paper page
  26. Liu, 2017, Noisy label based discriminative least squares regression and its kernel extension for object identification, KSII Trans. Internet. Inf. Syst., 11, 2523
  27. Jonathon Phillips, 1998, The FERET database and evaluation procedure for face-recognition algorithms, Image Vision Comput., 16, 295, 10.1016/S0262-8856(97)00070-X · DOI · Paper page
  28. Xu, 2014, Integrating conventional and inverse representation for face recognition, IEEE Trans Cybernet, 44, 1738, 10.1109/TCYB.2013.2293391 · DOI
  29. Maaten, 2008, Visualizing data using t-sne, J. Mach. Learn. Res., 9, 2579
  30. Wen, 2018, Inter-class sparsity based discriminative least square regression, Neural Netw., 102, 36, 10.1016/j.neunet.2018.02.002 · DOI · Paper page

Cited by

See all 143

Metadata

Authors
Liu, Z., Lai, Z., Ou, W., Zhang, K., & Zheng, R.
Venue
Signal Processing
Publisher
Elsevier BV
Published
2020-05
Volume
170
Pages
107456
ISSN
0165-1684 (ISSN-L)
OpenAlex
W2999814961
Cited by
143
References
1
FWCI
11.58
Type
journal article
Language
en
Open access
closed
Licence
  • www.elsevier.com/tdm/userlicense/1.0/ (tdm)
  • www.elsevier.com/legal/tdmrep-license (tdm)
Funders
National Natural Science Foundation of China

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

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.