581 search results - page 5 / 117 » EM in High Dimensional Spaces |
ICDT
2001
ACM
15 years 2 months ago
2001
ACM
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
MICAI
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
84
Voted
PAKDD
2009
ACM
15 years 5 months ago
2009
ACM
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...
100
Voted
HAIS
2009
Springer
15 years 2 months ago
2009
Springer
Developing models and methods to manage data vagueness is a current effervescent research field. Some work has been done with supervised problems but unsupervised problems and unce...
145
Voted
PODS
1997
ACM
15 years 2 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...