Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Semi-naive Bayesian classifier
EWSL-91 Proceedings of the European working session on learning on Machine learning
C4.5: programs for machine learning
C4.5: programs for machine learning
Characterizing the applicability of classification algorithms using meta-level learning
ECML-94 Proceedings of the European conference on machine learning on Machine Learning
The nature of statistical learning theory
The nature of statistical learning theory
Machine learning, neural and statistical classification
Machine learning, neural and statistical classification
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Machine Learning - Special issue on learning with probabilistic representations
Machine Learning - Special issue on learning with probabilistic representations
Fast training of support vector machines using sequential minimal optimization
Advances in kernel methods
Meta Analysis of Classification Algorithms for Pattern Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Class prediction and discovery using gene expression data
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Complexity Measures of Supervised Classification Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Mixtures of Truncated Exponentials in Hybrid Bayesian Networks
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Data Complexity Analysis for Classifier Combination
MCS '01 Proceedings of the Second International Workshop on Multiple Classifier Systems
Pretopological Approach for Supervised Learning
ICPR '96 Proceedings of the International Conference on Pattern Recognition (ICPR '96) Volume IV-Volume 7472 - Volume 7472
On the Nonlinearity of Pattern Classifiers
ICPR '96 Proceedings of the International Conference on Pattern Recognition (ICPR '96) Volume IV-Volume 7472 - Volume 7472
An introduction to variable and feature selection
The Journal of Machine Learning Research
On Classifier Domains of Competence
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
Not So Naive Bayes: Aggregating One-Dependence Estimators
Machine Learning
An analysis of how training data complexity affects the nearest neighbor classifiers
Pattern Analysis & Applications
An error-counting network for pattern classification
Neurocomputing
The lack of a priori distinctions between learning algorithms
Neural Computation
Random k-Labelsets: An Ensemble Method for Multilabel Classification
ECML '07 Proceedings of the 18th European conference on Machine Learning
GAODE and HAODE: two proposals based on AODE to deal with continuous variables
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Domains of Competence of Artificial Neural Networks Using Measures of Separability of Classes
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
HODE: Hidden One-Dependence Estimator
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Classifier Chains for Multi-label Classification
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II
The WEKA data mining software: an update
ACM SIGKDD Explorations Newsletter
The landscape contest at ICPR 2010
ICPR'10 Proceedings of the 20th International conference on Recognizing patterns in signals, speech, images, and videos
Multi-dimensional classification with Bayesian networks
International Journal of Approximate Reasoning
Random k-Labelsets for Multilabel Classification
IEEE Transactions on Knowledge and Data Engineering
Information Sciences: an International Journal
MULAN: A Java Library for Multi-Label Learning
The Journal of Machine Learning Research
Information Sciences: an International Journal
Estimating continuous distributions in Bayesian classifiers
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Classifier selection based on data complexity measures
CIARP'05 Proceedings of the 10th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis and Applications
Data characterization for effective prototype selection
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Robust bayesian linear classifier ensembles
ECML'05 Proceedings of the 16th European conference on Machine Learning
Domain of competence of XCS classifier system in complexity measurement space
IEEE Transactions on Evolutionary Computation
Two-parameter Fisher criterion
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Approximating discrete probability distributions with dependence trees
IEEE Transactions on Information Theory
Analysis of data complexity measures for classification
Expert Systems with Applications: An International Journal
Hi-index | 0.07 |
The motivation for this paper comes from observing the recent tendency to assert that rather than a unique and globally superior classifier, there exist local winners. Hence, the proposal of new classifiers can be seen as an attempt to cover new areas of the complexity space of datasets, or even to compete with those previously assigned to others. Several complexity measures for supervised classification have been designed to define these areas. In this paper, we want to discover which type of datasets, defined by certain range values of the complexity measures for supervised classification, fits for some of the most well-known semi-naive Bayesian network classifiers. This study is carried out on continuous and discrete domains for naive Bayes and Averaged One-Dependence Estimators (AODE), which are two widely used incremental classifiers that provide some of the best trade-offs between error performance and efficiency. Furthermore, an automatic procedure to advise on the best semi-naive BNC to use for classification, based on the values of certain complexity measures, is proposed.