Induction of Selective Bayesian Classifiers

@inproceedings{Langley1994InductionOS,
  title={Induction of Selective Bayesian Classifiers},
  author={Pat Langley and Stephanie Sage},
  booktitle={UAI},
  year={1994}
}
In this paper, we examine previous work on the naive Bayesian classifier and review its limitations, which include a sensitivity to correlated features. We respond to this problem by embedding the naive Bayesian induction scheme within an algorithm that carries out a greedy search through the space of features. We hypothesize that this approach will improve asymptotic accuracy in domains that involve correlated features without reducing the rate of learning in ones that do not. We report… Expand
Bayesian Network Classifiers
TLDR
Tree Augmented Naive Bayes (TAN) is single out, which outperforms naive Bayes, yet at the same time maintains the computational simplicity and robustness that characterize naive Baye. Expand
Naïve bayes variants in classification learning
TLDR
An overview of NB variants is presented and a categorization of those methods based on four dimensions including manipulating the set of attributes, allowing interdependencies, employing local learning and adjusting the probabilities by numeric weights is provided. Expand
Building Classifiers Using Bayesian Networks
TLDR
Tree Augmented Naive Bayes (TAN) is single out, which outperforms naive Bayes, yet at the same time maintains the computational simplicity and robustness which are characteristic of naive Baye. Expand
Learning the Structure of Augmented Bayesian Classifiers
TLDR
This work examines an approach where naive Bayes is augmented by the addition of correlation arcs between attributes, and explores two methods for finding the set of augmenting arcs, a greedy hill-climbing search, and a novel, more computationally efficient algorithm that is called SuperParent. Expand
Searching for Dependencies in Bayesian Classifiers
TLDR
It is shown that the backward sequential elimination and joining algorithm provides the most improvement over the naive Bayesian classifier and that the violations of the independence assumption that affect the accuracy of the classifier can be detected from training data. Expand
Randomized Bayesian Network Classifiers
TLDR
Randomized Bayesian Network Classifiers (RBNC) borrows the idea of ensemble learning by constructing a collection of semi-naive Bayesian network classifiers and then combines their predictions as the final output. Expand
1 . 2 Bayesian Network Learning
We propose two general heuristics to transform a batch Hill-climbing search into an incremental one. Our heuristics, when new data are available, study the search path to determine whether it isExpand
Algorithms for Learning Augmented Bayesian Classifiers
The naïve Bayes classifier is built on the assump tion of conditional independence between the attributes given the class . The algorithm has been shown to be surprisingly robust to obviousExpand
Survey of Improving Naive Bayes for Classification
TLDR
Four main improved approaches to naive Bayes are reviewed and some main directions for future research on Bayesian network classifiers are discussed, including feature selection, structure extension, local learning, and data expansion. Expand
A Comparison of Induction Algorithms for Selective and non-Selective Bayesian Classifiers
TLDR
This selective Bayesian network classifier selects a subset of attributes that maximizes predictive accuracy prior to the network learning phase, thereby learning Bayesian networks with a bias for small, high-predictive-accuracy networks. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 63 REFERENCES
Induction of Recursive Bayesian Classifiers
TLDR
A recursive algorithm is described that should outperform the simpler scheme in domains that involve disjunctive concepts, since they violate the independence assumption on which the latter relies. Expand
An Analysis of Bayesian Classifiers
TLDR
An average-case analysis of the Bayesian classifier, a simple induction algorithm that fares remarkably well on many learning tasks, and explores the behavioral implications of the analysis by presenting predicted learning curves for artificial domains. Expand
An Analysis of Bayesian Classiiers
In this paper we present an average-case analysis of the Bayesian classiier, a simple probabilistic induction algorithm that fares remarkably well on many learning tasks. Our analysis assumes aExpand
Semi-Naive Bayesian Classifier
In the paper the algorithm of the 'naive' Bayesian classifier (that assumes the independence of attributes) is extended to detect the dependencies between attributes. The idea is to optimize theExpand
A theory of learning classification rules
TLDR
A Bayesian theory of learning classi cation rules, the comparison and comparison of this theory with some previous theories of learning, and two extensive applications of the theory to the problems of learningclass probability trees and bounding error when learning logical rules are reported. Expand
Oblivious Decision Trees and Abstract Cases
TLDR
A new algorithm is presented, OBLIVION, that carries out greedy pruning of oblivious decision trees, which effectively store a set of abstract cases in memory, and it is hypothesized that this approach will efficiently identify relevant features even when they interact, as in parity concepts. Expand
Irrelevant Features and the Subset Selection Problem
TLDR
A method for feature subset selection using cross-validation that is applicable to any induction algorithm is described, and experiments conducted with ID3 and C4.5 on artificial and real datasets are discussed. Expand
AutoClass: A Bayesian Classification System
This paper describes AutoClass II, a program for automatically discovering (inducing) classes from a database, based on a Bayesian statistical technique which automatically determines the mostExpand
Average-Case Analysis of a Nearest Neighbor Algorithm
TLDR
An average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by many researchers, is presented, assuming a conjunctive target concept, noise-free Boolean attributes, and a uniform distribution over the instance space. Expand
Average-case analysis of a nearest neighbor algorthim
In this paper we present an average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by many researchers. Our analysis assumes a conjunctive targetExpand
...
1
2
3
4
5
...