Sciweavers

1393 search results - page 40 / 279
» Machine Learning by Function Decomposition
Sort
View
ICML
2008
IEEE
16 years 19 days ago
A worst-case comparison between temporal difference and residual gradient with linear function approximation
Residual gradient (RG) was proposed as an alternative to TD(0) for policy evaluation when function approximation is used, but there exists little formal analysis comparing them ex...
Lihong Li
ICML
2007
IEEE
16 years 19 days ago
Learning distance function by coding similarity
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
Aharon Bar-Hillel, Daphna Weinshall
ECTEL
2010
Springer
14 years 9 months ago
Demands of Modern PLEs and the ROLE Approach
Abstract. We present basic concepts and an outlook on current approaches and techniques of personal learning environments to point out their demands, focussing on recommendations i...
Uwe Kirschenmann, Maren Scheffel, Martin Friedrich...
ECML
2006
Springer
15 years 3 months ago
Unsupervised Multiple-Instance Learning for Functional Profiling of Genomic Data
Multiple-instance learning (MIL) is a popular concept among the AI community to support supervised learning applications in situations where only incomplete knowledge is available....
Corneliu Henegar, Karine Clément, Jean-Dani...
ML
2002
ACM
223views Machine Learning» more  ML 2002»
14 years 11 months ago
Text Categorization with Support Vector Machines. How to Represent Texts in Input Space?
The choice of the kernel function is crucial to most applications of support vector machines. In this paper, however, we show that in the case of text classification, term-frequenc...
Edda Leopold, Jörg Kindermann