504 search results - page 10 / 101 » PCS: An Efficient Clustering Method for High-Dimensional Dat... |
183
click to vote
ENGL
2008
15 years 6 months ago
2008
With the proliferation of multimedia data, there is an increasing need to support the indexing and searching of high-dimensional data. In this paper, we propose an efficient indexi...
187
click to vote
SISAP
2008
IEEE
16 years 10 days ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
199
click to vote
JMLR
2010
15 years 22 days ago
2010
This work addresses the problem of feature extraction for boosting the performance of outlier detectors in high-dimensional spaces. Recent years have observed the prominence of mu...
168
click to vote
MICAI
2005
Springer
15 years 11 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...
195
click to vote
EDBT
2000
ACM
15 years 10 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...