A comparison of subset selection and adaptive basis function construction for polynomial regression model building

Gints Jēkabsons, J. Lavendels
{"title":"A comparison of subset selection and adaptive basis function construction for polynomial regression model building","authors":"Gints Jēkabsons, J. Lavendels","doi":"10.2478/v10143-009-0017-7","DOIUrl":null,"url":null,"abstract":"A comparison of subset selection and adaptive basis function construction for polynomial regression model building The approach of subset selection in polynomial regression model building assumes that the chosen fixed full set of predefined basis functions contains a subset that is sufficient to describe the target relation sufficiently well. However, in most cases the necessary set of basis functions is not known and needs to be guessed - a potentially non-trivial (and long) trial and error process. In our previous research we considered an approach for polynomial regression model building which is different from the subset selection - letting the regression model building method itself construct the basis functions necessary for creating a model of arbitrary complexity without restricting oneself to the basis functions of a predefined full model. The approach is titled Adaptive Basis Function Construction (ABFC). In the present paper we compare the two approaches for polynomial regression model building - subset selection and ABFC - both theoretically and empirically in terms of their underlying principles, computational complexity, and predictive performance. Additionally in empirical evaluations the ABFC is compared also to two other well-known regression modelling methods - Locally Weighted Polynomials and Multivariate Adaptive Regression Splines.","PeriodicalId":211660,"journal":{"name":"Sci. J. Riga Tech. Univ. Ser. Comput. Sci.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sci. J. Riga Tech. Univ. Ser. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/v10143-009-0017-7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

A comparison of subset selection and adaptive basis function construction for polynomial regression model building The approach of subset selection in polynomial regression model building assumes that the chosen fixed full set of predefined basis functions contains a subset that is sufficient to describe the target relation sufficiently well. However, in most cases the necessary set of basis functions is not known and needs to be guessed - a potentially non-trivial (and long) trial and error process. In our previous research we considered an approach for polynomial regression model building which is different from the subset selection - letting the regression model building method itself construct the basis functions necessary for creating a model of arbitrary complexity without restricting oneself to the basis functions of a predefined full model. The approach is titled Adaptive Basis Function Construction (ABFC). In the present paper we compare the two approaches for polynomial regression model building - subset selection and ABFC - both theoretically and empirically in terms of their underlying principles, computational complexity, and predictive performance. Additionally in empirical evaluations the ABFC is compared also to two other well-known regression modelling methods - Locally Weighted Polynomials and Multivariate Adaptive Regression Splines.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多项式回归模型子集选择与自适应基函数构造的比较
多项式回归模型的子集选择与自适应基函数构建的比较多项式回归模型构建中的子集选择方法假设所选择的固定的预定义基函数集合包含一个足以充分描述目标关系的子集。然而,在大多数情况下,必要的基函数集是未知的,需要猜测——这可能是一个不平凡(且漫长)的试错过程。在我们之前的研究中,我们考虑了一种不同于子集选择的多项式回归模型构建方法,即让回归模型构建方法自己构建创建任意复杂性模型所需的基函数,而不局限于预定义的完整模型的基函数。这种方法被称为自适应基函数构造(ABFC)。在本文中,我们比较了多项式回归模型构建的两种方法-子集选择和ABFC -在理论和经验方面的基本原理,计算复杂性和预测性能。此外,在经验评估中,ABFC还与另外两种著名的回归建模方法——局部加权多项式和多元自适应回归样条进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Inventory Management in Multi Echelon Supply Chain using Sample Average Approximation Hybridisation of Evolutionary Algorithms for Solving Multi-Objective Simulation Optimisation Problems Simulation-Based Analysis of Fitness Landscape in Optimisation Multi-Agent Geosimulation of Urban Dynamics within the V-Devs Framework The Baseline Configuration of Project Management Information System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1