Name
Abstract | ||
|---|---|---|
The use of Bayesian Networks (BNs) as classifiers in different application fields has recently witnessed a noticeable growth. Yet, using the Naïve Bayes application, and even the augmented Naïve Bayes, to classifier-structure learning, has been vulnerable to some extent, which accounts for the resort of experts to other more sophisticated types of algorithms. Consequently, the use of such algorithms has paved the way for raising the problem of super-exponential increase in computational complexity of the Bayesian classifier learning structure, with the increasing number of descriptive variables. In this context, the main objective of our present work lies in trying to conceive further solutions to solve the problem of the intricate algorithmic complexity imposed during the learning of Bayesian classifiers structure through the use of sophisticated algorithms. Our results revealed that the newly suggested approach allows us to considerably reduce the execution time of the Bayesian classifier structure learning without any information loss. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s10852-014-9266-8 | J. Math. Model. Algorithms in OR |
Keywords | Field | DocType |
Bayesian classifier, Classification, Clustering, Algorithmic complexity | Artificial intelligence,Cluster analysis,Algorithmic complexity,Mathematical optimization,Naive Bayes classifier,Algorithm,Bayesian programming,Bayesian network,Structure space,Machine learning,Mathematics,Computational complexity theory,Bayesian probability | Journal |
Volume | Issue | ISSN |
14 | 2 | 2214-2495 |
Citations | PageRank | References |
0 | 0.34 | 16 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Heni Bouhamed | 1 | 6 | 2.16 |
| Afif Masmoudi | 2 | 50 | 10.25 |
| Thierry Lecroq | 3 | 662 | 58.52 |
| Ahmed Riadh Rebai | 4 | 45 | 8.65 |