Sciweavers

440 search results - page 43 / 88
» Multiple Comparisons in Induction Algorithms
Sort
View
MLDM
2009
Springer
15 years 4 months ago
Assisting Data Mining through Automated Planning
The induction of knowledge from a data set relies in the execution of multiple data mining actions: to apply filters to clean and select the data, to train different algorithms (...
Fernando Fernández, Daniel Borrajo, Susana ...
JCB
1998
92views more  JCB 1998»
14 years 11 months ago
Homology Detection via Family Pairwise Search
The function of an unknown biological sequence can often be accurately inferred by identifying sequences homologous to the original sequence. Given a query set of known homologs, ...
William Noble Grundy
EMNLP
2008
15 years 1 months ago
An Analysis of Active Learning Strategies for Sequence Labeling Tasks
Active learning is well-suited to many problems in natural language processing, where unlabeled data may be abundant but annotation is slow and expensive. This paper aims to shed ...
Burr Settles, Mark Craven
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
14 years 11 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
ATAL
2006
Springer
15 years 1 months ago
Evaluating bidding strategies for simultaneous auctions
Bidding for multiple items or bundles on online auctions raises challenging problems. We assume that an agent has a valuation function that returns its valuation for an arbitrary ...
Teddy Candale, Sandip Sen