Sciweavers

200 search results - page 2 / 40
» On the Consistency of Discrete Bayesian Learning
Sort
View
ICMLA
2007
13 years 6 months ago
Learning bayesian networks consistent with the optimal branching
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
Alexandra M. Carvalho, Arlindo L. Oliveira
ECML
1991
Springer
13 years 8 months ago
Semi-Naive Bayesian Classifier
1 A novel semi-naive Bayesian classifier is introduced that is particularly suitable to data with many attributes. The naive Bayesian classifier is taken as a starting point and co...
Igor Kononenko
KDD
1995
ACM
109views Data Mining» more  KDD 1995»
13 years 8 months ago
An Iterative Improvement Approach for the Discretization of Numeric Attributes in Bayesian Classifiers
The Bayesianclassifier is a simple approachto classification that producesresults that are easy for people to interpret. In many cases, the Bayesianclassifieris at leastasaccurate...
Michael J. Pazzani
NIPS
1997
13 years 6 months ago
Graph Matching with Hierarchical Discrete Relaxation
Our aim in this paper is to develop a Bayesian framework for matching hierarchical relational models. Such models are widespread in computer vision. The framework that we adopt fo...
Richard C. Wilson, Edwin R. Hancock
ICML
1999
IEEE
14 years 6 months ago
Lazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
Zijian Zheng, Geoffrey I. Webb, Kai Ming Ting