The DOI matches its Crossref record; 141 of the 141 references it cites were found in a registry or an index.
Feature dimensionality reduction: a review
Open accessAbstract
As basic research, it has also received increasing attention from people that the “curse of dimensionality” will lead to increase the cost of data storage and computing; it also influences the efficiency and accuracy of dealing with problems. Feature dimensionality reduction as a key link in the process of pattern recognition has become one hot and difficulty spot in the field of pattern recognition, machine learning and data mining. It is one of the most challenging research fields, which has been favored by most of the scholars’ attention. How to implement “low loss” in the process of feature dimension reduction, keep the nature of the original data, find out the best mapping and get the optimal low dimensional data are the keys aims of the research. In this paper, two-dimensionality reduction methods, feature selection and feature extraction, are introduced; the current mainstream dimensionality reduction algorithms are analyzed, including the method for small sample and method based on deep learning. For each algorithm, examples of their application are given and the advantages and disadvantages of these methods are evaluated.
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.
Integrity signals
Registry
Cites
Statistics
Figures









![Fig. 9 Schematic diagram of ISOMAP algorithm [94]. Note: A : Euclidean distance and Geodesic distance; B : diagrams of adjacent points; C : reduced to two-dimensional data. A Euclidean distance (length of dash line) of the high-dimensional input space and Geodesic distance from low-dimensional manifold (length of solid curve); B the](https://figures.cochat.ai/paper-figures/267ef4ca0c684dae85f2cd0b1794c8d2/feature-dimensionality-reduction-a-review-figure-9.png)
![Fig. 10 Schematic diagram of LLE algorithm [99] . b The sample point (3D) extracted from a , where red and blue can be considered as two types of data. The data ( b ) are mapped to the 2D space ( c ) by the nonlinear dimensionality reduction algorithm LLE. The original data](https://figures.cochat.ai/paper-figures/b9d6292c0bad4f76b5ea9e7d021b80a9/feature-dimensionality-reduction-a-review-figure-10.png)
![Fig. 11 The Transformer architecture [149]. Left is an encoder and right is a decoder](https://figures.cochat.ai/paper-figures/a4650bbf718f45878eed45bd4969c5b5/feature-dimensionality-reduction-a-review-figure-11.png)

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.
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
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474 · cited 1×
“lution and pooling layers to extract high-level semantic information [136].”
BackgroundA Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482 · cited 1×
“The least absolute shrinkage and selection operator (Lasso) is also a compression estimation method with reducing feature quantity as the core [116].”
MethodHe, K., Gkioxari, G., Dollar, P., & Girshick, R. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.322 · Cited by 29,137
Learning Phrase Representations using RNN Encoder–Decoder for Statistical Machine Translation
Cho, K., van Merrienboer, B., Gulcehre, C., Bahdanau, D., Bougares, F., Schwenk, H., & Bengio, Y. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1179 · Cited by 25,545 · cited 1×
“designed a new RNN Encoder-Decoder, containing two recurrent neural networks [147].”
MethodReducing the dimensionality of data with neural networks
Hinton, G. E., & Salakhutdinov, R. R. (2006) · Science · doi:10.1126/science.1127647 · Cited by 20,928
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570 · cited 1×
“It will also promote the further development of deep learning [171–173].”
BackgroundA fast learning algorithm for deep belief nets
Hinton, G. E., Osindero, S., & Teh, Y.-W. (2006) · Neural Computation · doi:10.1162/neco.2006.18.7.1527 · Cited by 16,336 · cited 1×
“In 2006, Hinton pointed out that the difficulty of deep learning network training can be solved by “layer-by-layer initial-ization” [127, 128].”
BackgroundLearning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Research works printed but not linked: 35
- Cunningham JP, Ghahramani Z (2015) Linear dimensionality reduction: survey, insights, and generalizations. J Mach Learn Res 16:2859–2900
- Hu J (2008) Survey on feature dimension reduction for high-dimensional data. Appl Res Comput 25(9):2601–2606
- Welch WJ (1982) Branch-and-bound search for experimental designs based on D optimality and other criteria. Technometrics 24(1):41–48
- Wang JH et al (2016) Analysis of imbalanced weather data based on branch-and-bound approach. Appl Res Comput 33(6):1648–1652
- Mao Y et al (2007) Survey for study of feature selection algorithms. Moshi Shibie yu Rengong Zhineng/Pattern Recogn Artif Intell 20(2):211–218
- Zhang HB, Sun GY (1999) Tabu search algorithm for feature selection. Acta Autom Sin 25(4):457–466
- Zhang X (1998) Dynamic programming method for feature selection. Acta Autom Sin 24:680–684
- Fujarewicz K, Wiench M (2003) Selecting differentially expressed genes for colon tumor classification. Int J Appl Math Comput Sci 13:327–335
- Qiang LI et al (2005) Online palmprint identification based on improved 2D PCA. Acta Electron Sin 33(10):1886–1889
- Huang QH, Wang S, Liu Z (2007) Improved algorithm of image feature extraction based on independent component analysis. Opto-Electron Eng 1:121–125
- Chen Y et al (2018) Application of singular value decomposition algorithm to dimension-reduced clustering analysis of daily load profiles. Automat Electr Power Syst 42(3):105–111
- Mika S et al (1999) Fisher discriminant analysis with kernels. In: Neural networks for signal processing IX: Proceedings of the 1999 IEEE signal processing society workshop (cat. no. 98th8468). IEEE
- ShiZhong L, XiaoJun J, SuLei Z (1999) The application study of entropy analysis method in feature extraction. J North China Inst Technol 20(3):278–281
- Ding S, Jin F, Wang X (2005) Information feature compression algorithm based on SCEC. Mini-micro Syst 26(7):1202–1205
- Zhang J, Zhang B, Jiang X-Z (2000) Analyses of feature extraction methods based on wavelet transform. Signal Process 16(2):156–162
- Yin FP (2012) Based on improved LLE and FSVM method in face recognition of application. Sci Technol Eng 12(34):9390–9395
- He X, Niyogi P (2003) Locality preserving projections. Adv Neural Inf Process Syst 16:153–160
- Shen Z-H, Pan Y-H, Wang S (2008) A supervised locality preserving projection algorithm for dimensionality reduction. Pattern Recogn Artif Intell 21(2):233–239
- Zhan YB (2011) Research on manifold learning theories, methods and applications. Ph.D. thesis of University of Defence Technology
- Ding S et al (2004) New PCA feature compression algorithm based on information theory. Mini-micro Syst 25(4):694–697
- Ding S, Jin F, Wang J (2003) Information feature analysis and selection of orthogonal transformation. Acta Geodaetica Et Cartogr Sin 32(1):73–77
- Huang R (2007) A margin based feature extraction algorithm for the small sample size problem. Chin J Comput 30(7):1173–1178
- Lu J et al (2020) Learning from very few samples: a survey. arXiv preprint arXiv:2009.02653 · arXiv
- Wang Y et al (2020) Generalizing from a few examples: A survey on few-shot learning. ACM Comput Sur (CSUR) 53(3):1–34
- Yi S, Wang X, Tang X (2014) Deep learning face representation by joint identification-verification. Adv Neural Inf Process Syst 27
- Wen W et al (2016) Learning structured sparsity in deep neural networks. Adv Neural Inf Process Syst 29:2074–2082
- Yu K et al (2013) Deep learning: yesterday, today, and tomorrow. J Comput Res Dev 50(9):1799–1804
- Ren S et al (2015) Faster r-cnn: Towards real-time object detection with region proposal networks. Adv Neural Inf Process Syst 28:91–99
- Cui L et al (2020) Context-aware block net for small object detection. IEEE Trans Cybern (Early access), pp 1–14
- Jozefowicz R, Zaremba W, Sutskever I (2015) An empirical exploration of recurrent network architectures. In: International conference on machine learning. PMLR, pp 2342–2350
- Koutnik J et al (2014) A clockwork rnn. In: International conference on machine learning. PMLR, pp 1863–1871
- Ergen T, Mirza AH, Kozat SS (2019) Energy-efficient LSTM networks for online learning. IEEE Trans Neural Netw Learn Syst 99:1–13
- Vaswani A et al (2017) Attention is all you need. In: Advances in neural information processing systems, pp 5998-6008
- Hinton GE, Salakhutdinov RR (2006) Reducing the dimensionality of data with neural networks. Science 313(5786):504–507 · DOI · Paper page
- Lee DH (2013) Pseudo-label: The simple and efficient semi-supervised learning method for deep neural networks. In Workshop on challenges in representation learning, ICML 3(2):896
Cited by
Small data machine learning in materials science
Xu, P., Ji, X., Li, M., & Lu, W. (2023) · npj Computational Materials · doi:10.1038/s41524-023-01000-z · Cited by 866
“In addition to the feature selection, the descriptors of the original high-dimensional space can also be reorganized to reduce the dimensionality by projecting the descriptors of the original high-dimensional space into the low-dimensional space, which is called dimensionality reduction 35,36 .”
BackgroundBoroujeni, S. P. H., Razi, A., Khoshdel, S., Afghah, F., Coen, J. L., O’Neill, L., Fule, P., Watts, A., Kokolakis, N.-M. T., & Vamvoudakis, K. G. (2024) · Information Fusion · doi:10.1016/j.inffus.2024.102369 · Cited by 194
Machine Learning for Perovskite Solar Cells and Component Materials: Key Technologies and Prospects
Liu, Y., Tan, X., Liang, J., Han, H., Xiang, P., & Yan, W. (2023) · Advanced Functional Materials · doi:10.1002/adfm.202214271 · Cited by 174
Machine learning and IoT-based approach for tool condition monitoring: A review and future prospects
Tran, M., Doan, H.-P., Vu, V. Q., & Lien, V. T. (2022) · Measurement · doi:10.1016/j.measurement.2022.112351 · Cited by 171
An extensive review of hyperspectral image classification and prediction: techniques and challenges
Tejasree, G., & Loganathan, A. (2024) · Multimedia Tools and Applications · doi:10.1007/s11042-024-18562-9 · Cited by 138
Metadata
- Authors
- Jia, W., Sun, M., Lian, J., & Hou, S.
- Affiliations
- Shandong Normal University (CN)
- Shandong Management University (CN)
- Corresponding author
- Jia, Weikuan
- Hou, Sujuan
- Venue
- Complex & Intelligent Systems
- Published
- 2022-01-21
- Volume
- 8
- Issue
- 3
- Pages
- 2663-2693
- ISSN
- 2198-6053 (ISSN-L)
- 2199-4536
- OpenAlex
- W4206095984
- Cited by
- 797
- References
- 134
- Citations by year
- 2026: 155 · 2025: 256 · 2024: 242 · 2023: 122 · 2022: 22
- FWCI
- 52.59
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Complex & Intelligent Systems (publishedVersion, cc-by)
- Funders
- National Natural Science Foundation of China (62072289)
- Natural Science Foundation of Shandong Province (ZR2020MF076, ZR2020MF133)
- Focus on Research and Development Plan in Shandong Province (2019GNC106115)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Face and Expression Recognition
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Keywords
- dimensionality reduction, curse of dimensionality, feature selection, feature extraction, pattern recognition
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: Feature dimensionality reduction: a review. https://app.cochat.ai/papers/10.1007/s40747-021-00637-x
- The paper
- Jia, W., Sun, M., Lian, J., & Hou, S. (2022). Feature dimensionality reduction: a review. Complex & Intelligent Systems. https://doi.org/10.1007/s40747-021-00637-x
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.