Sciweavers

3339 search results - page 76 / 668
» Relational Learning by Imitation
Sort
View
86
Voted
IPL
2008
89views more  IPL 2008»
15 years 18 days ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
103
Voted
IS
2006
15 years 18 days ago
The Michigan benchmark: towards XML query performance diagnostics
We propose a micro-benchmark for XML data management to aid engineers in designing improved XML processing engines. This benchmark is inherently different from application-level b...
Kanda Runapongsa, Jignesh M. Patel, H. V. Jagadish...
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
16 years 1 months ago
Relational data pre-processing techniques for improved securities fraud detection
Commercial datasets are often large, relational, and dynamic. They contain many records of people, places, things, events and their interactions over time. Such datasets are rarel...
Andrew Fast, Lisa Friedland, Marc Maier, Brian Tay...
JAIR
2011
134views more  JAIR 2011»
14 years 7 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...
199
Voted
ML
2011
ACM
308views Machine Learning» more  ML 2011»
14 years 7 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...