2073 search results - page 171 / 415 » Learning for Dynamic Subsumption |
110
click to vote
KI
2002
Springer
15 years 2 months ago
2002
Springer
In this paper, we present an approach for learning interest profiles implicitly from positive user observations only. This approach eliminates the need to prompt users for ratings...
125
click to vote
ML
1998
ACM
15 years 2 months ago
1998
ACM
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...
120
click to vote
ACL
2010
15 years 1 months ago
2010
Many researchers are trying to use information extraction (IE) to create large-scale knowledge bases from natural language text on the Web. However, the primary approach (supervis...
168
click to vote
MM
2010
ACM
15 years 3 months ago
2010
ACM
This paper proposes a new framework to formulate the problem of rushes video summarization as an unsupervised learning problem. We pose the problem of video summarization as one o...
129
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
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 ...