Sciweavers

1854 search results - page 94 / 371
» On Kernel Methods for Relational Learning
Sort
View
AAMAS
2005
Springer
15 years 3 months ago
Learning and Exploiting Relative Weaknesses of Opponent Agents
Agents in a competitive interaction can greatly benefit from adapting to a particular adversary, rather than using the same general strategy against all opponents. One method of s...
Shaul Markovitch, Ronit Reger
CIKM
2008
Springer
15 years 5 months ago
Learning latent semantic relations from clickthrough data for query suggestion
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu
AIPS
2007
15 years 5 months ago
Discovering Relational Domain Features for Probabilistic Planning
In sequential decision-making problems formulated as Markov decision processes, state-value function approximation using domain features is a critical technique for scaling up the...
Jia-Hong Wu, Robert Givan
PAKDD
2005
ACM
142views Data Mining» more  PAKDD 2005»
15 years 8 months ago
Dynamic Cluster Formation Using Level Set Methods
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...
Andy M. Yip, Chris H. Q. Ding, Tony F. Chan
COLT
2008
Springer
15 years 5 months ago
Linear Algorithms for Online Multitask Classification
We design and analyze interacting online algorithms for multitask classification that perform better than independent learners whenever the tasks are related in a certain sense. W...
Giovanni Cavallanti, Nicolò Cesa-Bianchi, C...