2015
DOI: 10.1016/j.acha.2014.05.002
|View full text |Cite
|
Sign up to set email alerts
|

Approximately-isometric diffusion maps

Abstract: Diffusion Maps (DM), and other kernel methods, are utilized for the analysis of high dimensional datasets. The DM method uses a Markovian diffusion process to model and analyze data. A spectral analysis of the DM kernel yields a map of the data into a low dimensional space, where Euclidean distances between the mapped data points represent the diffusion distances between the corresponding high dimensional data points. Many machine learning methods, which are based on the Euclidean metric, can be applied to the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
17
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
5
1

Relationship

4
2

Authors

Journals

citations
Cited by 13 publications
(17 citation statements)
references
References 30 publications
0
17
0
Order By: Relevance
“…To test this hypothesis, we applied a previously published sampling technique to our PhEMD embedding [18]. The sampling technique used incompletely pivoted QR decomposition to identify "landmark points" (inhibition or control conditions) that approximately spanned the subspace of the single-cell sample embedding (Online Methods).…”
Section: Imputing the Effects Of Inhibitors Based On A Small Measuredmentioning
confidence: 99%
See 2 more Smart Citations
“…To test this hypothesis, we applied a previously published sampling technique to our PhEMD embedding [18]. The sampling technique used incompletely pivoted QR decomposition to identify "landmark points" (inhibition or control conditions) that approximately spanned the subspace of the single-cell sample embedding (Online Methods).…”
Section: Imputing the Effects Of Inhibitors Based On A Small Measuredmentioning
confidence: 99%
“…To assess whether the network geometry of all 300 inhibition and control conditions could be captured using a smaller subset of conditions, we applied a previously published sampling technique for identifying landmark points of an embedding [18]. First, the PhEMD distance matrix containing pairwise distances between our 300 experimental conditions was converted to an affinity matrix…”
Section: Imputing the Effects Of Inhibitions Based On A Small Measurementioning
confidence: 99%
See 1 more Smart Citation
“…The labeling of each test data point was determined by using the label of the nearest training data point where the pairwise distance was computed by the Frobenius norm of the difference between the corresponding embedded tensors. The software-based implementation of the PTEA algorithm is described in Salhov et al (2015).…”
Section: Example I: Mnist Handwritten Digit Classificationmentioning
confidence: 99%
“…First, one can use a small training set, which is either sampled from the entire data, or selected using dictionary construction (e.g. [13,26]), to alleviate the aforementioned computational limitations of DM. In this approach, the DM kernel and embedding are computed over the training set, and then extended, via interpolation, to the rest of the data, using out-of-sample methods such as [7,2,24].…”
Section: Introductionmentioning
confidence: 99%