DocumentCode
3499351
Title
Tangent space guided intelligent neighbor finding
Author
Gashler, Mike ; Martinez, Tony
Author_Institution
Dept. of Comput. Sci., Brigham Young Univ., Provo, UT, USA
fYear
2011
fDate
July 31 2011-Aug. 5 2011
Firstpage
2617
Lastpage
2624
Abstract
We present an intelligent neighbor-finding algorithm called SAFFRON that chooses neighboring points while avoiding making connections between points on geodesically distant regions of a manifold. SAFFRON identifies the suitability of points to be neighbors by using a relaxation technique that alternately estimates the tangent space at each point, and measures how well the estimated tangent spaces align with each other. This technique enables SAFFRON to form high-quality local neighborhoods, even on manifolds that pass very close to themselves. SAFFRON is even able to find neighborhoods that correctly follow the manifold topology of certain self-intersecting manifolds.
Keywords
learning (artificial intelligence); relaxation theory; topology; SAFFRON; geodesically distant region; intelligent neighbor-finding algorithm; machine learning; manifold topology; relaxation technique; self-intersecting manifold; similarly aligned friend finding relaxation; tangent space; Convergence; Equations; Euclidean distance; Manifolds; Silicon; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks (IJCNN), The 2011 International Joint Conference on
Conference_Location
San Jose, CA
ISSN
2161-4393
Print_ISBN
978-1-4244-9635-8
Type
conf
DOI
10.1109/IJCNN.2011.6033560
Filename
6033560
Link To Document