Sciweavers

119 search results - page 17 / 24
» Sparse kernel methods for high-dimensional survival data
Sort
View
ICDM
2009
IEEE
174views Data Mining» more  ICDM 2009»
14 years 3 months ago
Non-sparse Multiple Kernel Learning for Fisher Discriminant Analysis
—We consider the problem of learning a linear combination of pre-specified kernel matrices in the Fisher discriminant analysis setting. Existing methods for such a task impose a...
Fei Yan, Josef Kittler, Krystian Mikolajczyk, Muha...
WISE
2002
Springer
14 years 1 months ago
A Unified Framework for Clustering Heterogeneous Web Objects
In this paper, we introduce a novel framework for clustering web data which is often heterogeneous in nature. As most existing methods often integrate heterogeneous data into a un...
Hua-Jun Zeng, Zheng Chen, Wei-Ying Ma
JMLR
2006
156views more  JMLR 2006»
13 years 8 months ago
Large Scale Multiple Kernel Learning
While classical kernel-based learning algorithms are based on a single kernel, in practice it is often desirable to use multiple kernels. Lanckriet et al. (2004) considered conic ...
Sören Sonnenburg, Gunnar Rätsch, Christi...
ICML
2008
IEEE
14 years 9 months ago
Sparse multiscale gaussian process regression
Most existing sparse Gaussian process (g.p.) models seek computational advantages by basing their computations on a set of m basis functions that are the covariance function of th...
Bernhard Schölkopf, Christian Walder, Kwang I...
BMCBI
2010
243views more  BMCBI 2010»
13 years 8 months ago
Comparative study of unsupervised dimension reduction techniques for the visualization of microarray gene expression data
Background: Visualization of DNA microarray data in two or three dimensional spaces is an important exploratory analysis step in order to detect quality issues or to generate new ...
Christoph Bartenhagen, Hans-Ulrich Klein, Christia...