首页> 外文期刊>American journal of mathematical and management sciences >Extensions to a Best Subset Algorithm for Least Absolute Value Estimation
【24h】

Extensions to a Best Subset Algorithm for Least Absolute Value Estimation

机译:Extensions to a Best Subset Algorithm for Least Absolute Value Estimation

获取原文
           

摘要

The topic of robust estimation has appeared often in the literature (see Armstrong, Frome, and Sklar (1980), for instance, for a list of references). Least absolute value (LAV) estimation, in particular, has been shown to be a useful alternative to least squares estimation. In this paper a number of extensions to an LAV algorithm of Armstrong and Kung (1982) are developed and tested, and the computational results reported. The topics are organized as follows: locating the three best subsets; determining the most influential of a selected set of observations; altering the percent-of-optimality figure; and, forcing parameters to be in the model.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号