Sciweavers

174 search results - page 12 / 35
» Advances in Instance Selection for Instance-Based Learning A...
Sort
View
ILP
2003
Springer
15 years 2 months ago
Graph Kernels and Gaussian Processes for Relational Reinforcement Learning
RRL is a relational reinforcement learning system based on Q-learning in relational state-action spaces. It aims to enable agents to learn how to act in an environment that has no ...
Thomas Gärtner, Kurt Driessens, Jan Ramon
ICML
2006
IEEE
15 years 10 months ago
Concept boundary detection for speeding up SVMs
Support Vector Machines (SVMs) suffer from an O(n2 ) training cost, where n denotes the number of training instances. In this paper, we propose an algorithm to select boundary ins...
Navneet Panda, Edward Y. Chang, Gang Wu
ICTAI
2007
IEEE
15 years 3 months ago
On Portfolios for Backtracking Search in the Presence of Deadlines
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
Huayue Wu, Peter van Beek
IJCNN
2007
IEEE
15 years 3 months ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar
EDBT
2010
ACM
170views Database» more  EDBT 2010»
15 years 24 days ago
Augmenting OLAP exploration with dynamic advanced analytics
Online Analytical Processing (OLAP) is a popular technique for explorative data analysis. Usually, a fixed set of dimensions (such as time, place, etc.) is used to explore and ana...
Benjamin Leonhardi, Bernhard Mitschang, Rubé...