Pages that link to "Item:Q1207304"

The following pages link to A learning criterion for stochastic rules (Q1207304):

Displaying 15 items.

• Learning criteria weights of an optimistic Electre Tri sorting rule (Q342009) (← links)
• Efficient distribution-free learning of probabilistic concepts (Q1329154) (← links)
• Toward efficient agnostic learning (Q1342730) (← links)
• Stochastic complexity in learning (Q1370860) (← links)
• Learning about the parameter of the Bernoulli model (Q1370861) (← links)
• On-line maximum likelihood prediction with respect to general loss functions (Q1370862) (← links)
• High-dimensional penalty selection via minimum description length principle (Q1631787) (← links)
• The decomposed normalized maximum likelihood code-length criterion for selecting hierarchical latent variable models (Q2218353) (← links)
• Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms (Q2485074) (← links)
• An axiomatization of learning rules when counterfactuals are not observed (Q2867503) (← links)
• Probabilistic Rule Learning in Nonmonotonic Domains (Q3092307) (← links)
• Learning from stochastic rules under finite temperature - optimal temperature and asymptotic learning curve (Q4255714) (← links)
• Machine Learning: ECML 2004 (Q5450733) (← links)
• Computational Logic in Multi-Agent Systems (Q5464684) (← links)
• The role of mutual information in variational classifiers (Q6134364) (← links)