Sciweavers

377 search results - page 38 / 76
» Assessing Data Mining Results on Matrices with Randomization
Sort
View
BMCBI
2007
154views more  BMCBI 2007»
13 years 8 months ago
Classification of heterogeneous microarray data by maximum entropy kernel
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...
Wataru Fujibuchi, Tsuyoshi Kato
KDD
2004
ACM
147views Data Mining» more  KDD 2004»
14 years 2 months ago
Clustering time series from ARMA models with clipped data
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...
Anthony J. Bagnall, Gareth J. Janacek
NIPS
2004
13 years 10 months ago
Nonparametric Transforms of Graph Kernels for Semi-Supervised Learning
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...
Xiaojin Zhu, Jaz S. Kandola, Zoubin Ghahramani, Jo...
ICDM
2009
IEEE
172views Data Mining» more  ICDM 2009»
13 years 6 months ago
Evaluating Statistical Tests for Within-Network Classifiers of Relational Data
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...
Jennifer Neville, Brian Gallagher, Tina Eliassi-Ra...
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
14 years 10 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010