The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
A Survey of Dimension Reduction Techniques
Open accessAbstract
Advances in data collection and storage capabilities during the past decades have led to an information overload in most sciences. Researchers working in domains as diverse as engineering, astronomy, biology, remote sensing, economics, and consumer transactions, face larger and larger observations and simulations on a daily basis. Such datasets, in contrast with smaller, more traditional datasets that have been studied extensively in the past, present new challenges in data analysis. Traditional statistical methods break down partly because of the increase in the number of observations, but mostly because of the increase in the number of variables associated with each observation. The dimension of the data, is the number of variables that are measured on each observation. High-dimensional datasets present many mathematical challenges as well as some opportunities, and are bound to give rise to new theoretical developments. One of the problems with high-dimensional datasets is that, in many cases, not all the measured variables are ''important'' for understanding the underlying phenomena of interest. While certain computationally expensive novel methods can construct predictive models with high accuracy from high-dimensional data, it is still of interest in many applications to reduce the dimension of the original data prior to any modeling of the data. In this paper, we described several dimension reduction 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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
(2005) · Statistics for Biology and Health · doi:10.1007/0-387-27255-0_9 · Cited by 20,133
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
Goodall, C. (1988) · Technometrics · doi:10.1080/00401706.1988.10488412 · Cited by 8,675
Jolliffe, I. T. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4757-1904-8 · Cited by 8,273
Brown, R. A., Hastie, T. J., & Tibshirani, R. J. (1991) · Biometrics · doi:10.2307/2532174 · Cited by 8,176
Independent Component Analysis
(2004) · Independent Component Analysis · doi:10.7551/mitpress/3717.003.0014 · Cited by 7,903
Pattern Recognition and Neural Networks
Ripley, B. D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511812651 · Cited by 6,459
Fast and robust fixed-point algorithms for independent component analysis
Hyvarinen, A. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.761722 · Cited by 6,246
A Fast Fixed-Point Algorithm for Independent Component Analysis
Hyvärinen, A., & Oja, E. (1997) · Neural Computation · doi:10.1162/neco.1997.9.7.1483 · Cited by 3,391
A User's Guide to Principal Components
Leigh, S., & Jackson, J. E. (1993) · Technometrics · doi:10.2307/1269292 · Cited by 3,332
Nonlinear principal component analysis using autoassociative neural networks
Kramer, M. A. (1991) · AIChE Journal · doi:10.1002/aic.690370209 · Cited by 3,037
Modern Applied Statistics with S-Plus.
Venables, W. N., & Ripley, B. D. (1996) · Biometrics · doi:10.2307/2532871 · Cited by 2,994
An Introduction to Generalized Linear Models.
Chang, P. C., & Dobson, A. J. (1991) · Journal of the American Statistical Association · doi:10.2307/2290548 · Cited by 2,509
Kohonen, T. (1998) · Neurocomputing · doi:10.1016/s0925-2312(98)00030-7 · Cited by 1,968
Independent Component Analysis: Principles and Practice
(2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511624148 · Cited by 1,917
SURVEY OF INDEPENDENT COMPONENT ANALYSIS
Hyvärinen, A. (1999) · Cited by 1,120
Discrimination and Classification
Loader, C. (1999) · Statistics and Computing · doi:10.1007/0-387-22732-6_8 · Cited by 928
Self organization of a massive document collection
Kohonen, T., Kaski, S., Lagus, K., Salojarvi, J., Honkela, J., Paatero, V., & Saarela, A. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.846729 · Cited by 908
Discarding Variables in a Principal Component Analysis. I: Artificial Data
Jolliffe, I. T. (1972) · Applied Statistics · doi:10.2307/2346488 · Cited by 907
Faloutsos, C., & Lin, K.-I. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223812 · Cited by 897
Principal Component Neural Networks: Theory and Applications
Diamantaras, K., & Kung, S. (1996) · Medical Entomology and Zoology · Cited by 877
Dimensionality reduction using genetic algorithms
Raymer, M. L., Punch, W. F., Goodman, E. D., Kuhn, L. A., & Jain, A. K. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.850656 · Cited by 840
Feature Extraction Construction and Selection: A Data Mining Perspective
MTW, Liu, H., & Motoda, H. (1999) · Journal of the American Statistical Association · doi:10.2307/2669967 · Cited by 713
Independent Component Analysis: Theory and Applications
Lee, T.-W. (2013) · Cited by 705
Ritter, H., & Kohonen, T. (1989) · Biological Cybernetics · doi:10.1007/bf00203171 · Cited by 621
Cox, M. A. A., & Cox, T. F. (2008) · Handbook of Data Visualization · doi:10.1007/978-3-540-33037-0_14 · Cited by 579
Nonlinear independent component analysis: Existence and uniqueness results
Hyvärinen, A., & Pajunen, P. (1999) · Neural Networks · doi:10.1016/s0893-6080(98)00140-3 · Cited by 524
Discarding Variables in a Principal Component Analysis. II: Real Data
Jolliffe, I. T. (1973) · Applied Statistics · doi:10.2307/2346300 · Cited by 394
ON AUTOMATIC FEATURE SELECTION
SIEDLECKI, W., & SKLANSKY, J. (1988) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001488000145 · Cited by 392
Dimensionality reduction by random mapping: fast similarity computation for clustering
Kaski, S. (2002) · 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227) · doi:10.1109/ijcnn.1998.682302 · Cited by 388
Tibshirani, R. (1992) · Statistics and Computing · doi:10.1007/bf01889678 · Cited by 221
A Review of Dimension Reduction Techniques
Carreira-Perpiñán, M. Á. (2009) · Cited by 216
Advances in Independent Component Analysis
(2000) · Perspectives in Neural Computing · doi:10.1007/978-1-4471-0443-8 · Cited by 197
Kohavi, R., & John, G. H. (1998) · Feature Extraction, Construction and Selection · doi:10.1007/978-1-4615-5725-8_3 · Cited by 193
The nonlinear PCA criterion in blind source separation: Relations with other approaches
Karhunen, J., Pajunen, P., & Erkki Oja, A. (1998) · Neurocomputing · doi:10.1016/s0925-2312(98)00046-0 · Cited by 99
Fast Non-Linear Dimension Reduction
Kambhatla, N., Leen, T. K., Kambhatla, A., & Leen, T. K. (n.d.) · Cited by 99
Cited by
A review on machinery diagnostics and prognostics implementing condition-based maintenance
Jardine, A. K. S., Lin, D., & Banjevic, D. (2006) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2005.09.012 · Cited by 4,816
Challenges of Big Data analysis
Fan, J., Han, F., & Liu, H. (2014) · National Science Review · doi:10.1093/nsr/nwt032 · Cited by 1,482
Taskonomy: Disentangling Task Transfer Learning
Zamir, A. R., Sax, A., Shen, W., Guibas, L., Malik, J., & Savarese, S. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00391 · Cited by 1,128
Metaheuristic design of feedforward neural networks: A review of two decades of research
Ojha, V. K., Abraham, A., & Snášel, V. (2017) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2017.01.013 · Cited by 606
Unsupervised Machine Learning for Networking: Techniques, Applications and Research Challenges
Usama, M., Qadir, J., Raza, A., Arif, H., Yau, K.-L. A., Elkhatib, Y., Hussain, A., & Al-Fuqaha, A. (2019) · IEEE Access · doi:10.1109/access.2019.2916648 · Cited by 575
Metadata
- Authors
- Fodor, I. K.
- Published
- 2002-05-09
- OpenAlex
- W1571401318
- Cited by
- 1,116
- References
- 42
- Type
- report
- Language
- en
- Open access
- green
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.