32 search results - page 1 / 7 » Efficient Recovery of Low-Dimensional Structure from High-Di... |
ICCV
1999
IEEE
14 years 7 months ago
1999
IEEE
KDD
2008
ACM
14 years 6 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
KDD
2006
ACM
14 years 6 months ago
2006
ACM
Linear and Quadratic Discriminant Analysis have been used widely in many areas of data mining, machine learning, and bioinformatics. Friedman proposed a compromise between Linear ...
COCOON
1998
Springer
13 years 10 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
We present an algorithm, Hierarchical ISOmetric SelfOrganizing Map (H-ISOSOM), for a concise, organized manifold representation of complex, non-linear, large scale, high-dimension...