377 search results - page 38 / 76 » Assessing Data Mining Results on Matrices with Randomization |
107
click to vote
BMCBI
2007
14 years 12 months ago
2007
Background: There is a large amount of microarray data accumulating in public databases, providing various data waiting to be analyzed jointly. Powerful kernel-based methods are c...
KDD
2004
ACM
15 years 5 months ago
2004
ACM
Clustering time series is a problem that has applications in a wide variety of fields, and has recently attracted a large amount of research. In this paper we focus on clustering...
112
click to vote
NIPS
2004
15 years 1 months ago
2004
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
ICDM
2009
IEEE
14 years 9 months ago
2009
IEEE
Recently a number of modeling techniques have been developed for data mining and machine learning in relational and network domains where the instances are not independent and ide...
203
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...