.png){kind=icon}
返回
DDES: A Distribution-Based Dynamic Ensemble Selection Framework
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3063254.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Dynamic Ensemble Selection (DES) is a special type of ensemble modeling that selects different subsets of base classifiers for different test sample cases. In this process, multiple base classifiers are compared in terms of their competence as an ensemble to the best possible prediction for a given test sample case. Traditional DES methods rely on the Euclidean distance-based k-Nearest Neighbor (kNN) algorithm to identify the most relevant reference data points in such a way that the base classifiers correctly classifying them can be considered for an optimal ensemble. However, this approach is sensitive to the local structure of the data and the presence of noisy or irrelevant attributes. This study proposes a novel distribution-based DES (DDES) framework that takes the data structure into consideration when selecting reference data points. The experimental results for 30 classification problems indicate that the proposed approach yielded the best accuracy among the competing DES methods. Additionally, we discuss the correlation between the data complexity and the improvement in classification performance.
Keyword:
Classification algorithms
Diversity reception
Prediction algorithms
Noise measurement
Licenses
Indexes
Heuristic algorithms
Multiple classifier systems
dynamic ensemble selection
region of competence
feature variance
data complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
分享收藏Adjusted weight voting algorithm for random forests in handling missing values.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏分享收藏Report on the Third Workshop on Sustainable Software for Science: Practice and Experiences (WSSSPE3)
OAAI
OAAI分享收藏分享收藏
查看更多内容