Experimental comparison of ensemble methods with different approaches of Naïve Bayes classifier in mixed data
other
OA: green
CC0
Abstract
“Big Data”, named after the massive volume of both structured and unstructured data, led to an explosion of new methods in data manipulation and data analysis. With the growth of Computational statistics techniques to assist these new methods, it is worth to mention that traditional approaches are not replaced but are reinforced to make more robust predictions and give better results. Under this scope, Data Mining is a new science that was recently developed for delivering the extracted information in a way that humans can comprehend and make better decisions. This pool of pattern recognition methods includes Ensemble algorithms, which have been developed over two decades and are very popular in practice due to their ability to boost the predictability performance of statistical methods. These meta -algorithms combine several techniques into one predictive model and aim to decrease variance or bias. Under the scope of Pattern recognition where the prediction of the error plays important role, this thesis aims to compare various Ensemble algorithms with a very famous simple probabilistic algorithm, that of Naïve Bayes, which even today is considered as a method with a very low generalization error and can compete the robustness of Ensemble methods.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- openalex
- last seen: 2026-05-13T18:03:57.834008+00:00
License: CC0
· commercial use OK