Sciweavers

1838 search results - page 315 / 368
» Competitive Collaborative Learning
Sort
View
AAAI
2008
15 years 4 months ago
Hidden Dynamic Probabilistic Models for Labeling Sequence Data
We propose a new discriminative framework, namely Hidden Dynamic Conditional Random Fields (HDCRFs), for building probabilistic models which can capture both internal and external...
Xiaofeng Yu, Wai Lam
AIIDE
2008
15 years 4 months ago
Intelligent Trading Agents for Massively Multi-player Game Economies
As massively multi-player gaming environments become more detailed, developing agents to populate these virtual worlds as capable non-player characters poses an increasingly compl...
John Reeder, Gita Sukthankar, Michael Georgiopoulo...
IFIP12
2008
15 years 3 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda
NIPS
2008
15 years 3 months ago
An Online Algorithm for Maximizing Submodular Functions
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
Matthew J. Streeter, Daniel Golovin
NIPS
2007
15 years 3 months ago
Expectation Maximization and Posterior Constraints
The expectation maximization (EM) algorithm is a widely used maximum likelihood estimation procedure for statistical models when the values of some of the variables in the model a...
João Graça, Kuzman Ganchev, Ben Task...