17 search results - page 2 / 4 » Approximate Nearest Subspace Search with Applications to Pat... |
110
click to vote
ISM
2006
IEEE
15 years 7 months ago
2006
IEEE
This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognit...
220
click to vote
ICDE
2002
IEEE
16 years 3 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
130
click to vote
PAA
2008
15 years 1 months ago
2008
This paper presents a novel approach for online subspace learning based on an incremental version of the nonparametric discriminant analysis (NDA). For many real-world applications...
116
Voted
KDD
2005
ACM
16 years 2 months ago
2005
ACM
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
107
click to vote
SIGIR
2004
ACM
15 years 7 months ago
2004
ACM
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...