114 search results - page 4 / 23 » OP-Cluster: Clustering by Tendency in High Dimensional Space |
DEXA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
VLDB
2000
ACM
13 years 11 months ago
2000
ACM
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
MICAI
2005
Springer
14 years 29 days 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...
ICDM
2002
IEEE
14 years 12 days ago
2002
IEEE
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
VISSYM
2004
13 years 8 months ago
2004
It is difficult for the average viewer to assimilate and comprehend huge amounts of high-dimensional data. It is important to present data in a way that allows the user a high lev...