2015 | OriginalPaper | Chapter
Neighborhood Selection for Dimensionality Reduction
Authors : Paola Campadelli, Elena Casiraghi, Claudio Ceruti
Published in: Image Analysis and Processing — ICIAP 2015
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Though a great deal of research work has been devoted to the development of dimensionality reduction algorithms, the problem is still open. The most recent and effective techniques, assuming datasets drawn from an underlying low dimensional manifold embedded into an high dimensional space, look for “small enough” neighborhoods which should represent the underlying manifold portion. Unfortunately, neighborhood selection is an open problem, for the presence of noise, outliers, points not uniformly distributed, and to unexpected high manifold curvatures, causing the inclusion of geodesically distant points in the same neighborhood. In this paper we describe our neighborhood selection algorithm, called
ONeS
; it exploits both distance and angular information to form neighborhoods containing nearby points that share a common local structure in terms of curvature. The reported experimental results show the enhanced quality of the neighborhoods computed by
ONeS
w.r.t. the commonly used
k
-neighborhoods solely employing the euclidean distance.