2157 search results - page 97 / 432 » Learning Switching Concepts |
148
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
149
click to vote
CC
2010
Springer
15 years 1 months ago
2010
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
144
click to vote
DGO
2008
15 years 5 months ago
2008
This paper presents a new approach to identifying concepts expressed in a collection of email messages, and organizing them into an ontology or taxonomy for browsing. It incorpora...
122
click to vote
ALT
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
163
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
Ontology learning is an important task in Artificial Intelligence, Semantic Web and Text Mining. This paper presents a novel framework for, and solutions to, three practical probl...