298 search results - page 46 / 60 » Subspace Clustering of High Dimensional Data |
161
click to vote
ICAPR
2001
Springer
15 years 8 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...
182
click to vote
ESANN
2006
15 years 5 months ago
2006
The Self-Organizing map (SOM), a powerful method for data mining and cluster extraction, is very useful for processing data of high dimensionality and complexity. Visualization met...
155
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper proposes a novel algorithm for categorization of action video sequences using unsupervised dual clustering. Given a video database, we extract motion information of act...
149
click to vote
IIS
2003
15 years 5 months ago
2003
Text clustering typically involves clustering in a high dimensional space, which appears difficult with regard to virtually all practical settings. In addition, given a particular...
183
click to vote
SDM
2008
SIAM
15 years 5 months ago
2008
SIAM
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...