Sciweavers

225 search results - page 37 / 45
» On Learning Decision Trees with Large Output Domains
Sort
View
ICS
2010
Tsinghua U.
14 years 5 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
NAACL
2001
13 years 9 months ago
SPoT: A Trainable Sentence Planner
Sentence planning is a set of inter-related but distinct tasks, one of which is sentence scoping, i.e. the choice of syntactic structure for elementary speech acts and the decisio...
Marilyn A. Walker, Owen Rambow, Monica Rogati
IJCNN
2006
IEEE
14 years 1 months ago
Adaptation of Artificial Neural Networks Avoiding Catastrophic Forgetting
— In connectionist learning, one relevant problem is “catastrophic forgetting” that may occur when a network, trained with a large set of patterns, has to learn new input pat...
Dario Albesano, Roberto Gemello, Pietro Laface, Fr...
CADE
2004
Springer
14 years 8 months ago
Automatic Generation of Classification Theorems for Finite Algebras
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
Simon Colton, Andreas Meier, Volker Sorge, Roy L. ...
SETN
2010
Springer
14 years 2 months ago
Feature Selection for Improved Phone Duration Modeling of Greek Emotional Speech
In the present work we address the problem of phone duration modeling for the needs of emotional speech synthesis. Specifically, relying on ten well known machine learning techniqu...
Alexandros Lazaridis, Todor Ganchev, Iosif Mporas,...