Name
Abstract | ||
|---|---|---|
The Johnson-Lindenstrauss lemma allows dimension reduction on real vectors with low distortion on their pairwise Euclidean distances. This result is often used in algorithms such as $k$-means or $k$ nearest neighbours since they only use Euclidean distances, and has sometimes been used in optimization algorithms involving the minimization of Euclidean distances. In this paper we introduce a first attempt at using this lemma in the context of feasibility problems in linear and integer programming, which cannot be expressed only in function of Euclidean distances. |
Year | Venue | Field |
|---|---|---|
2015 | CoRR | Euclidean domain,Discrete mathematics,Combinatorics,Mathematical optimization,Dimensionality reduction,Euclidean distance,Integer programming,Euclidean geometry,Euclidean distance matrix,Lemma (mathematics),Mathematics,Johnson–Lindenstrauss lemma |
DocType | Volume | Citations |
Journal | abs/1507.00990 | 3 |
PageRank | References | Authors |
0.42 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ky Vu | 1 | 3 | 0.76 |
| Pierre-Louis Poirion | 2 | 24 | 7.43 |
| Leo Liberti | 3 | 1280 | 105.20 |