Sciweavers

263 search results - page 31 / 53
» Regret Bounds for Prediction Problems
Sort
View
BMCBI
2007
136views more  BMCBI 2007»
13 years 10 months ago
Prediction of tissue-specific cis-regulatory modules using Bayesian networks and regression trees
Background: In vertebrates, a large part of gene transcriptional regulation is operated by cisregulatory modules. These modules are believed to be regulating much of the tissue-sp...
Xiaoyu Chen, Mathieu Blanchette
DEXAW
2007
IEEE
124views Database» more  DEXAW 2007»
14 years 1 months ago
XML Query Optimisation: Specify your Selectivity
The problem of efficiently evaluating XPath and XQuery queries has become increasingly significant since more and more XML data is stored in its native form. We propose a novel op...
Sven Hartmann, Sebastian Link
COLT
2006
Springer
14 years 1 months ago
Online Multitask Learning
We study the problem of online learning of multiple tasks in parallel. On each online round, the algorithm receives an instance and makes a prediction for each one of the parallel ...
Ofer Dekel, Philip M. Long, Yoram Singer
JMLR
2010
179views more  JMLR 2010»
13 years 4 months ago
PAC-Bayesian Analysis of Co-clustering and Beyond
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
Yevgeny Seldin, Naftali Tishby
STACS
1999
Springer
14 years 2 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann