.png){kind=icon}
返回
On learning algorithm selection for classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2004.12.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces a new method for learning algorithm evaluation and selection, with empirical results based on classification. The empirical study has been conducted among 8 algorithms/classifiers with 100 different classification problems. We evaluate the algorithms' performance in terms of a variety of accuracy and complexity measures. Consistent with the No Free Lunch theorem, we do not expect to identify the single algorithm that performs best on all datasets. Rather, we aim to determine the characteristics of datasets that lend themselves to superior modelling by certain learning algorithms. Our empirical results are used to generate rules, using the rule-based learning algorithm C5.0, to describe which types of algorithms are suited to solving which types of classification problems. Most of the rules are generated with a high confidence rating. (C) 2005 Elsevier B. V. All rights reserved.
Keyword:
algorithm selection
classification
No Free Lunch theorem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
暂无机构信息
引用论文
分享收藏
分享收藏A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms.png)
MACHINE LEARNING
MACHINE LEARNINGIF2.9
PREAI
分享收藏分享收藏
查看更多内容