2014
DOI: 10.48550/arxiv.1409.5009
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Distance Shrinkage and Euclidean Embedding via Regularized Kernel Estimation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…]. This would be easily solved (if a solution exists) using the tools of multidimensional scaling [7] if not for the condition that each α(i, •) must be nonnegative and sum to m. We are exploring possible approximation approaches for this problem, including alternately projecting onto the cone of distance matrices [58] and the polytope defining the constraints on the α's. An approximate solution for this is essential, as it would allow us to use the generalized omnibus framework to induce a given correlation structure in embedded space.…”
Section: Discussionmentioning
confidence: 99%
“…]. This would be easily solved (if a solution exists) using the tools of multidimensional scaling [7] if not for the condition that each α(i, •) must be nonnegative and sum to m. We are exploring possible approximation approaches for this problem, including alternately projecting onto the cone of distance matrices [58] and the polytope defining the constraints on the α's. An approximate solution for this is essential, as it would allow us to use the generalized omnibus framework to induce a given correlation structure in embedded space.…”
Section: Discussionmentioning
confidence: 99%