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....
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...
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...
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...
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...