Towards the efficient recovery of general multi-dimensional bayesian network classifier

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Multi-dimensional classification (MDC) aims at finding a function that assigns a vector of class values to a vector of observed features. Multi-dimensional Bayesian network classifier (MBNC) was devised for MDC in 2006, but with restricted structure. By removing the constraints, an undocumented model called general multi-dimensional Bayesian network classifier (GMBNC) is proposed in this article, along with an exact induction algorithm which is able to recover the GMBNC by local search, without having to learn the whole BN first. We prove its soundness, and conduct experimental studies to verify its effectiveness and efficiency. The larger is the problem, the more saving by IPC-GMBNC versus conventional approach (global structure learning by PC algorithm), e.g. given an example network with 200 nodes, around 99% saving is achieved. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Fu, S., Minn, S., & Desmarais, M. C. (2014). Towards the efficient recovery of general multi-dimensional bayesian network classifier. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8556 LNAI, pp. 16–30). Springer Verlag. https://doi.org/10.1007/978-3-319-08979-9_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free