Sciweavers

238 search results - page 33 / 48
» Learning Recursive Automata from Positive Examples
Sort
View
ICDM
2007
IEEE
187views Data Mining» more  ICDM 2007»
14 years 2 months ago
A Comparative Study of Methods for Transductive Transfer Learning
The problem of transfer learning, where information gained in one learning task is used to improve performance in another related task, is an important new area of research. While...
Andrew Arnold, Ramesh Nallapati, William W. Cohen
ECML
2003
Springer
14 years 1 months ago
Learning Context Free Grammars in the Limit Aided by the Sample Distribution
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
Yoav Seginer
ICCV
2011
IEEE
12 years 8 months ago
Discriminative Learning of Relaxed Hierarchy for Large-scale Visual Recognition
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
Tianshi Gao, Daphne Koller
FM
2003
Springer
146views Formal Methods» more  FM 2003»
14 years 1 months ago
Interacting State Machines for Mobility
We present two instantiations of generic Interactive State Machines (ISMs) with mobility features which are useful for modeling and verifying dynamically changing mobile systems. I...
Thomas A. Kuhn, David von Oheimb
AAAI
1998
13 years 10 months ago
Iterated Phantom Induction: A Little Knowledge Can Go a Long Way
Weadvance a knowledge-based learning method that augments conventional generalization to permit concept acquisition in failure domains. These are domains in whichlearning must pro...
Mark Brodie, Gerald DeJong