Statistical relational artificial intelligence: Logic, probability, and computation
An intelligent agent interacting with the real world will encounter individual people, courses,
test results, drugs prescriptions, chairs, boxes, etc., and needs to reason about properties of …
test results, drugs prescriptions, chairs, boxes, etc., and needs to reason about properties of …
Balancing exploration and exploitation in listwise and pairwise online learning to rank for information retrieval
As retrieval systems become more complex, learning to rank approaches are being
developed to automatically tune their parameters. Using online learning to rank, retrieval …
developed to automatically tune their parameters. Using online learning to rank, retrieval …
A cross-benchmark comparison of 87 learning to rank methods
Learning to rank is an increasingly important scientific field that comprises the use of
machine learning for the ranking task. New learning to rank methods are generally …
machine learning for the ranking task. New learning to rank methods are generally …
Roial: Region of interest active learning for characterizing exoskeleton gait preference landscapes
Characterizing what types of exoskeleton gaits are comfortable for users, and understanding
the science of walking more generally, require recovering a user's utility landscape …
the science of walking more generally, require recovering a user's utility landscape …
[PDF][PDF] Exploration in relational domains for model-based reinforcement learning
A fundamental problem in reinforcement learning is balancing exploration and exploitation.
We address this problem in the context of model-based reinforcement learning in large …
We address this problem in the context of model-based reinforcement learning in large …
Balancing exploration and exploitation in learning to rank online
As retrieval systems become more complex, learning to rank approaches are being
developed to automatically tune their parameters. Using online learning to rank approaches …
developed to automatically tune their parameters. Using online learning to rank approaches …
[PDF][PDF] Learning community-based preferences via dirichlet process mixtures of gaussian processes
Bayesian approaches to preference learning using Gaussian Processes (GPs) are attractive
due to their ability to explicitly model uncertainty in users' latent utility functions; unfortunately …
due to their ability to explicitly model uncertainty in users' latent utility functions; unfortunately …
Interactive learning of pattern rankings
Pattern mining provides useful tools for exploratory data analysis. Numerous efficient
algorithms exist that are able to discover various types of patterns in large datasets …
algorithms exist that are able to discover various types of patterns in large datasets …
A comprehensive survey on web content extraction algorithms and techniques
SM Al-Ghuribi, S Alshomrani - 2013 International Conference …, 2013 - ieeexplore.ieee.org
Web Content Extraction is an important problem that has been studied through different
approaches and algorithms. It is interested in extracting meaningful and useful data from the …
approaches and algorithms. It is interested in extracting meaningful and useful data from the …
[PDF][PDF] Fast and reliable online learning to rank for information retrieval
K Hofmann - SIGIR Forum, 2013 - dare.uva.nl
1. Introduction pany's intranet or a library catalogue, collecting the large amounts of training
data required for supervised learning is usually not feasible (Sanderson, 2010). Even in …
data required for supervised learning is usually not feasible (Sanderson, 2010). Even in …