Sciweavers

779 search results - page 61 / 156
» Information-theoretic Competitive Learning
Sort
View
NIPS
2004
13 years 10 months ago
Online Bounds for Bayesian Algorithms
We present a competitive analysis of Bayesian learning algorithms in the online learning setting and show that many simple Bayesian algorithms (such as Gaussian linear regression ...
Sham M. Kakade, Andrew Y. Ng
ICML
2010
IEEE
13 years 10 months ago
Label Ranking Methods based on the Plackett-Luce Model
This paper introduces two new methods for label ranking based on a probabilistic model of ranking data, called the Plackett-Luce model. The idea of the first method is to use the ...
Weiwei Cheng, Krzysztof Dembczynski, Eyke Hül...
WEBI
2010
Springer
13 years 6 months ago
Relations Expansion: Extracting Relationship Instances from the Web
In this paper, we propose a Relation Expansion framework, which uses a few seed sentences marked up with two entities to expand a set of sentences containing target relations. Duri...
Haibo Li, Yutaka Matsuo, Mitsuru Ishizuka
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
14 years 3 months ago
Evolutionary hypernetwork models for aptamer-based cardiovascular disease diagnosis
We present a biology-inspired probabilistic graphical model, called the hypernetwork model, and its application to medical diagnosis of disease. The hypernetwork models are a way ...
JungWoo Ha, Jae-Hong Eom, Sung-Chun Kim, Byoung-Ta...
ICML
2009
IEEE
14 years 9 months ago
A majorization-minimization algorithm for (multiple) hyperparameter learning
We present a general Bayesian framework for hyperparameter tuning in L2-regularized supervised learning models. Paradoxically, our algorithm works by first analytically integratin...
Chuan-Sheng Foo, Chuong B. Do, Andrew Y. Ng