2012
DOI: 10.1007/978-3-642-28487-8_43
|View full text |Cite
|
Sign up to set email alerts
|

Neighborhood Selection and Eigenvalues for Embedding Data Complex in Low Dimension

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…Several methods dealing with this issue have been recently proposed (Saul, 2003;Zhang, 2012;Shao, 2012;Farahmand, 2007;Liou, 2012;Kouropteva, 2002). The number of nearest neighbors k and mapping dimensionality d for NPE are determined based on the normalized training data.…”
Section: Parameter Settingmentioning
confidence: 98%
“…Several methods dealing with this issue have been recently proposed (Saul, 2003;Zhang, 2012;Shao, 2012;Farahmand, 2007;Liou, 2012;Kouropteva, 2002). The number of nearest neighbors k and mapping dimensionality d for NPE are determined based on the normalized training data.…”
Section: Parameter Settingmentioning
confidence: 98%
“…. , x i k ] ∈ R m×k is the k nearest neighbors of x i , the value of k can be determined by the [31]. λ > 0 is a regularization parameter that balances reconstruction error and sparsity,…”
Section: Multiway Sparse Weighted Neighborhood Preserving Embedding (...mentioning
confidence: 99%
“…If we do not know the values in advance, it is critical to specify the optimal [40,[50][51][52][53][54][55]. The first step of NSC-NPE is to identify the neighborhood for each data point.…”
Section: Parameter Settingmentioning
confidence: 99%