Sciweavers

2750 search results - page 121 / 550
» The complexity of learning SUBSEQ(A)
Sort
View
AAAI
2011
14 years 6 months ago
An Online Spectral Learning Algorithm for Partially Observable Nonlinear Dynamical Systems
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
Byron Boots, Geoffrey J. Gordon
RSCTC
2004
Springer
134views Fuzzy Logic» more  RSCTC 2004»
15 years 11 months ago
Rough Set Methods in Approximation of Hierarchical Concepts
Abstract. Many learning methods ignore domain knowledge in synthesis of concept approximation. We propose to use hierarchical schemes for learning approximations of complex concept...
Jan G. Bazan, Sinh Hoa Nguyen, Hung Son Nguyen, An...
CORR
2010
Springer
47views Education» more  CORR 2010»
15 years 6 months ago
Robustness and Generalization
We derive generalization bounds for learning algorithms based on their robustness: the property that if a testing sample is "similar" to a training sample, then the test...
Huan Xu, Shie Mannor
ISAMI
2010
15 years 4 months ago
Accurate Temporal Relationships in Sequences of User Behaviours in Intelligent Environments
Intelligent Environments are supposed to act proactively anticipating user's needs and preferences in order to provide effective support. Therefore, learning user's frequ...
Asier Aztiria, Juan Carlos Augusto, Rosa Basagoiti...
ICMLA
2009
15 years 4 months ago
An Ordinal Data Method for the Classification with Reject Option
In this work we consider the problem of binary classification where the classifier may abstain instead of classifying each observation, leaving the critical items for human evaluat...
Ricardo Sousa, Beatriz Mora, Jaime S. Cardoso