Sciweavers

2723 search results - page 138 / 545
» Learning lexicographic orders
Sort
View
144
Voted
ECML
2007
Springer
15 years 11 months ago
An Unsupervised Learning Algorithm for Rank Aggregation
Many applications in information retrieval, natural language processing, data mining, and related fields require a ranking of instances with respect to a specified criteria as op...
Alexandre Klementiev, Dan Roth, Kevin Small
ADMA
2006
Springer
121views Data Mining» more  ADMA 2006»
15 years 11 months ago
A New Polynomial Time Algorithm for Bayesian Network Structure Learning
We propose a new algorithm called SCD for learning the structure of a Bayesian network. The algorithm is a kind of constraintbased algorithm. By taking advantage of variable orderi...
Sanghack Lee, Jihoon Yang, Sungyong Park
ICML
2006
IEEE
15 years 11 months ago
Automatic basis function construction for approximate dynamic programming and reinforcement learning
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
Philipp W. Keller, Shie Mannor, Doina Precup
AIED
2005
Springer
15 years 11 months ago
Making Learning Design Standards Work with an Ontology of Educational Theories
In this paper, we present an ontology of educational theories their relation to learning design. This ontology takes into account learning design (LD) specifications such as OUNL-E...
Valéry Psyché, Jacqueline Bourdeau, ...
ICCBR
2005
Springer
15 years 11 months ago
Learning Similarity Measures: A Formal View Based on a Generalized CBR Model
Abstract. Although similarity measures play a crucial role in CBR applications, clear methodologies for defining them have not been developed yet. One approach to simplify the de...
Armin Stahl