2014
DOI: 10.1016/j.patcog.2014.02.013
|View full text |Cite
|
Sign up to set email alerts
|

DANCo: An intrinsic dimensionality estimator exploiting angle and norm concentration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
96
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 70 publications
(96 citation statements)
references
References 39 publications
0
96
0
Order By: Relevance
“…Hence, this process is implemented empirically by investigating the range of 12 ≤ k ≤ 52 with an interval 1. The parameter α controls the amount to which the class information should be incorporated [32]. Here, 0 ≤ α ≤ 1 with an interval 0.1 is performed.…”
Section: Experiments and Resultsmentioning
confidence: 99%
“…Hence, this process is implemented empirically by investigating the range of 12 ≤ k ≤ 52 with an interval 1. The parameter α controls the amount to which the class information should be incorporated [32]. Here, 0 ≤ α ≤ 1 with an interval 0.1 is performed.…”
Section: Experiments and Resultsmentioning
confidence: 99%
“…3, we display the same analysis for an instance of the dataset C 6,12 (N = 2500), first introduced in [13] and considered a challenging dataset for ID estimation for its high intrinsic curvature. Although a thorough comparison of the performance of our algorithm with state-of-art ID estimators is out of the scope of our investigation (see [18] or [26] for nice recent meta-analysis), we observe that our prediction d 5.9 is pretty accurate (state-of-the-art estimators such as DANCo find d 6.9 on the C 6,12 dataset sampled in the same conditions).…”
Section: Multiscale Fci Estimatormentioning
confidence: 90%
“…CorrDim is very effective for the estimation of low IDs (d 10), whereas it systematically underestimates in the case of manifolds with larger IDs. This drawback is well known in the literature [18] and is only partially mitigated by more recent and advanced generalizations of CorrDim based on k-nearest-neighbors distances [12]. The reason why all these algorithms systematically fail for d 10 is due to a fundamental limitation of most geometric methods: indeed it is possible to prove [24] that the accurate estimation of the ID requires a number of samples N which grows exponentially in the intrinsic dimension d. As a consequence, one observes a systematic undersampling of the small radius region of the density of neighbors ρ X (r), as shown for the CorrDim estimator in the bottom left panel of Fig.…”
Section: Standard Algorithms For Ide and Extreme Locally Undersampledmentioning
confidence: 96%
See 1 more Smart Citation
“…The idea behind local ID estimation is to operate at a scale where the manifold can be approximated by its tangent space [2]. The data contained in each neighbourhood is thus usually assumed to be uniformly distributed over an n-dimensional ball [13], [20]- [22]. In practice, ID proves sensitive to scale and finding an adequate neighbourhood size can be difficult, as it requires finding a trade-off between opposite requirements [1], [24].…”
Section: Dimensionalitymentioning
confidence: 99%