In the past decade the development of automatic intrinsic dimensionality estimators has gained considerable attention due to its relevance in several application fields. However, most of the proposed solutions prove to be not robust on noisy datasets, and provide unreliable results when the intrinsic dimensionality of the input dataset is high and the manifold where the points are assumed to lie is nonlinearly embedded in a higher dimensional space. In this paper we propose a novel intrinsic dimensionality estimator (DANCo) and its faster variant (FastDANCo), which exploit the information conveyed both by the normalized nearest neighbor distances and by the angles computed on couples of neighboring points. The effectiveness and robustness of the proposed algorithms are assessed by experiments on synthetic and real datasets, by the comparative evaluation with state-of-the-art methodologies, and by significance tests.

DANCo : an intrinsic dimensionality estimator exploiting angle and norm concentration / C. Ceruti, S. Bassis, A. Rozza, G. Lombardi, E. Casiraghi, P. Campadelli. - In: PATTERN RECOGNITION. - ISSN 0031-3203. - 47:8(2014 Aug), pp. 2569-2581.

DANCo : an intrinsic dimensionality estimator exploiting angle and norm concentration

C. Ceruti;S. Bassis;A. Rozza;G. Lombardi;E. Casiraghi;P. Campadelli
2014

Abstract

In the past decade the development of automatic intrinsic dimensionality estimators has gained considerable attention due to its relevance in several application fields. However, most of the proposed solutions prove to be not robust on noisy datasets, and provide unreliable results when the intrinsic dimensionality of the input dataset is high and the manifold where the points are assumed to lie is nonlinearly embedded in a higher dimensional space. In this paper we propose a novel intrinsic dimensionality estimator (DANCo) and its faster variant (FastDANCo), which exploit the information conveyed both by the normalized nearest neighbor distances and by the angles computed on couples of neighboring points. The effectiveness and robustness of the proposed algorithms are assessed by experiments on synthetic and real datasets, by the comparative evaluation with state-of-the-art methodologies, and by significance tests.
Intrinsic dimensionality estimation; Kullback-Leibler divergence; Manifold learning; Nearest neighbor distance distribution; Von Mises distribution; Software; Artificial Intelligence; 1707; Signal Processing
Settore INF/01 - Informatica
Settore MAT/06 - Probabilita' e Statistica Matematica
ago-2014
Article (author)
File in questo prodotto:
File Dimensione Formato  
1-s2.0-S003132031400065X-main.pdf

accesso riservato

Tipologia: Publisher's version/PDF
Dimensione 794.96 kB
Formato Adobe PDF
794.96 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/241396
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 64
  • ???jsp.display-item.citation.isi??? 51
social impact