4.2.1. The High-Level Description of the Naïve Bayes Classifier If the number of content names (L) fit into s classes where 𝑠∈{𝑐1,𝑐2,…,𝑐𝑠}s∈{c1,c2,…,cs}, the predicted output class is 𝑐∈𝐶c∈C. The Naïve Bayes algorithm can be described as follows: ...
A hybrid routing algorithm based on Naïve Bayes and improved particle swarm optimization algorithms (HRA-NP) is proposed in this paper. HRA-NP has the advantages of a simple topology and easy-to-maintain cluster routing. This would improve the energy efficiency of data collection. At the same...
In the supervised classification area, the algorithm selection problem (ASP) refers to determining the a priori performance of a given classifier in some specific problem, as well as the finding of which is the most suitable classifier for some tasks. Recently, this topic has attracted the attent...