Overview and comparative study of dimensionality reduction techniques for high dimensional data

被引:323
作者
Ayesha, Shaeela [1 ]
Hanif, Muhammad Kashif [1 ]
Talib, Ramzan [1 ]
机构
[1] Govt Coll Univ, Dept Comp Sci, Faisalabad, Pakistan
关键词
Dimensionality reduction; Features; High dimensional data; Linear techniques; Nonlinear techniques; PRINCIPAL COMPONENT ANALYSIS; LOCALITY PRESERVING PROJECTIONS; SELF-ORGANIZING MAPS; LINEAR DISCRIMINANT-ANALYSIS; LEARNING VECTOR QUANTIZATION; LATENT SEMANTIC ANALYSIS; TEXT MINING TECHNIQUES; FEATURE-EXTRACTION; MIXTURE MODEL; PURSUIT;
D O I
10.1016/j.inffus.2020.01.005
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The recent developments in the modern data collection tools, techniques, and storage capabilities are leading towards huge volume of data. The dimensions of data indicate the number of features that have been measured for each observation. It has become a challenging task to analyze high dimensional data. Different dimensionality reduction techniques are available in literature to eliminate irrelevant and redundant features. Selection of an appropriate dimension reduction technique can help to enhance the processing speed and reduce the time and effort required to extract valuable information. This paper presents the state-of-the art dimensionality reduction techniques and their suitability for different types of data and application areas. Furthermore, the issues of dimensionality reduction techniques have been highlighted that can affect the accuracy and relevance of results.
引用
收藏
页码:44 / 58
页数:15
相关论文
共 253 条
[21]  
[Anonymous], J ELECT INF TECHNOL
[22]  
[Anonymous], ARXIV180202341
[23]  
[Anonymous], 2017, SINGULAR VALUE DECOM
[24]  
[Anonymous], ARXIV170407790
[25]  
[Anonymous], ARXIV180400341
[26]  
[Anonymous], J COMPUT GRAPHICAL S
[27]  
[Anonymous], THESIS
[28]  
[Anonymous], INT C COMP TECHN INT
[29]  
[Anonymous], 2007, IEEE INT C INF COMM
[30]  
[Anonymous], ARXIV180103754