Sciweavers

129 search results - page 20 / 26
» Self-Paced Learning for Matrix Factorization
Sort
View
ICML
2004
IEEE
14 years 8 months ago
A multiplicative up-propagation algorithm
We present a generalization of the nonnegative matrix factorization (NMF), where a multilayer generative network with nonnegative weights is used to approximate the observed nonne...
Jong-Hoon Ahn, Seungjin Choi, Jong-Hoon Oh
EMMCVPR
2005
Springer
14 years 1 months ago
Reverse-Convex Programming for Sparse Image Codes
Abstract. Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse ...
Matthias Heiler, Christoph Schnörr
CIKM
2008
Springer
13 years 9 months ago
Learning latent semantic relations from clickthrough data for query suggestion
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu
ICML
2003
IEEE
14 years 8 months ago
Adaptive Overrelaxed Bound Optimization Methods
We study a class of overrelaxed bound optimization algorithms, and their relationship to standard bound optimizers, such as ExpectationMaximization, Iterative Scaling, CCCP and No...
Ruslan Salakhutdinov, Sam T. Roweis
BMCBI
2010
152views more  BMCBI 2010»
13 years 7 months ago
Apples and oranges: avoiding different priors in Bayesian DNA sequence analysis
Background: One of the challenges of bioinformatics remains the recognition of short signal sequences in genomic DNA such as donor or acceptor splice sites, splicing enhancers or ...
Jens Keilwagen, Jan Grau, Stefan Posch, Ivo Grosse