Sciweavers

1662 search results - page 5 / 333
» Generation of Attributes for Learning Algorithms
Sort
View
ICML
1996
IEEE
14 years 8 months ago
Discretizing Continuous Attributes While Learning Bayesian Networks
We introduce a method for learning Bayesian networks that handles the discretization of continuous variables as an integral part of the learning process. The main ingredient in th...
Moisés Goldszmidt, Nir Friedman
ICML
2009
IEEE
14 years 2 months ago
Rule learning with monotonicity constraints
In classification with monotonicity constraints, it is assumed that the class label should increase with increasing values on the attributes. In this paper we aim at formalizing ...
Wojciech Kotlowski, Roman Slowinski
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
14 years 2 months ago
Spatio-temporal Multi-dimensional Relational Framework Trees
—The real world is composed of sets of objects that move and morph in both space and time. Useful concepts can be defined in terms of the complex interactions between the multi-...
Matthew Bodenhamer, Samuel Bleckley, Daniel Fennel...
ICMLA
2004
13 years 9 months ago
Satisficing Q-learning: efficient learning in problems with dichotomous attributes
In some environments, a learning agent must learn to balance competing objectives. For example, a Q-learner agent may need to learn which choices expose the agent to risk and whic...
Michael A. Goodrich, Morgan Quigley
CIKM
1997
Springer
13 years 11 months ago
Learning Belief Networks from Data: An Information Theory Based Approach
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
Jie Cheng, David A. Bell, Weiru Liu