A Mallows-like Criterion for Anomaly Detection with Random Forest Implementation
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917678048870400 |
|---|---|
| author | Zhao, Gaoxiang Wang, Lu Wang, Xiaoqiang |
| author_facet | Zhao, Gaoxiang Wang, Lu Wang, Xiaoqiang |
| contents | The effectiveness of anomaly signal detection can be significantly undermined by the inherent uncertainty of relying on one specified model. Under the framework of model average methods, this paper proposes a novel criterion to select the weights on aggregation of multiple models, wherein the focal loss function accounts for the classification of extremely imbalanced data. This strategy is further integrated into Random Forest algorithm by replacing the conventional voting method. We have evaluated the proposed method on benchmark datasets across various domains, including network intrusion. The findings indicate that our proposed method not only surpasses the model averaging with typical loss functions but also outstrips common anomaly detection algorithms in terms of accuracy and robustness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_18932 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Mallows-like Criterion for Anomaly Detection with Random Forest Implementation Zhao, Gaoxiang Wang, Lu Wang, Xiaoqiang Machine Learning The effectiveness of anomaly signal detection can be significantly undermined by the inherent uncertainty of relying on one specified model. Under the framework of model average methods, this paper proposes a novel criterion to select the weights on aggregation of multiple models, wherein the focal loss function accounts for the classification of extremely imbalanced data. This strategy is further integrated into Random Forest algorithm by replacing the conventional voting method. We have evaluated the proposed method on benchmark datasets across various domains, including network intrusion. The findings indicate that our proposed method not only surpasses the model averaging with typical loss functions but also outstrips common anomaly detection algorithms in terms of accuracy and robustness. |
| title | A Mallows-like Criterion for Anomaly Detection with Random Forest Implementation |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2405.18932 |