12 search results - page 1 / 3 » Proximity Searching in High Dimensional Spaces with a Proxim... |
MICAI
2005
Springer
13 years 10 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...
SIGMOD
2000
ACM
13 years 9 months ago
2000
ACM
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
SIGMOD
2001
ACM
14 years 5 months ago
2001
ACM
The outlier detection problem has important applications in the eld of fraud detection, network robustness analysis, and intrusion detection. Most such applications are high dimen...
ALENEX
2001
13 years 6 months ago
2001
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
ICDE
2002
IEEE
14 years 6 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...