.png){kind=icon}
.png){kind=icon}
Return
Random projections: Data perturbation for classification problems
.png){kind=icon}
OA
AI
DOI：10.1002/wics.1499.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Random projections offer an appealing and flexible approach to a wide range of large-scale statistical problems. They are particularly useful in high-dimensional settings, where we have many covariates recorded for each observation. In classification problems, there are two general techniques using random projections. The first involves many projections in an ensemble-the idea here is to aggregate the results after applying different random projections, with the aim of achieving superior statistical accuracy. The second class of methods include hashing and sketching techniques, which are straightforward ways to reduce the complexity of a problem, perhaps therefore with a huge computational saving, while approximately preserving the statistical efficiency. This article is categorized under: Statistical Learning and Exploratory Methods of the Data Sciences > Clustering and Classification Statistical and Graphical Methods of Data Analysis > Analysis of High Dimensional Data Statistical Models > Classification Models
Keywords:
classification
data perturbation
ensemble
high dimensional
large scale
random projection
sketching
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
W
IF:
5.4
Papers:
201
Citations:
5.1K