Sciweavers

360 search results - page 12 / 72
» Learning Evaluation Functions for Large Acyclic Domains
Sort
View
JAIR
2011
134views more  JAIR 2011»
13 years 3 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
ICML
2006
IEEE
14 years 9 months ago
Learning a kernel function for classification with small training samples
When given a small sample, we show that classification with SVM can be considerably enhanced by using a kernel function learned from the training data prior to discrimination. Thi...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
FLAIRS
2006
13 years 10 months ago
Generating Realistic Large Bayesian Networks by Tiling
In this paper we present an algorithm and software for generating arbitrarily large Bayesian Networks by tiling smaller real-world known networks. The algorithm preserves the stru...
Ioannis Tsamardinos, Alexander R. Statnikov, Laura...
CHI
2011
ACM
13 years 5 days ago
Apolo: making sense of large network data by combining rich user interaction and machine learning
Extracting useful knowledge from large network datasets has become a fundamental challenge in many domains, from scientific literature to social networks and the web. We introduc...
Duen Horng Chau, Aniket Kittur, Jason I. Hong, Chr...
AAAI
2004
13 years 10 months ago
Methods for Domain-Independent Information Extraction from the Web: An Experimental Comparison
Our KNOWITALL system aims to automate the tedious process of extracting large collections of facts (e.g., names of scientists or politicians) from the Web in an autonomous, domain...
Oren Etzioni, Michael J. Cafarella, Doug Downey, A...