首页> 外文期刊>Journal of Global Optimization >Restructuring forward step of MARS algorithm using a new knot selection procedure based on a mapping approach
【24h】

Restructuring forward step of MARS algorithm using a new knot selection procedure based on a mapping approach

机译:使用基于映射方法的新结选择程序重构MARS算法的前进步骤

获取原文
获取原文并翻译 | 示例
       

摘要

In high dimensional data modeling, Multivariate Adaptive Regression Splines (MARS) is a popular nonparametric regression technique used to define the nonlinear relationship between a response variable and the predictors with the help of splines. MARS uses piecewise linear functions for local fit and apply an adaptive procedure to select the number and location of breaking points (called knots). The function estimation is basically generated via a two-stepwise procedure: forward selection and backward elimination. In the first step, a large number of local fits is obtained by selecting large number of knots via a lack-of-fit criteria; and in the latter one, the least contributing local fits or knots are removed. In conventional adaptive spline procedure, knots are selected from a set of all distinct data points that makes the forward selection procedure computationally expensive and leads to high local variance. To avoid this drawback, it is possible to restrict the knot points to a subset of data points. In this context, a new method is proposed for knot selection which bases on a mapping approach like self organizing maps. By this method, less but more representative data points are become eligible to be used as knots for function estimation in forward step of MARS. The proposed method is applied to many simulated and real datasets, and the results show that it proposes a time efficient forward step for the knot selection and model estimation without degrading the model accuracy and prediction performance.
机译:在高维数据建模中,多元自适应回归样条线(MARS)是一种流行的非参数回归技术,用于借助样条线定义响应变量与预测变量之间的非线性关系。 MARS使用分段线性函数进行局部拟合,并应用自适应过程来选择断点的数量和位置(称为结)。函数估计基本上是通过两步过程生成的:前向选择和后向消除。第一步,通过缺乏拟合标准选择大量的结,从而获得大量的局部拟合。在后一种情况下,去除了影响最小的局部配合或打结。在常规的自适应样条过程中,从所有不同数据点的集合中选择结,这使得前向选择过程在计算上昂贵并且导致高局部方差。为了避免此缺点,可以将结点限制为数据点的子集。在这种情况下,基于像自组织图这样的映射方法,提出了一种用于结选择的新方法。通过这种方法,越来越少但更具代表性的数据点有资格用作MARS前进步骤中的函数估计结。所提出的方法被应用于许多模拟的和真实的数据集,结果表明,它提出了一个有效的结节选择和模型估计的前向步骤,而不会降低模型的准确性和预测性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号