298 search results - page 21 / 60 » Subspace Clustering of High Dimensional Data |
108
Voted
CIKM
2000
Springer
15 years 4 months ago
2000
Springer
With the proliferation of multimedia data, there is increasing need to support the indexing and searching of high dimensional data. Recently, a vector approximation based techniqu...
109
click to vote
DEXA
2006
Springer
15 years 4 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 ...
110
Voted
PKDD
2009
Springer
15 years 7 months ago
2009
Springer
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
203
click to vote
ICDE
2002
IEEE
16 years 1 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...
198
Voted
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
We consider the problem of joining massive datasets. We propose two techniques for minimizing disk I/O cost of join operations for both spatial and sequence data. Our techniques o...