Integrating advanced principal component analysis into naive bayes for enhanced classification performance
Bibliographic record
Abstract
The Naive Bayes algorithm is one of the most important and popular algorithms in machine learning and data mining, not only because of its simplicity but also because of its superior classification performance. The central assumption of this algorithm is known as the attribute independence assumption. This assumption allows the Naive Bayes algorithm to solve classification problems conveniently, but also limits the performance of this algorithm to a certain extent when the mixed type of variables exist in its input dataset. Recently, we proposed an improved Naive Bayes classification algorithm by combining an improved Principal Component Analysis (PCA) method. The improved PCA first calculates correlation coefficients between coupling variables using the Pearson and Kendall coefficients, where the two types of coefficients are calculated separately for quantitative and qualitative data. After coupling data is transformed into principal components, those correlated variables can be integrated into the improved Naive Bayes algorithm. When the improved Naive Bayes algorithm is applied to a classified task, it is easy to verify that the transformed principal components data are approximately independent, thereby conforming to the Naive Bayes independence assumption to a relatively greater extent. This implies that it is likely for the improved Naive Bayes algorithm to yield a more accurate classification performance, as it is more robust to the presence of noise in classification instances.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.011 | 0.035 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.002 |
| Bibliometrics | 0.004 | 0.004 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.004 | 0.003 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".