184 search results - page 21 / 37 » Random Projection for High Dimensional Data Clustering: A Cl... |
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...
JMLR
2010
13 years 3 months ago
2010
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
DMIN
2008
13 years 10 months ago
2008
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
SAC
2004
ACM
14 years 2 months ago
2004
ACM
Gene clustering based on microarray data provides useful functional information to the working biologists. Many current gene-clustering algorithms rely on Euclidean-based distance...
NIPS
2008
13 years 10 months ago
2008
In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. These representa...