Sciweavers

1339 search results - page 133 / 268
» Learning Functions from Imperfect Positive Data
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
A kernelized maximal-figure-of-merit learning approach based on subspace distance minimization
We propose a kernelized maximal-figure-of-merit (MFoM) learning approach to efficiently training a nonlinear model using subspace distance minimization. In particular, a fixed,...
Byungki Byun, Chin-Hui Lee
JMLR
2012
13 years 8 months ago
Online Incremental Feature Learning with Denoising Autoencoders
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
Guanyu Zhou, Kihyuk Sohn, Honglak Lee
ECML
2005
Springer
15 years 11 months ago
Learning to Complete Sentences
Abstract. We consider the problem of predicting how a user will continue a given initial text fragment. Intuitively, our goal is to develop a “tab-complete” function for natura...
Steffen Bickel, Peter Haider, Tobias Scheffer
ICML
2009
IEEE
16 years 7 months ago
Robust feature extraction via information theoretic learning
In this paper, we present a robust feature extraction framework based on informationtheoretic learning. Its formulated objective aims at simultaneously maximizing the Renyi's...
Xiaotong Yuan, Bao-Gang Hu
BMCBI
2008
109views more  BMCBI 2008»
15 years 6 months ago
ConStruct: Improved construction of RNA consensus structures
Background: Aligning homologous non-coding RNAs (ncRNAs) correctly in terms of sequence and structure is an unresolved problem, due to both mathematical complexity and imperfect s...
Andreas Wilm, Kornelia Linnenbrink, Gerhard Steger