Sciweavers

1393 search results - page 103 / 279
» Machine Learning by Function Decomposition
Sort
View
117
Voted
ECAI
2006
Springer
15 years 5 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani
117
Voted
CIKM
2009
Springer
15 years 8 months ago
Incremental query evaluation for support vector machines
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
Danzhou Liu, Kien A. Hua
ICML
2004
IEEE
16 years 2 months ago
Adaptive cognitive orthotics: combining reinforcement learning and constraint-based temporal reasoning
Reminder systems support people with impaired prospective memory and/or executive function, by providing them with reminders of their functional daily activities. We integrate tem...
Matthew R. Rudary, Satinder P. Singh, Martha E. Po...
113
Voted
ML
1998
ACM
136views Machine Learning» more  ML 1998»
15 years 1 months ago
Co-Evolution in the Successful Learning of Backgammon Strategy
Following Tesauro’s work on TD-Gammon, we used a 4000 parameter feed-forward neural network to develop a competitive backgammon evaluation function. Play proceeds by a roll of t...
Jordan B. Pollack, Alan D. Blair
ICML
2009
IEEE
16 years 2 months ago
Structure learning of Bayesian networks using constraints
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
Cassio Polpo de Campos, Zhi Zeng, Qiang Ji