5302 search results - page 259 / 1061 » Learning How to Separate |
162
click to vote
COLING
2002
15 years 6 months ago
2002
We present a supervised learning approach to identification of anaphoric and non-anaphoric noun phrases and show how such information can be incorporated into a coreference resolu...
139
Voted
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
157
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering r...
149
Voted
ICML
2000
IEEE
16 years 7 months ago
2000
IEEE
We study the problem of learning using combinations of machines. In particular we present new theoretical bounds on the generalization performance of voting ensembles of kernel ma...
139
click to vote
ICALT
2007
IEEE
16 years 14 days ago
2007
IEEE
Previous research on program visualization tools has suggested that both static and dynamic aspects of the program shall be shown to novice students. We attempted to expand the st...