Sciweavers

476 search results - page 74 / 96
» Learning When to Use Lazy Learning in Constraint Solving
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
15 years 10 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
AIPS
2008
15 years 9 hour ago
The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
Katrina Ray, Matthew L. Ginsberg
CHI
2002
ACM
15 years 10 months ago
Automated message prioritization: making voicemail retrieval more efficient
Navigating through new voicemail messages to find messages of interest is a time-consuming task, particularly for high-volume users. When checking messages under a time constraint...
Meridith Ringel, Julia Hirschberg
98
Voted
JMLR
2008
168views more  JMLR 2008»
14 years 9 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
ATAL
2007
Springer
15 years 3 months ago
Effective tag mechanisms for evolving coordination
Tags or observable features shared by a group of similar agents are effectively used in real and artificial societies to signal intentions and can be used to infer unobservable ...
Matthew Matlock, Sandip Sen