1107 search results - page 162 / 222 » Multi-instance tree learning |
112
click to vote
COLT
2001
Springer
15 years 6 months ago
2001
Springer
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
107
click to vote
ICML
2000
IEEE
15 years 5 months ago
2000
IEEE
This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with assoc...
ICGI
1998
Springer
15 years 5 months ago
1998
Springer
This paper describes a new sampling-based heuristic for tree search named SAGE and presents an analysis of its performance on the problem of grammar induction. This last work has b...
134
click to vote
KDD
1995
ACM
15 years 5 months ago
1995
ACM
Wedescribe a case study in data miningfor personal loan evaluation, performed at the ABNAMRObank in the Netherlands. Historical data of clients and their pay-backbehaviourare used...
104
click to vote
ICML
1994
IEEE
15 years 5 months ago
1994
IEEE
This paper presents an approach to automatic discovery of functions in Genetic Programming. The approach is based on discovery of useful building blocks by analyzing the evolution...