Metraipolis › archive › dc_5e901ddd32bd
Neutrosophic Ensemble Classification for Uncertainty-Aware Bearing Fault Detection: Evidence from Laboratory and Variable-Speed Industrial Benchmarks — arXiv:2610.06880
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.06880
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:19:57.401Z
- SHA-256 of the archived text
c7e110a30f2ff75e635616b57fb4b2710f4f3a25c15d790a240af87f2f24a6b4- Stable URL of this page
https://metraipolis.com/documento/dc_5e901ddd32bd
How to cite
Neutrosophic Ensemble Classification for Uncertainty-Aware Bearing Fault Detection: Evidence from Laboratory and Variable-Speed Industrial Benchmarks — arXiv:2610.06880 — arXiv (en), https://arxiv.org/abs/2610.06880 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5e901ddd32bd (Metraipolis archive dc_5e901ddd32bd, sha256 c7e110a30f2ff75e635616b57fb4b2710f4f3a25c15d790a240af87f2f24a6b4)
BibTeX
@misc{dc5e901ddd32bd,
title = {Neutrosophic Ensemble Classification for Uncertainty-Aware Bearing Fault Detection: Evidence from Laboratory and Variable-Speed Industrial Benchmarks — arXiv:2610.06880},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.06880},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5e901ddd32bd; sha256 c7e110a30f2ff75e635616b57fb4b2710f4f3a25c15d790a240af87f2f24a6b4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.06880. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Machine learning classifiers for bearing fault detection produce scalar confidence scores that conflate confident errors with genuinely ambiguous predictions, and the conventional truth/falsity pair (F = 1 - T) is algebraically redundant by construction. We operationalize a refined neutrosophic decomposition of a Random Forest + XGBoost + Logistic Regression ensemble into four indicators -- T-hat (top-class evidence), F-hat (best-competitor evidence), predictive entropy I1-hat, and decision disagreement I2-hat -- evaluated on two bearing benchmarks (CWRU and JNU, 600-1000 rpm) under a leave-one-condition-out protocol. On CWRU, after correcting a file-to-class mapping error, the ensemble reaches 100.00 percent accuracy on three of four held-out loads (92.27 percent on the fourth), leaving too few errors for uncertainty analysis. On JNU, holding out 1000 rpm, accuracy collapses to 40.64 percent, below a majority-class baseline; Logistic Regression (57.91 percent) generalizes far better than the tree ensembles. I1-hat shows a robust association with error beyond T-hat/F-hat, while I2-hat contributes little; standalone Logistic Regression confidence outperforms the full decomposition, a boundary condition we report honestly. Two further results extend this: fusing a time-domain and a frequency-domain model of the same signal and scoring their Jensen-Shannon divergence beats that model own entropy (AURC 0.29 vs. 0.36 on the standard split; 0.54 vs. 0.73 under a harder single-condition reproduction), the only indicator moving correctly under a CWRU-versus-JNU distributional-shift contrast; and, on CWRU alone, literature-verified bearing fault frequencies, correctly demodulated via the envelope spectrum, separate most fault classes almost perfectly (99.57 percent) using three interpretable features. Code, logs, and figures are released for independent verification. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2610.06880 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T11:15:24.638Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).