Sciweavers

1736 search results - page 130 / 348
» String Extension Learning
Sort
View
ML
2006
ACM
142views Machine Learning» more  ML 2006»
15 years 4 months ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....
TNN
2008
105views more  TNN 2008»
15 years 4 months ago
Incremental Learning of Chunk Data for Online Pattern Classification Systems
This paper presents a pattern classification system in which feature extraction and classifier learning are simultaneously carried out not only online but also in one pass where tr...
Seiichi Ozawa, Shaoning Pang, Nikola K. Kasabov
TSMC
2008
146views more  TSMC 2008»
15 years 4 months ago
Decentralized Learning in Markov Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is tha...
Peter Vrancx, Katja Verbeeck, Ann Nowé
JODL
2007
126views more  JODL 2007»
15 years 4 months ago
Building rich, semantic descriptions of learning activities to facilitate reuse in digital libraries
Abstract This paper describes efforts to extend educational descriptions of learning objects to enable semantic search for suitable resources held within digital libraries and cybe...
Mark Gahegan, Ritesh Agrawal, Tawan Banchuen, Davi...
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
15 years 2 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis