返回
Data complexity meta-features for regression problems
DOI:10.1007/s10994-017-5681-1.png)
摘要
En 中文
In meta-learning, classification problems can be described by a variety of features, including complexity measures. These measures allow capturing the complexity of the frontier that separates the classes. For regression problems, on the other hand, there is a lack of such type of measures. This paper presents and analyses measures devoted to estimate the complexity of the function that should fitted to the data in regression problems. As case studies, they are employed as meta-features in three meta-learning setups: (i) the first one predicts the regression function type of some synthetic datasets; (ii) the second one is designed to tune the parameter values of support vector regressors; and (iii) the third one aims to predict the performance of various regressors for a given dataset. The results show the suitability of the new measures to describe the regression datasets and their utility in the meta-learning tasks considered. In cases (ii) and (iii) the achieved results are also similar or better than those obtained by the use of classical meta-features in meta-learning.
Keyword:
Meta-learning
Meta-features
Complexity measures
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
2.8K
被引数:
3.8W
机构
引用论文
Coalition game for user association and bandwidth allocation in ultra-dense mmWave networks超密集毫米波网络中用户关联和带宽分配的联盟博弈
A meta-learning method to select the kernel width in Support Vector Regression支持向量回归中核宽度选择的元学习方法
MACHINE LEARNING
IF2.9

