169 search results - page 9 / 34 » Reductions among high dimensional proximity problems |
CSB
2003
IEEE
14 years 2 months ago
2003
IEEE
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
IRI
2007
IEEE
14 years 3 months ago
2007
IEEE
Many applications require analyzing vast amounts of textual data, but the size and inherent noise of such data can make processing very challenging. One approach to these issues i...
PAMI
2011
13 years 3 months ago
2011
—In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. The resulting ...
SIGMOD
2001
ACM
14 years 9 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....