436 search results - page 32 / 88 » Automatic Subspace Clustering of High Dimensional Data for D... |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper we present clustering method is very sensitive to the initial center values ,requirements on the data set too high, and cannot handle noisy data the proposal method ...
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...
SDM
2004
SIAM
13 years 9 months ago
2004
SIAM
Similarity search in database systems is becoming an increasingly important task in modern application domains such as multimedia, molecular biology, medical imaging, computer aid...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
In recent years, random projection has been used as a valuable tool for performing dimensionality reduction of high dimensional data. Starting with the seminal work of Johnson and...
EMNLP
2009
13 years 5 months ago
2009
In previous research in automatic verb classification, syntactic features have proved the most useful features, although manual classifications rely heavily on semantic features. ...