Sciweavers

732 search results - page 32 / 147
» Strongly Non-U-Shaped Learning Results by General Techniques
Sort
View
AI
2002
Springer
13 years 7 months ago
Programming backgammon using self-teaching neural nets
TD-Gammon is a neural network that is able to teach itself to play backgammon solely by playing against itself and learning from the results. Starting from random initial play, TD...
Gerald Tesauro
SIGIR
2010
ACM
13 years 7 months ago
Learning to rank query reformulations
Query reformulation techniques based on query logs have recently proven to be effective for web queries. However, when initial queries have reasonably good quality, these techniqu...
Van Dang, Michael Bendersky, W. Bruce Croft
KDD
2005
ACM
143views Data Mining» more  KDD 2005»
14 years 8 months ago
SVM selective sampling for ranking with application to data retrieval
Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...
Hwanjo Yu
IJCNN
2006
IEEE
14 years 1 months ago
Global Reinforcement Learning in Neural Networks with Stochastic Synapses
— We have found a more general formulation of the REINFORCE learning principle which had been proposed by R. J. Williams for the case of artificial neural networks with stochast...
Xiaolong Ma, Konstantin Likharev
ECML
2007
Springer
14 years 1 months ago
Finding the Right Family: Parent and Child Selection for Averaged One-Dependence Estimators
Averaged One-Dependence Estimators (AODE) classifies by uniformly aggregating all qualified one-dependence estimators (ODEs). Its capacity to significantly improve naive Bayes...
Fei Zheng, Geoffrey I. Webb