Abstract | ||
---|---|---|
We propose a scoring criterion, named mixture-based factorized conditional log-likelihood (mfCLL), which allows for efficient hybrid learning of mixtures of Bayesian networks in binary classification tasks. The learning procedure is decoupled in foreground and background learning, being the foreground the single concept of interest that we want to distinguish from a highly complex background. The overall procedure is hybrid as the foreground is discriminatively learned, whereas the background is generatively learned. The learning algorithm is shown to run in polynomial time for network structures such as trees and consistent κ-graphs. To gauge the performance of the mfCLL scoring criterion, we carry out a comparison with state-of-the-art classifiers. Results obtained with a large suite of benchmark datasets show that mfCLL-trained classifiers are a competitive alternative and should be taken into consideration. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1016/j.patcog.2014.03.019 | Pattern Recognition |
Keywords | Field | DocType |
Conditional log-likelihood,Approximation,Hybrid learning,Discriminative learning,Bayesian networks,Mixtures,Multinets | Suite,Pattern recognition,Binary classification,Computer science,Conditional log likelihood,Bayesian network,Artificial intelligence,Time complexity,Machine learning,Discriminative learning,Network structure,Bayesian probability | Journal |
Volume | Issue | ISSN |
47 | 10 | 0031-3203 |
Citations | PageRank | References |
1 | 0.38 | 14 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Alexandra M. Carvalho | 1 | 223 | 16.39 |
Pedro Adão | 2 | 103 | 7.33 |
Paulo Mateus | 3 | 33 | 4.55 |