Discrete Bayesian Network Classifiers: A Survey
Open accessThe DOI matches its Crossref record; 191 of the 193 references it cites were found in a registry or an index.
Abstract
We have had to wait over 30 years since the naive Bayes model was first introduced in 1960 for the so-called Bayesian network classifiers to resurge. Based on Bayesian networks, these classifiers have many strengths, like model interpretability, accommodation to complex data and classification problem settings, existence of efficient algorithms for learning and classification tasks, and successful applicability in real-world problems. In this article, we survey the whole set of discrete Bayesian network classifiers devised to date, organized in increasing order of structure complexity: naive Bayes, selective naive Bayes, seminaive Bayes, one-dependence Bayesian classifiers, k -dependence Bayesian classifiers, Bayesian network-augmented naive Bayes, Markov blanket-based Bayesian classifier, unrestricted Bayesian classifiers, and Bayesian multinets. Issues of feature subset selection and generative and discriminative structure and parameter learning are also covered.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“These classifiers have several advantages, including model interpretation, compliance with complex data and classification problem environments, efficient learning and classification algorithms, and successful application to real-world problems [64].”
From Cost Overrun Risk Assessment and Prediction in Construction Projects: A Bayesian Network Classifier Approach (2022) · cites this paper as [64]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444 · cited 1×
“This structure is learned using a hill-climbing algorithm that compares candidate models with the Bayesian information criterion (BIC), whereas its parameters parameters are estimated using the EM algorithm [Dempster et al. 1977].”
MethodLecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
The WEKA data mining software: an update
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., & Witten, I. H. (2009) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1656274.1656278 · Cited by 17,750 · cited 1×
“…three — breast : left-or right-sided breast cancer — breast-quad : location of the tumor upper-outer, lower-outer, upper-inner, and lower-inner) plus the nipple as a central point — size : maximum excised tumor diameter (in mm), discretized into three equal-width WEKA [Hall et al. 2009] software.”
Method(1988) · Cited by 16,582
Hapeman, D. E. (1991) · Technometrics · doi:10.1080/00401706.1991.10484817 · Cited by 9,373
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947 · cited 1×
“The authors prove that the Markov blanket corresponds to the strongly relevant features as defined by Kohavi and John [1997].”
BackgroundProceedings of the 25th international conference on Machine learning - ICML '08
(2008) · doi:10.1145/1390156 · Cited by 6,680
A review of feature selection techniques in bioinformatics
Saeys, Y., Inza, I., & Larrañaga, P. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm344 · Cited by 5,244
Self-citationOn the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088 · cited 1×
“Thus, the bagging-randomTAN in Ma and Shi [2004] takes randomTAN as base classifiers in a bagging scheme.”
MethodFriedman, N., Geiger, D., & Goldszmidt, M. (1997) · Machine Learning · doi:10.1023/a:1007465528199 · Cited by 4,742 · cited 9×
“106 Bayesian network classifiers [Friedman et al. 1997] approximate p(x, c) with a fac- 107 torization according to a Bayesian network [Pearl 1988].”
BackgroundMethodInfluentialCausation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (1993) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2748-9 · Cited by 4,617
A Bayesian method for the induction of probabilistic networks from data
Cooper, G. F., & Herskovits, E. (1992) · Machine Learning · doi:10.1007/bf00994110 · Cited by 4,204 · cited 3×
“The three steps are guided by the K2 score [Cooper and Herskovits 1992], thereby requiring a node ordering .”
Method(1998) · Cited by 3,476
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
Heckerman, D., Geiger, D., & Chickering, D. M. (1995) · Machine Learning · doi:10.1023/a:1022623210503 · Cited by 3,231
Fibonacci heaps and their uses in improved network optimization algorithms
Fredman, M. L., & Tarjan, R. E. (1987) · Journal of the ACM · doi:10.1145/28869.28874 · Cited by 3,132
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
Proceedings of the 16th international joint conference on Artificial Intelligence - IJCAI '99
Colton, S., Bundy, A., & Walsh, T. (1999) · Cited by 2,500
Scaling Up the Accuracy of Naive-Bayes Classifiers : a Decision-Tree Hybrid
Kohavi, R. (1996) · Knowledge Discovery and Data Mining · Cited by 2,141
(2001) · Cited by 1,932
Approximating discrete probability distributions with dependence trees
Chow, C., & Liu, C. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054142 · Cited by 1,720 · cited 10×
“549 These ideas are adapted from Chow and Liu [1968], where several trees, one for each 550 value c of the class, were constructed rather than a single tree for the entire domain. 551 This works like TAN, but uses only the cases from D satisfying C = c to construct each 552 tree. This collection of trees is a special…”
MethodInfluentialSteps toward Artificial Intelligence
Minsky, M. (1961) · Proceedings of the IRE · doi:10.1109/jrproc.1961.287775 · Cited by 1,675 · cited 2×
“ACM Computing Surveys, 5:6 C. Bielza and P. Larra˜naga From a theoretical point of view, if all variables (predictors and class) are binary, the decision boundary has been shown to be a hyperplane [Minsky 1961].”
BackgroundAdvances in Neural Information Processing Systems 19 (NIPS 2006)
Simonotto, E., Whalley, H. C., Lawrie, S. M., Murray, L. M., McGonigle, D. J., & Storkey, A. (2006) · Cited by 1,651
Toward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
Learning and Revising User Profiles: The Identification of Interesting Web Sites
Pazzani, M., & Billsus, D. (1997) · Machine Learning · doi:10.1023/a:1007369909943 · Cited by 1,202 · cited 1×
“The most used scoring measure is the mutual information of each feature and the class variable I ( X i , C ) [Pazzani and Billsus 1997].”
MethodIdiot's Bayes—Not So Stupid After All?
Hand, D. J., & Yu, K. (2001) · International Statistical Review · doi:10.1111/j.1751-5823.2001.tb00465.x · Cited by 973 · cited 1×
“…because the decision boundaries may be insensitive to the specificities of the class-conditional probabilities p ( x i c ) [Domingos and Pazzani 1997]; that is, variance is reduced because few parameters are required and the biased probability estimates may not matter since [Hand and Yu 2001].”
BackgroundProceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010)
Adams, R. P., Dahl, G. E., & Murray, I. (2010) · Cited by 966
Equivalence and Synthesis of Causal Models
Verma, T., & Pearl, J. (2022) · Probabilistic and Causal Inference · doi:10.1145/3501714.3501732 · Cited by 964 · cited 1×
“Thus, an equivalence class includes equivalent networks, with the same skeleton (the undirected → Y → Z but with nonadjacent X and Y ) [Verma and Pearl 1990].”
BackgroundOn Relevance, Probabilistic Indexing and Information Retrieval
Maron, M. E., & Kuhns, J. L. (1960) · Journal of the ACM · doi:10.1145/321033.321035 · Cited by 907 · cited 2×
“WEKA was parameterized to run similar algorithms to those proposed in the literature and reviewed within this article: Maron and Kuhns [1960] for naive Bayes, Pazzani and Billsus [1997] for filter-based selective naive Bayes, and Langley and Sage [1994] for wrapper-based selective naive Bayes.”
BackgroundMethodEvaluating Learning Algorithms: A Classification Perspective
Japkowicz, N., & Shah, M. (2011) · doi:10.1017/cbo9780511921803 · Cited by 767
Michalski, R. S., Mozetič, I., Hong, J., & Nada Lavrač, A. (1986) · National Conference on Artificial Intelligence · Cited by 747
Not So Naive Bayes: Aggregating One-Dependence Estimators
Webb, G. I., Boughton, J. R., & Wang, Z. (2005) · Machine Learning · doi:10.1007/s10994-005-4258-6 · Cited by 708 · cited 1×
“The averaged one-dependence estimator (AODE) [Webb et al. 2005] averages the predictions of all qualified = , . . . SPODEs , , . . . , , where “qualified” means that it 1 sp n m instances verifying X = x .”
MethodMultivariate Information Transmission
McGill, W. J. (1954) · Psychometrika · doi:10.1007/bf02289159 · Cited by 686
(2011) · Cited by 675
Induction of Selective Bayesian Classifiers
LANGLEY, P., & SAGE, S. (1994) · Uncertainty Proceedings 1994 · doi:10.1016/b978-1-55860-332-5.50055-9 · Cited by 657
Theory Refinement on Bayesian Networks
Buntine, W. (1991) · Uncertainty Proceedings 1991 · doi:10.1016/b978-1-55860-203-8.50010-3 · Cited by 647
The Estimation of Probabilities: An Essay on Modern Bayesian Methods
Sparks, J. N., & Good, I. J. (1967) · American Educational Research Journal · doi:10.2307/1162122 · Cited by 528
Learning Belief Networks in the Presence of Missing Values and Hidden Variables
Friedman, N. (1997) · International Conference on Machine Learning · Cited by 488
Aliferis, C., Statnikov, A., Tsamardinos, I., Mani, S., & Koutsoukos, X. (2010) · doi:10.5555/1756006.1756013 · Cited by 469
Estimating probabilities: a crucial task in machine learning
Cestnik, B. (1990) · European Conference on Artificial Intelligence · Cited by 459
Algorithms for Large Scale Markov Blanket Discovery
Tsamardinos, I., Aliferis, C., & Statnikov, A. (2003) · Cited by 438
Feature Selection for Unbalanced Class Distribution and Naive Bayes
Mladenić, D., & Grobelnik, M. (1999) · Cited by 427
Filter versus wrapper gene selection approaches in DNA microarray domains
Inza, I., Larrañaga, P., Blanco, R., & Cerrolaza, A. J. (2004) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2004.01.007 · Cited by 425 · cited 3×
“This is why many researchers apply a wrapper strategy over a reduced 465 filtered subset, thereby adopting a filter-wrapper option [Inza et al. 2004].”
MethodInfluentialSelf-citationSobel, M. E., & Agresti, A. (1993) · Contemporary Sociology · doi:10.2307/2074579 · Cited by 407
Heuristic self-organization in problems of engineering cybernetics
Ivakhnenko, A. G. (1970) · Automatica · doi:10.1016/0005-1098(70)90092-0 · Cited by 390
Comparing Bayesian network classifiers
Cheng, J., & Greiner, R. (1999) · Cited by 368
Learning limited dependence Bayesian classifiers
Sahami, M. (1996) · Cited by 363
A Novel Bayes Model: Hidden Naive Bayes
Jiang, L., Zhang, H., & Cai, Z. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.234 · Cited by 358 · cited 1×
“This was proposed by Jiang et al. [2009], resulting in ⎛ ⎞ schemes, based on performance measures of the different ODE models, like AUC or classification accuracy. using any SPODE variable H ), with the aim of representing the links existing in the n SPODE models.”
MethodGoldszmidt, M. (2011) · Wiley Encyclopedia of Operations Research and Management Science · doi:10.1002/9780470400531.eorms0099 · Cited by 351
Time and sample efficient discovery of Markov blankets and direct causal relations
Tsamardinos, I., Aliferis, C. F., & Statnikov, A. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956838 · Cited by 343 · cited 1×
“Table I. Properties of the Main GS [Margaritis and Thrun IAMB [Tsamardinos and Aliferis HITON [Aliferis et al MMMB [Tsamardinos et al. 2003b] different Markov blankets.”
BackgroundThe Estimation of Probabilities: An Essay on Modern Bayesian Methods
Hill, B. M., & Good, I. J. (1965) · Journal of the American Statistical Association · doi:10.2307/2283422 · Cited by 337
Neural Networks for Pattern Recognition
Kothari, S. C., & Oh, H. (1993) · Advances in Computers · doi:10.1016/s0065-2458(08)60404-0 · Cited by 316 · cited 1×
“When computing p ( c | x ) from the joint probability distribution given by a naive Bayes model, it has been shown [Bishop 1995] to be a linear softmax regression.”
MethodHITON: a novel Markov Blanket algorithm for optimal variable selection.
Aliferis, C., Tsamardinos, I., & Statnikov, A. (2003) · Europe PMC (PubMed Central) · Cited by 315
Bayesian Network Induction via Local Neighborhoods
Margaritis, D., & Thrun, S. (1999) · Cited by 313
Comparison of Discrimination Techniques Applied to a Complex Data Set of Head Injured Patients
Titterington, D. M., Murray, G. D., Murray, L. S., Spiegelhalter, D. J., Skene, A. M., Habbema, J. D. F., & Gelpke, G. J. (1981) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981918 · Cited by 305
Learning Bayesian network classifiers by maximizing conditional likelihood
Grossman, D., & Domingos, P. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015339 · Cited by 299 · cited 1×
“The CLL function is used in Grossman and Domingos [2004] to learn the structure of the network, where the maximum number of parents per variable is bounded, while parameters are approximated by their maximum likelihood estimates (MLEs), which score ( CMDL).”
MethodA Transformational Characterization of Equivalent Bayesian Network Structures
Chickering, D. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.4938 · Cited by 296 · cited 1×
“Using the procedure described in Chickering [1995], each Bayesian network is converted into a partially directed acyclic graph (PDAG).”
MethodLearning Bayesian Belief Network Classifiers: Algorithms and System
Cheng, J., & Greiner, R. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45153-6_14 · Cited by 284 · cited 4×
“The complexity of algorithms that learn Bayesian networks from data identifying high-scoring structures in which each node has at most k parents, for all k ≥ 3, has been shown to be NP hard [Chickering et al. 2004]. It holds whenever the learning algorithm uses a consistent scoring criterion and is applied to a suffic…”
BackgroundMethodInfluentialFrank, E., Hall, M., & Pfahringer, B. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1212.2487 · Cited by 273 · cited 1×
“Optionally, for each new case to be classified, a (local) naive [Frank et al. 2003], since the instances in the neighborhood are weighted, attaching less weight to instances that are further from the test instance.”
BackgroundMachine Learning Methods for Predicting Failures in Hard Drives: A Multiple-Instance Application
Murray, J. F., Hughes, G. F., & Kreutz-Delgado, K. (2005) · doi:10.5555/1046920.1088699 · Cited by 259
Data Analysis with Bayesian Networks: A Bootstrap Approach
Friedman, N., Goldszmidt, M., & Wyner, A. J. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.6695 · Cited by 255
Lazy Learning of Bayesian Rules
Zheng, Z., & Webb, G. I. (2000) · Machine Learning · doi:10.1023/a:1007613203719 · Cited by 247 · cited 1×
“Finally, the lazy Bayesian rule learning algorithm [Zheng and Webb 2000] induces a rule for each example, whose antecedent is a variable-value conjunction while”
MethodProceedings of the 10th IEEE International Conference on Data Mining (ICDM)
Webb, G. I., Liu, B., Zhang, C., Gunopulos, D., & Wu, X. (2010) · Cited by 247
Towards Principled Feature Selection: Relevancy, Filters and Wrappers
Tsamardinos, I., & Aliferis, C. (2003) · Cited by 238
Feature Subset Selection by Bayesian network-based optimization
Inza, I., Larrañaga, P., Etxeberria, R., & Sierra, B. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00052-7 · Cited by 234 · cited 1×
“The strategies used range from simple heuristics, like greedy forward [Langley and Sage 1994] and floating search [Pernkopf and O’Leary 2003], to more sophisticated population-based heuristics, like genetic estimation of distribution algorithms [Inza et al. 2000].”
MethodSelf-citationKnowledge representation and inference in similarity networks and Bayesian multinets
Geiger, D., & Heckerman, D. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00014-3 · Cited by 228 · cited 1×
“This collection of trees is a special case of a Bayesian multinet, a terminology introduced by Geiger and Heckerman [1996] for the first time (see Section 9).”
BackgroundTowards scalable and data efficient learning of Markov boundaries
Peña, J. M., Nilsson, R., Björkegren, J., & Tegnér, J. (2007) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2006.06.008 · Cited by 217 · cited 7×
“This drawback is overcome by KIAMB [Pe˜na et al. 2007], a stochastic version of IAMB , which is not only correct and scalable like IAMB but also data efficient unlike IAMB.”
BackgroundMethodInfluentialClassification with Hybrid Generative/Discriminative Models
Raina, R., Shen, Y., McCallum, A., & Ng, A. Y. (2003) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · Cited by 201
Idiot's Bayes: Not So Stupid after All?
Hand, D. J., & Yu, K. (2001) · International Statistical Review · doi:10.2307/1403452 · Cited by 190
Speculative Markov Blanket Discovery for Optimal Feature Selection
Yaramakala, S., & Margaritis, D. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.134 · Cited by 190 · cited 1×
“The approach taken in Zhang et al. [2004] is more general, since many hidden variables are arranged in a tree-shaped Bayesian network called hierarchical naive Bayes.”
MethodConstruction of Bayesian network structures from data: A brief survey and an efficient algorithm
Singh, M., & Valtorta, M. (1995) · International Journal of Approximate Reasoning · doi:10.1016/0888-613x(94)00016-v · Cited by 175
Test-Cost Sensitive Naive Bayes Classification
Chai, X., Deng, L., Yang, Q., & Ling, C. X. (2005) · Proceedings · doi:10.1109/icdm.2004.10092 · Cited by 173 · cited 1×
“Wecanconsider the associated costs of obtaining the missing values in a new case to be classifier is proposed in Chai et al. [2004], whose aim is to minimize the expected loss by finding how the unknown test variables should be chosen (sequentially or batch-wise).”
BackgroundA decision tree-based attribute weighting filter for naive Bayes
Hall, M. (2007) · Knowledge-Based Systems · doi:10.1016/j.knosys.2006.11.008 · Cited by 169
On the Naive Bayes Model for Text Categorization.
Eyheramendy, S., Lewis, D. D., & Madigan, D. (2003) · Cited by 167
Robust Learning with Missing Data
Ramoni, M., & Sebastiani, P. (2001) · Machine Learning · doi:10.1023/a:1010968702992 · Cited by 167 · cited 1×
“This is why the robust Bayesian [2001b] to learn conditional probability distributions from incomplete datasets without any assumption about the missing data mechanism.”
BackgroundLearning weighted naive Bayes with accurate ranking
Zhang, H., & Sheng, S. (2004) · Fourth IEEE International Conference on Data Mining (ICDM'04) · doi:10.1109/icdm.2004.10030 · Cited by 164 · cited 2×
“The ideas are extended in Zhang and Sheng [2004] to a weighted naive Bayes several heuristics.”
BackgroundMethodImproving Tree augmented Naive Bayes for class probability estimation
Jiang, L., Cai, Z., Wang, D., & Zhang, H. (2011) · Knowledge-Based Systems · doi:10.1016/j.knosys.2011.08.010 · Cited by 153 · cited 4×
“This was proposed by Jiang et al. [2009], resulting in 701”
MethodInfluentialFeature selection for the naive bayesian classifier using decision trees
Ratanamahatana, C. "., & Gunopulos, D. (2003) · Applied Artificial Intelligence · doi:10.1080/713827175 · Cited by 146
Zaffalon, M. (2002) · Journal of Statistical Planning and Inference · doi:10.1016/s0378-3758(01)00201-4 · Cited by 144 · cited 1×
“The naive credal classifier [Zaffalon 2002] uses the class posterior probability intervals and a dominance criterion to obtain the output of the classification procedure, which, in this case, can be a set of labels instead of singletons. effects of parameter inaccuracies are investigated in Renooij…”
MethodGreiner, R., Su, X., Shen, B., & Zhou, W. J. (2005) · Machine Learning · doi:10.1007/s10994-005-0469-0 · Cited by 137 · cited 9×
“1112 For a fixed Bayesian network structure, finding the values θi jk for the conditional 1113 probability tables that maximize the CLL is NP hard for a given incomplete dataset 1114 [Greiner et al. 2005], something more readily solved in generative models maximizing 1115 the likelihood, which have straightforward EM…”
BackgroundMethodInfluentialNomograms for Visualization of Naive Bayesian Classifier
Možina, M., Demšar, J., Kattan, M. W., & Zupan, B. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30116-5_32 · Cited by 133 · cited 1×
“Most are based on an equivalent expression While software [Moˇzina et al. 2004] uses nomograms to represent the additive influence of each predictor value, ExplainD [Poulin et al. 2006] uses bar-based charts with different levels of explanation capabilities.”
MethodOn Discriminative Bayesian Network Classifiers and Logistic Regression
Roos, T., Wettig, H., Grünwald, P., Myllymäki, P. J., & Tirri, H. (2005) · Machine Learning · doi:10.1007/s10994-005-0471-6 · Cited by 133
Bilmes, J. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.3837 · Cited by 128
Ramoni, M. F., & Sebastiani, P. (2001) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00085-0 · Cited by 120 · cited 1×
“5 algorithm would use in its classification tree, as in Ratanamahatana and Gunopulos [2003]. A Bayesian criterion for feature selection proposed in Kontkanen et al.”
MethodDiscriminative parameter learning for Bayesian networks
Su, J., Zhang, H., Ling, C. X., & Matwin, S. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390284 · Cited by 115 · cited 1×
“Going through all the training data, the update at iteration t 1 consists of summing, for each instance x , the difference between the true posterior probability | t ( t + 1) ijk ( t ) ( c t approach was proposed in Su et al. [2008] and named frequency estimate (DFE).”
MethodBayesian network classifiers versus selective -NN classifier
Pernkopf, F. (2004) · Pattern Recognition · doi:10.1016/j.patcog.2004.05.012 · Cited by 115 · cited 3×
“A conjugate gradient algorithm is instead proposed in Pernkopf et al. [2012] and is advantageous in terms of computational requirements. (c) Generative-discriminative learning. Some researchers try to take advantage of the best of both approaches through hybrid parameter learning (partly generative and partly discrimi…”
BackgroundMethodOn the classification performance of TAN and general Bayesian networks
Madden, M. G. (2009) · Knowledge-Based Systems · doi:10.1016/j.knosys.2008.10.006 · Cited by 104 · cited 1×
“However, some relevant papers, already cited within this survey [Friedman et al. 1997; Cheng and Greiner 1999, 2001; Pernkopf 2005; Madden 2009], do include empirical comparisons of the algorithms for learning naive Bayes, TAN, BAN, unrestricted Bayesian classi-fiers, and Bayesian multinets.”
BackgroundModel Averaging for Prediction with Discrete Bayesian Networks
Dash, D. H., & Cooper, G. F. (2004) · Journal of Machine Learning Research · doi:10.5555/1005332.1044699 · Cited by 100
Constructive Induction of Cartesian Product Attributes
Pazzani, M. J. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5725-8_21 · Cited by 96 · cited 1×
“The seminaive Bayes model of Pazzani [1996] starts from an empty structure and classi-fier as conditionally independent of the features (original or Cartesian products) used in the classifier, and (b) joining a variable not used by the current classifier with each feature (original or Cartesian…”
MethodConstructing Bayesian networks to predict uncollectible telecommunications accounts
Ezawa, K. J., & Norton, S. W. (1996) · IEEE Expert · doi:10.1109/64.539016 · Cited by 96 · cited 1×
“The first reference to a learning algorithm for this model is Ezawa and Norton [1996]. 783 First, it ranks the n predictor variables based on I(Xi, C), and then it selects the min784 imum number of predictor variables k verifying ∑k j=1 I(Xj, C) ≥ tC X ∑n j=1 I(Xj, C), 785”
MethodInduction of recursive Bayesian classifiers
Langley, P. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56602-3_134 · Cited by 93 · cited 1×
“Thus , the recursive Bayesian classifier [Langley 1993] observes each predicted label (given by the naive Bayes) separately.”
MethodClassification using Hierarchical Naïve Bayes models
Helge Langseth, A., & Nielsen, T. D. (2006) · Machine Learning · doi:10.1007/s10994-006-6136-2 · Cited by 92
Weighted average of one-dependence estimators†
Jiang, L., Zhang, H., Cai, Z., & Wang, D. (2011) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/0952813x.2011.639092 · Cited by 91
Greiner, R., & Zhou, W. J. (2002) · doi:10.5555/777092.777121 · Cited by 87
Adjusted probability Naive Bayesian induction
Webb, G. I., & Pazzani, M. J. (1998) · Lecture notes in computer science · doi:10.1007/bfb0095060 · Cited by 83
Random Multiclass Classification: Generalizing Random Forests to Random MNL and Random NB
Prinzie, A. A., & den Poel, D. V. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74469-6_35 · Cited by 83
LEARNING THE STRUCTURE OF AUGMENTED BAYESIAN CLASSIFIERS
Keogh, E., & Pazzani, M. J. (2002) · International Journal of Artificial Intelligence Tools · doi:10.1142/s0218213002001052 · Cited by 83 · cited 1×
“The search is based on the hill-climbing algorithm described in Keogh and Pazzani [2002] (see Section 6.1).”
MethodInfluentialEfficient learning of selective Bayesian network classifiers
Singh, M., & Provan, G. M. (1996) · Cited by 81
Blanco, R. E., Inza, I., Merino, M., Quiroga, J. A., & Larrañaga, P. (2005) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2005.05.004 · Cited by 81
Self-citationProceedings of the International Joint Conference on Neural Networks (IJCNN) 2005
(2005) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2005.1556050 · Cited by 80
Jebara, T. (2004) · Springer eBooks · doi:10.1007/978-1-4419-9011-2 · Cited by 79
Interpretable boosted naïve Bayes classification
Ridgeway, G. K., Madigan, D., Richardson, T. S., & O’Kane, J. W. (1998) · Cited by 77
Sierra, B., & Larrañaga, P. (1998) · Artificial Intelligence in Medicine · doi:10.1016/s0933-3657(98)00024-4 · Cited by 77
Self-citationBudgeted learning of nailve-bayes classifiersPreprint
Lizotte, D. J., Madani, O., & Greiner, R. (2002) · arXiv (Cornell University) · Cited by 76
Wiley Encyclopedia of Operations Research and Management Science
Hannabuss, S. (2012) · Reference Reviews · doi:10.1108/09504121211205115 · Cited by 75
Learning Bayesian Network Classifiers: Searching in a Space of Partially Directed Acyclic Graphs
Acid, S., de Campos, L. M., & Castellano, J. G. (2005) · Machine Learning · doi:10.1007/s10994-005-0473-4 · Cited by 69 · cited 3×
“Instead of searching the Bayesian classifier in the space of DAGs, we can use a reduced search space that consists of a type of PDAGs, called class-focused restricted PDAGs (C-RPDAGs) [Acid et al. 2005]. C-RPDAGs combine two concepts of DAG equivalence: independence equivalence and a new concept, classification equiva…”
MethodRank three permutation groups with rank three subconstituents
Cameron, P. J., & Macpherson, D. (1985) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(85)90034-6 · Cited by 68
Naive Bayes for optimal ranking
Zhang, H., & Su, J. (2008) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/09528130701476391 · Cited by 68 · cited 1×
“…question is to examine this model’s ranking behavior in terms of a well-known ranking quality measure results on its optimality for ranking m -of- n concepts are given in Zhang and Su [2008], unlike for classification, where naive Bayes cannot learn all m -of- n concepts [Domingos and Pazzani 1997].”
BackgroundDiscriminative versus generative parameter and structure learning of Bayesian network classifiers
Pernkopf, F., & Bilmes, J. (2005) · International Conference on Machine Learning · doi:10.1145/1102351.1102434 · Cited by 67
Proceedings of the 31st Conference on Uncertainty in Artificial Intelligence (UAI-15)
Albrecht, S. V., & Ramamoorthy, R. (2015) · Cited by 67
Naïve bayes variants in classification learning
Al-Aidaroos, K. M., Bakar, A. A., & Othman, Z. (2010) · International Conference on Information Retrieval & Knowledge Management (CAMP) · doi:10.1109/infrkm.2010.5466902 · Cited by 65
Boosted Bayesian network classifiers
Jing, Y., Pavlović, V., & Rehg, J. M. (2008) · Machine Learning · doi:10.1007/s10994-008-5065-7 · Cited by 63 · cited 1×
“This scheme is employed in the boosted augmented naive Bayes ( b AN) [Jing et al. 2008].”
MethodEfficient lazy elimination for averaged one-dependence estimators
Zheng, F., & Webb, G. I. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143984 · Cited by 62
Discriminative Learning of Bayesian Networks via Factorized Conditional Log-Likelihood
Carvalho, A. M., Roos, T., Oliveira, A. L., & Myllymäki, P. J. (2011) · Työväentutkimus Vuosikirja · doi:10.5555/1953048.2021070 · Cited by 62 · cited 1×
“The factorized conditional log-likelihood ( ˆ f CLL) is introduced in Carvalho et al. [2011 ] with the properties of being decomposable and score equivalent for BAN classifiers.”
Robust Bayesian Linear Classifier Ensembles
Cerquides, J., & de Mántaras, R. L. (2005) · Lecture notes in computer science · doi:10.1007/11564096_12 · Cited by 61 · cited 1×
“These two last schemes differ as to the posterior, generative, or discriminative models (see Cerquides and L´opez de M´antaras [2005a] for further details).”
Background(2004) · Studies in fuzziness and soft computing · doi:10.1007/978-3-540-39879-0 · Cited by 59
Face detection by aggregated Bayesian network classifiers
Pham, T. V., Worring, M., & Smeulders, A. W. M. (2002) · Pattern Recognition Letters · doi:10.1016/s0167-8655(01)00177-5 · Cited by 57 · cited 1×
“2005]: p(c|x) ∝ p(c)p(x2|c, x3)p(x3|c)p(x4|c, x3); (d) Bayesian multinet as a collection of forests [Pham et al. 2002]: p(C = 0|x) ∝ p(C = 0)p(x1|C = 0)p(x2|C = 0, x1)p(x3|C = 0, x4)p(x4|C = 0)p(x5|C = 0, x4) and p(C = 1|x) ∝ p(C = 1)p(x1|C = 1, x3)p(x2|C = 1)p(x3|C = 1)p(x4|C = 1, x2)p(x5|C = 1, x3); (e) FAN [Lucas 2…”
Maximum Margin Bayesian Network Classifiers
Pernkopf, F., Wohlmayr, M., & Tschiatschek, S. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.149 · Cited by 57 · cited 1×
“All the algorithms initialize the parameters to the MLEs. to maximize the minimum conditional likelihood ratio (MCLR): 5:30 C. Bielza and P. Larra˜naga A conjugate gradient algorithm is instead proposed in Pernkopf et al. [2012] and is advantageous in terms of computational requirements.”
MethodUsing hidden nodes in Bayesian networks
Kwoh, C.-K., & Gillies, D. F. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00119-0 · Cited by 57 · cited 1×
“This is the approach reported in Kwoh and Gillies [1996], where the conditional probabilities attached to the hidden node are determined using a gradient descent method.”
MethodSierra, B., Serrano, N., Larrañaga, P., Plasencia, E. J., Inza, I., Jiménez, J. J., Revuelta, P., & Mora, M. L. (2001) · Artificial Intelligence in Medicine · doi:10.1016/s0933-3657(00)00111-1 · Cited by 55
Self-citationA Decomposition of Classes via Clustering to Explain and Improve Naive Bayes
Vilalta, R., & Rish, I. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39857-8_40 · Cited by 53 · cited 1×
“This is proposed in Vilalta and Rish [2003], where a naive Bayes is then learned over this new dataset, and finally the predicted (extended) labels are mapped to the original space of labels.”
BackgroundNaive bayesian classifier committees
Zheng, Z. (1998) · Lecture notes in computer science · doi:10.1007/bfb0026690 · Cited by 53 · cited 1×
“The naive Bayesian classifier committee [Zheng 1998] sequentially generates selective naive Bayes models to be members of the committee.”
MethodOn Pairwise Naive Bayes Classifiers
Sulzmann, J.-N., Fürnkranz, J., & Hüllermeier, E. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74958-5_35 · Cited by 52
Towards efficient variables ordering for Bayesian networks classifier
Junior, E. R. H., & Ebecken, N. F. F. (2007) · Data & Knowledge Engineering · doi:10.1016/j.datak.2007.02.003 · Cited by 51
The TM algorithm for maximising a conditional likelihood function
Edwards, D., & Lauritzen, S. L. (2001) · Biometrika · doi:10.1093/biomet/88.4.961 · Cited by 49 · cited 1×
“…min i = 1 ,..., N d ( i ) , is relaxed with a soft margin, finally defining the maximum margin score of a structure as (cid:2) Ni = 1 min 1 log d , where 0 is a scaling parameter and is set by AsinSection 3.7 with Bayes, the TM algorithm [Edwards and Lauritzen 2001] can [Santaf´e et al. 2005].”
MethodInfluentialLiu, J., Li, B., & Dillon, T. S. (2001) · IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews) · doi:10.1109/5326.941848 · Cited by 48
Yang, Y., Webb, G. I., Cerquides, J., Korb, K. B., Boughton, J. R., & Ting, K. M. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190650 · Cited by 48
Learning Bayesian Networks Using Feature Selection
Provan, G. M., & Singh, M. (1996) · Lecture notes in statistics · doi:10.1007/978-1-4612-2404-4_28 · Cited by 47 · cited 1×
“The K2-attribute selection (K2-AS) algorithm [Provan and Singh 1995] consists of two main steps.”
MethodLatent variable discovery in classification models
Zhang, N. L., Nielsen, T. D., & Jensen, F. V. (2004) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2003.11.004 · Cited by 47
Ensemble Selection for SuperParent-One-Dependence Estimators
Yang, Y., Korb, K. B., Ting, K. M., & Webb, G. I. (2005) · Lecture notes in computer science · doi:10.1007/11589990_13 · Cited by 45
Structure identification of Bayesian classifiers based on GMDH
Xiao, J., He, C., & Jiang, X. (2009) · Knowledge-Based Systems · doi:10.1016/j.knosys.2009.06.005 · Cited by 43
Bayesian network multi-classifiers for protein secondary structure prediction
Robles, V., Larrañaga, P., Peña, J. M., Menasalvas, E., Pérez, M. S., Herves, V., & Wasilewska, A. (2004) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2004.01.009 · Cited by 43
Self-citationRestricted Bayesian Network Structure Learning
Lucas, P. (2004) · Studies in fuzziness and soft computing · doi:10.1007/978-3-540-39879-0_12 · Cited by 42 · cited 3×
“The forest-augmented naive Bayes (FAN) was first defined in Lucas [2004], with only one rather than a collection of forests in the predictor subgraph, augmented with a naive (Figure 7(e)).”
MethodAlternative prior assumptions for improving the performance of naïve Bayesian classifiers
Wong, T.-T. (2008) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-008-0101-6 · Cited by 41 · cited 1×
“These constraints deteriorate the performance of the naive Bayes classifier and motivate the introduction of other prior distributions, like the generalized Dirichlet and the Liouville distributions [Wong 2009].”
BackgroundBayesian classification for data from the same unknown class
Huang, H.-J., & Hsu, C. (2002) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/3477.990870 · Cited by 41
da Gama, J. M. P. (2003) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00179-2 · Cited by 40
Bagging k-dependence probabilistic networks: An alternative powerful fraud detection tool
Louzada, F., & Ara, A. (2012) · Expert Systems with Applications · doi:10.1016/j.eswa.2012.04.024 · Cited by 39 · cited 1×
“A combination of k-DB models in a bagging fashion is proposed in 764 Louzada and Ara [2012]. 765”
MethodEfficient Heuristics for Discriminative Structure Learning of Bayesian Network Classifiers
Pernkopf, F., & Bilmes, J. (2010) · doi:10.5555/1756006.1859932 · Cited by 37
Stochastic margin-based structure learning of Bayesian network classifiers
Pernkopf, F., & Wohlmayr, M. (2012) · Pattern Recognition · doi:10.1016/j.patcog.2012.08.007 · Cited by 37
A novel Markov boundary based feature subset selection algorithm
de Morais, S. R., & Aussem, A. (2009) · Neurocomputing · doi:10.1016/j.neucom.2009.05.018 · Cited by 34
Feature selection for Bayesian network classifiers using the MDL-FS score
Drugan, M. M., & Wiering, M. (2010) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2010.02.001 · Cited by 34
Exact model averaging with naive Bayesian classifiers
Dash, D. H., & Cooper, G. F. (2002) · Cited by 33
TAN Classifiers Based on Decomposable Distributions
Cerquides, J., & de Mántaras, R. L. (2005) · Machine Learning · doi:10.1007/s10994-005-0470-7 · Cited by 33
Discriminative Model Selection for Belief Net Structures
Greiner, R., & Guo, Y. (2004) · doi:10.7939/r3610vr65 · Cited by 32
Naïve Bayes Ensembles with a Random Oracle
Rodríguez, J. J., & Kuncheva, L. I. (2007) · Springer eBooks · doi:10.1007/978-3-540-72523-7_45 · Cited by 31 · cited 1×
“Finally, two naive Bayes can be used as the base classifier in a random oracle classifier [ Rodr´ıguez and Kuncheva 2007].”
MethodMaximum Margin Bayesian NetworksPreprint
Guo, Y., Wilkinson, D. F., & Schuurmans, D. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.1382 · Cited by 30
Tree-Based Credal Networks for Classification
Zaffalon, M., & Fagiuoli, E. (2003) · Reliable Computing · doi:10.1023/a:1025822321743 · Cited by 29 · cited 1×
“The tree-based credal classifier algorithm that is able to induce credal Bayesian networks with a TAN structure is proposed in Zaffalon and Fagiuoli [2003] for the second case.”
MethodSierra, B., Lazkano, E., Jauregi, E., & Irigoien, I. (2009) · Decision Support Systems · doi:10.1016/j.dss.2009.07.010 · Cited by 27 · cited 2×
“2011], ACL-MLE [Burge and Lane 2005], EAR [Narasimhan and Bilmes 2005], MDL-FS [Drugan and Wiering 2010], Hist-dist [Sierra et al. 2009] Parameter learning Discriminative LR-Roos [Roos et al.”
MethodHwang, K., & Zhang, B.-T. (2005) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2005.850162 · Cited by 25
Proceedings of the 6th International Symposium on Intelligent Data Analysis (IDA'06)
Gyftodimos, E., & Flach, P. A. (2005) · Cited by 25
A Bayesian Network Classifier that Combines a Finite Mixture Model and a Naive Bayes ModelPreprint
Monti, S., & Cooper, G. F. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.6723 · Cited by 24 · cited 1×
“Second, the finite-mixture-augmented naive Bayes [Monti and Cooper 1999] is a combination of this model and naive Bayes.”
MethodIbáñez, A., Bielza, C., & Larrañaga, P. (2014) · Neurocomputing · doi:10.1016/j.neucom.2013.08.042 · Cited by 24 · cited 1×
“For general loss functions, a cost-sensitive naive Bayes selects, 355 for each instance x, the class value minimizing the expected loss [Ibáñez et al. 2014] of 356 predictions.”
BackgroundSelf-citationDiscriminative training of Bayesian Chow-Liu multinet classifiers
Huang, K., King, I., & Lyu, M. R.-T. (2004) · doi:10.1109/ijcnn.2003.1223394 · Cited by 22 · cited 1×
“The trees in Huang et al. [2003] are learned by optimizing a function that includes a penalty term representing the divergence trees in Gurwicz and Lerner [2006] are learned from all instances, instead of learning the local structures from only those instances with C = c .”
MethodFloating search algorithm for structure learning of Bayesian network classifiers
Pernkopf, F., & O’Leary, P. (2003) · Pattern Recognition Letters · doi:10.1016/s0167-8655(03)00142-9 · Cited by 22 · cited 1×
“The strategies used range from simple heuristics, like greedy forward [Langley and Sage 1994] and floating search [Pernkopf and O’Leary 2003], to more sophisticated population-based heuristics, like genetic estimation of distribution algorithms [Inza et al. 2000].”
MethodTabu Search-Enhanced Graphical Models for Classification in High Dimensions
Bai, X., Padman, R., Ramsey, J., & Spirtes, P. (2008) · INFORMS journal on computing · doi:10.1287/ijoc.1070.0255 · Cited by 22 · cited 1×
“A two-stage algorithm called tabu search-enhanced Markov 972 blanket is presented in Bai et al. [2008]. In the first stage, an initial Markov blanket is 973”
MethodA hybrid generative/discriminative approach to text classification with additional information
Fujino, A., Ueda, N., & Saito, K. (2006) · Information Processing & Management · doi:10.1016/j.ipm.2006.07.013 · Cited by 21 · cited 2×
“2012] GenerativeDiscriminative Normalized hybrid [Raina et al. 2004; Fujino et al. 2007], JoDiG [Xue and Titterington 2010], HBayes [Kang and Tian 2006], Bayesian blending [Bishop and Lasserre 2007]”
BackgroundMethodLearning the Tree Augmented Naive Bayes Classifier from incomplete datasets.
François, O., & Leray, P. (2006) · Probabilistic Graphical Models · Cited by 20
Building Bayesian network classifiers through a Bayesian complexity monitoring system
Ruz, G. A., & Pham, D. T. (2008) · Proceedings of the Institution of Mechanical Engineers Part C Journal of Mechanical Engineering Science · doi:10.1243/09544062jmes1243 · Cited by 19
Evidence and scenario sensitivities in naive Bayesian classifiers
Renooij, S., & van der Gaag, L. C. (2008) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2008.02.008 · Cited by 19 · cited 1×
“…intervals and a dominance criterion to obtain the output of the classification procedure, which, in this case, can be a set of labels instead of singletons. effects of parameter inaccuracies are investigated in Renooij and van der Gaag [2008] with sensitivity analysis techniques techniques.”
MethodTree-augmented naive Bayes ensembles
Ma, S., & Shi, H. (2005) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc.2004.1382010 · Cited by 19 · cited 1×
“Thus, the bagging-randomTAN in Ma and Shi [2004] takes randomTAN as base classifiers in a bagging scheme.”
MethodA Hybrid Generative/Discriminative Bayesian Classifier.
Kang, C., & Tian, J. W. (2006) · Cited by 17
Local Learning Algorithm for Markov Blanket Discovery
Fu, S., & Desmarais, M. C. (2007) · Springer eBooks · doi:10.1007/978-3-540-76928-6_9 · Cited by 17 · cited 1×
“A faster PCMB called breadth-first search of Markov blanket (BFMB) [Fu and Desmarais 2007] relies on fewer data passes and conditioning on the minimum set. to existing state-of-the-art (HITON and MMPC) algorithms.”
BackgroundA New Bayesian Network Structure for Classification Tasks
Madden, M. G. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45750-x_27 · Cited by 17
Lazy Averaged One-Dependence Estimators
Jiang, L., & Zhang, H. (2006) · Lecture notes in computer science · doi:10.1007/11766247_44 · Cited by 16 · cited 1×
“Another improvement is the lazy AODE [Jiang and Zhang 2006], which builds an AODE for each test instance. The training data is expanded by adding a number of copies (clones) of each training instance equal to its similarity to the test instance. This similarity is the number of identical predictor variables. Since AOD…”
MethodSupervised Classification with Bayesian Networks
Flores, M. J., Gámez, J. A., & Martínez, A. M. (2012) · IGI Global eBooks · doi:10.4018/978-1-4666-1806-0.ch005 · Cited by 15
BAYDA: software for Bayesian classification and feature selection
Kontkanen, P. T., Myllymäki, P. J., Silander, T., & Tirri, K. A. (1998) · Cited by 14
HODE: Hidden One-Dependence Estimator
Flores, M. J., Gámez, J. A., Martínez, A. M., & Puerta, J. M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02906-6_42 · Cited by 14 · cited 1×
“704 The hidden one-dependence estimator classifier (HODE) [Flores et al. 2009] avoids 705 using any SPODE.”
MethodInterval Estimation Naïve Bayes
Robles, V., Larrañaga, P., Peña, J. M., Menasalvas, E., & Pérez, M. S. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45231-7_14 · Cited by 14
Self-citationLearning class-discriminative dynamic Bayesian networks
Burge, J., & Lane, T. D. R. (2005) · International Conference on Machine Learning · doi:10.1145/1102351.1102364 · Cited by 14
On Discriminative Parameter Learning of Bayesian Network Classifiers
Pernkopf, F., & Wohlmayr, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04174-7_15 · Cited by 10 · cited 1×
“Three Wohlmayr [2009] for naive Bayes, TAN, or 2-DB structures.”
MethodBayesian network classifiers: Beyond classification accuracy
dos Santos, E. B., Junior, E. R. H., Hruschka, E. R., & Ebecken, N. F. F. (2011) · Intelligent Data Analysis · doi:10.3233/ida-2010-0468 · Cited by 10
Bayesian Class-Matched Multinet Classifier
Gurwicz, Y., & Lerner, B. (2006) · Lecture notes in computer science · doi:10.1007/11815921_15 · Cited by 10 · cited 1×
“The trees in Huang et al. [2003] are learned by optimizing a function that includes a penalty term representing the divergence trees in Gurwicz and Lerner [2006] are learned from all instances, instead of learning the local structures from only those instances with C = c .”
MethodBounds for the Loss in Probability of Correct Classification Under Model Based Approximation
Ekdahl, M., & Koski, T. (2006) · Cited by 10
Joint discriminative–generative modelling based on statistical tests for classification
Xue, J., & Titterington, D. M. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2010.01.015 · Cited by 9
Very large Bayesian multinets for text classification
Kłopotek, M. A. (2004) · Future Generation Computer Systems · doi:10.1016/j.future.2004.03.007 · Cited by 9
Application of uncertainty measures on credal sets on the naive Bayesian classifier
Abellán, J. (2006) · International Journal of General Systems · doi:10.1080/03081070600867039 · Cited by 9
Generalized additive Bayesian network classifiers
Li, J., Zhang, C., Wang, T., & Zhang, Y. (2007) · Cited by 7
Methods to Determine the Branching Attribute in Bayesian Multinets Classifiers
Cano, A., Castellano, J. G., Masegosa, A. R., & Moral, S. (2005) · Lecture notes in computer science · doi:10.1007/11518655_78 · Cited by 7
Discriminative Scoring of Bayesian Network Classifiers: a Comparative Study.
Feelders, A., & Ivanovs, J. (2006) · Cited by 6
Discriminative Learning of Bayesian Network Classifiers via the TM Algorithm
Santafé, G., Lozano, J. A., & Larrañaga, P. (2005) · Lecture notes in computer science · doi:10.1007/11518655_14 · Cited by 6 · cited 2×
“…min i = 1 ,..., N d ( i ) , is relaxed with a soft margin, finally defining the maximum margin score of a structure as (cid:2) Ni = 1 min 1 log d , where 0 is a scaling parameter and is set by AsinSection 3.7 with Bayes, the TM algorithm [Edwards and Lauritzen 2001] can [Santaf´e et al. 2005].”
MethodInfluentialSelf-citationVidaurre, D., Bielza, C., & Larrañaga, P. (2012) · Progress in Artificial Intelligence · doi:10.1007/s13748-011-0001-7 · Cited by 6 · cited 1×
“An L 1 / L 2 -regularized naive Bayes for continuous and discrete predictor variables is introduced in Vidaurre et al. [2012].”
BackgroundSelf-citationSuccessive Naive Bayesian Classifier.
Kononenko, I. (1993) · Cited by 5
Case Based Imprecision Estimates for Bayes Classifiers with the Bayesian Bootstrap
Norén, G. N., & Orre, R. (2005) · Machine Learning · doi:10.1007/s10994-005-5010-y · Cited by 5
Bounds for the Loss in Probability of Correct Classification Under Model Based Approximation
EkdahlMagnus, & KoskiTimo (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248634 · Cited by 5
Learning Semi Naïve Bayes Structures by Estimation of Distribution Algorithms
Robles, V., Larrañaga, P., Peña, J. M., Pérez, M. S., Menasalvas, E., & Herves, V. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-24580-3_31 · Cited by 4 · cited 2×
“Using confidence intervals rather than point estimates for p ( x i c ) and p ( c ) is an option, as in the interval estimation naive Bayes [Robles et al. 2003].”
MethodSelf-citationA Semi-naive Bayes Classifier with Grouping of Cases
Abellán, J., Cano, A., Masegosa, A. R., & Moral, S. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-75256-1_43 · Cited by 4
Exploring Case-Based Bayesian Networks and Bayesian Multi-nets for Classification
Hussein, A. M., & Santos, E. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24840-8_42 · Cited by 4
Employing Maximum Mutual Information for Bayesian Classification
van Gerven, M. A. J., & Lucas, P. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30547-7_20 · Cited by 4
A Discriminative Learning Method of TAN Classifier
Feng, Q., Tian, F., & Huang, H. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-75256-1_40 · Cited by 1 · cited 2×
“66 A recent overview of Bayesian network classifiers is Flores et al. [2012]. However, 67 the authors only cover the basic details of naive Bayes, tree-augmented naive Bayes, k68 dependence Bayesian classifiers, averaged one-dependence estimators, Bayesian multi69 nets, dependency networks, and probabilistic decision…”
Background
Research works printed but not linked: 16
- 10.5555/2073946.2073952 · doi:10.5555/2073946.2073952
- C. M. Bishop and J. Lasserre . 2007. Generative or discriminative? Getting the best of both worlds . In Bayesian Statistics , Vol. 8 . Oxford University Press, 3--23. C. M. Bishop and J. Lasserre. 2007. Generative or discriminative? Getting the best of both worlds. In Bayesian Statistics, Vol. 8. Oxford University Press, 3--23.
- 10.5555/2100662.2100669 · doi:10.5555/2100662.2100669
- 10.5555/1781238.1781244 · doi:10.5555/1781238.1781244
- 10.5555/1005332.1044703 · doi:10.5555/1005332.1044703
- 10.1023/A:1022649401552 · doi:10.1023/a:1022649401552 · Paper page
- 10.5555/2010978.2010980 · doi:10.5555/2010978.2010980
- International Statistical Review 69 3 (2001) 385--398. · DOI · Paper page
- P. Kontkanen , P. Myllymäki , and H. Tirri . 1996 . Constructing Bayesian Finite Mixture Models by the EM Algorithm . Technical Report C-1996-9. Department of Computer Science , University of Helsinki . P. Kontkanen, P. Myllymäki, and H. Tirri. 1996. Constructing Bayesian Finite Mixture Models by the EM Algorithm. Technical Report C-1996-9. Department of Computer Science, University of Helsinki.
- 10.5555/645323.649601 · doi:10.5555/645323.649601
- 10.5555/647301.721482 · doi:10.5555/647301.721482
- M. Narasimhan and J. A. Bilmes . 2005. A submodular-supermodular procedure with applications to discriminative structure learning . In Proceedings of the 21st Conference in Uncertainty in Artificial Intelligence (UAI-2005) . AUAI Press, 404--412. M. Narasimhan and J. A. Bilmes. 2005. A submodular-supermodular procedure with applications to discriminative structure learning. In Proceedings of the 21st Conference in Uncertainty in Artificial Intelligence (UAI-2005). AUAI Press, 404--412.
- J. Pearl . 1988. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann , Palo Alto, CA . J. Pearl. 1988. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, Palo Alto, CA.
- 10.5555/3121646.3121662 · doi:10.5555/3121646.3121662
- B. Poulin , R. Eisner , D. Szafron , Paul Lu , R. Greiner , D. S. Wishart , A. Fyshe , B. Pearcy , C. MacDonell , and J. Anvik . 2006. Visual explanation of evidence with additive classifiers . In Proceedings of the 21th National Conference on Artificial Intelligence (AAAI-2006) . AAAI Press/MIT Press , 1822 --1829. B. Poulin, R. Eisner, D. Szafron, Paul Lu, R. Greiner, D. S. Wishart, A. Fyshe, B. Pearcy, C. MacDonell, and J. Anvik. 2006. Visual explanation of evidence with additive classifiers. In Proceedings of the 21th National Conference on Artificial Intelligence (AAAI-2006). AAAI Press/MIT Press, 1822--1829.
- 10.5555/645326.649714 · doi:10.5555/645326.649714
Cited by
Big IoT data analytics: Architecture, opportunities, and open research challenges
(2017) · IEEE Access · doi:10.1109/access.2017.2689040 · Cited by 980
“and edges denote conditional dependency [47].”
Data Mining for the Internet of Things: Literature Review and Challenges
Chen, F., Deng, P., Wan, J., Zhang, D., Vasilakos, A. V., & Rong, X. (2015) · International Journal of Distributed Sensor Networks · doi:10.1155/2015/431047 · Cited by 528
Machine Learning Methods in Drug Discovery
Patel, L., Shukla, T., Huang, X., Ussery, D. W., & Wang, S. (2020) · Molecules · doi:10.3390/molecules25225277 · Cited by 460
Advances in Bayesian network modelling: Integration of modelling technologies
Marcot, B. G., & Penman, T. D. (2019) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2018.09.016 · Cited by 429
“BN classifiers include a wide variety of algorithms starting with naive Bayes and variants thereof (Bielza and Larrañaga, 2014).”
Sentiment analysis of Twitter data during critical events through Bayesian networks classifiers
Ruz, G. A., Henríquez, P. A., & Mascareño, A. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.01.005 · Cited by 332
Metadata
- Authors
- Bielza, C., & Larrañaga, P.
- Affiliations
- Universidad Politécnica de Madrid (ES)
- Venue
- ACM Computing Surveys
- Published
- 2014-07
- Volume
- 47
- Issue
- 1
- Pages
- 1-43
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2090347203
- Semantic Scholar
- e4aca79cd916f67b5ebde5676b2cab9ef5644dd0
- Cited by
- 248
- References
- 193
- Citations by year
- 2026: 16 · 2025: 19 · 2024: 20 · 2023: 27 · 2022: 25 · 2021: 26 · 2020: 16 · 2019: 24 · 2018: 16 · 2017: 14 · 2016: 17 · 2015: 20 · 2014: 8
- FWCI
- 19.76
- Type
- journal article
- Language
- en
- Open access
- green
- oa.upm.es
- Licence
- Locations
- ACM Computing Surveys (publishedVersion)
- Hispana (submittedVersion, cc-by-nc-nd)
- Archivo Digital UPM (Universidad Politécnica de Madrid) (submittedVersion, cc-by-nc-nd)
- Funders
- Ministerio de Economía y Competitividad
- Cajal Blue Brain
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
- Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Text and Document Classification Technologies
- Keywords
- naive Bayes, feature selection, structure learning, parameter learning
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.