Name
Abstract | ||
|---|---|---|
Contemporary data-intensive applications generate large datasets of very high dimensionality. Data management in high-dimensional spaces presents problems, such as the degradation of query pro- cessing performance, a phenomenon also known as the curse of dimensionality. Dimensionality reduction (DR) tackles this prob- lem, by efficiently embedding data from high dimensional to lower dimensional spaces. However, the large scale and dynamism of generated data calls for methods of low time and space complexity, features that are hardly combined in the majority of existing DR algorithms. Motivated by this fact, in this paper we propose FE- DRA, a fast and efficient dimensionality reduction algorithm that uses a set of landmark points to project data to a lower dimensional Euclidean space. FEDRA is both faster and requires less memory than other comparable algorithms, without compromising the pro- jection's quality. We theoretically assess the quality of the resulting projection and provide a bound for the error induced in pairwise distances. Furthermore, we present two extensions of FEDRA that improve the quality of the projection, suitable for applications that can tolerate higher processing costs. We prove the validity of our claims both theoretically and experimentally, by comparing our al- gorithm against prominent approaches, such as FastMap, LMDS, PCA, SVD and Random Projection. |
Year | Venue | Keywords |
|---|---|---|
2009 | SDM | euclidean space,space complexity,curse of dimensionality,high dimensional data |
Field | DocType | Citations |
Dimensionality reduction,Pattern recognition,Computer science,Algorithm,Curse of dimensionality,Artificial intelligence,Diffusion map,Machine learning | Conference | 3 |
PageRank | References | Authors |
0.39 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Panagis Magdalinos | 1 | 35 | 5.55 |
| Christos Doulkeridis | 2 | 899 | 55.91 |
| Michalis Vazirgiannis | 3 | 3942 | 268.00 |