Sciweavers

1339 search results - page 26 / 268
» Learning Functions from Imperfect Positive Data
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Toward Off-Policy Learning Control with Function Approximation
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
Hamid Reza Maei, Csaba Szepesvári, Shalabh ...
EUROCOLT
1999
Springer
13 years 11 months ago
Mind Change Complexity of Learning Logic Programs
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Sanjay Jain, Arun Sharma
SIGIR
2009
ACM
14 years 2 months ago
Compressing term positions in web indexes
Large search engines process thousands of queries per second on billions of pages, making query processing a major factor in their operating costs. This has led to a lot of resear...
Hao Yan, Shuai Ding, Torsten Suel
BMCBI
2010
179views more  BMCBI 2010»
13 years 7 months ago
A semi-supervised learning approach to predict synthetic genetic interactions by combining functional and topological properties
Background: Genetic interaction profiles are highly informative and helpful for understanding the functional linkages between genes, and therefore have been extensively exploited ...
Zhuhong You, Zheng Yin, Kyungsook Han, De-Shuang H...
BMCBI
2007
133views more  BMCBI 2007»
13 years 7 months ago
Semi-supervised learning for the identification of syn-expressed genes from fused microarray and in situ image data
Background: Gene expression measurements during the development of the fly Drosophila melanogaster are routinely used to find functional modules of temporally co-expressed genes. ...
Ivan G. Costa, Roland Krause, Lennart Opitz, Alexa...