766 search results - page 34 / 154 » Clustering high dimensional data using subspace and projecte... |
MICAI
2005
Springer
14 years 2 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...
KDD
2002
ACM
14 years 9 months ago
2002
ACM
This paper studies the problem of categorical data clustering, especially for transactional data characterized by high dimensionality and large volume. Starting from a heuristic m...
ICAPR
2001
Springer
14 years 1 months ago
2001
Springer
The goal of this paper is to describe an efficient procedure for color-based image retrieval. The proposed procedure consists of two stages. First, the image data set is hierarchi...
ICDM
2009
IEEE
14 years 3 months ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
Query result clustering has recently attracted a lot of attention to provide users with a succinct overview of relevant results. However, little work has been done on organizing t...