RIPPLE: Residual initiated polynomial-time piecewise linear estimation

被引:1
|
作者
Iyer, Manjula A. [1 ]
Watson, Layne T. [1 ]
机构
[1] Virginia Polytech Inst & State Univ, Dept Math & Comp Sci, Blacksburg, VA 24061 USA
来源
PROCEEDINGS IEEE SOUTHEASTCON 2007, VOLS 1 AND 2 | 2007年
关键词
D O I
10.1109/SECON.2007.342942
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Many engineering models, while highly nonlinear globally, are approximately piecewise linear The linear Shepard algorithm, which is a moving window weighted least squares method based on linear functions, usually creates reasonable approximations. However when used to produce approximations for data obtained from piecewise linear functions, its performance degrades near the function creases. A better approximation near the function creases can be achieved by using robust estimation algorithms. However, robust estimation algorithms have factorial complexity and require a large number of data points. A robust polynomial-time piecewise linear estimation algorithm has been developed that selects minimal sets of data based on a minimal residual criterion. This algorithm RIPPLE (residual initiated polynomial-time piecewise linear estimation) is shown to produce better approximations than the linear Shepard algorithm.
引用
收藏
页码:444 / +
页数:3
相关论文
共 50 条
  • [31] A polynomial-time algorithm for simple temporal problems with piecewise constant domain preference functions
    Kumar, TKS
    PROCEEDING OF THE NINETEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE SIXTEENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2004, : 67 - 72
  • [32] Polynomial-time Probabilistic observability analysis of sampled-data piecewise affine systems
    Azuma, Shun-ichi
    Imura, Jun-ichi
    2005 44TH IEEE CONFERENCE ON DECISION AND CONTROL & EUROPEAN CONTROL CONFERENCE, VOLS 1-8, 2005, : 6644 - 6649
  • [33] Polynomial-time quantum algorithms for finding the linear structures of Boolean function
    Wu, WanQing
    Zhang, HuanGuo
    Wang, HouZhen
    Mao, ShaoWu
    QUANTUM INFORMATION PROCESSING, 2015, 14 (04) : 1215 - 1226
  • [34] Structure of Polynomial-Time Approximation
    van Leeuwen, Erik Jan
    van Leeuwen, Jan
    THEORY OF COMPUTING SYSTEMS, 2012, 50 (04) : 641 - 674
  • [35] LINK SCHEDULING IN POLYNOMIAL-TIME
    HAJEK, B
    SASAKI, G
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) : 910 - 917
  • [36] On Polynomial-Time Relation Reducibility
    Gao, Su
    Ziegler, Caleb
    NOTRE DAME JOURNAL OF FORMAL LOGIC, 2017, 58 (02) : 271 - 285
  • [37] Random linear network coding with probabilistic polynomial-time wiretap adversary
    Hu, Zhiwen
    Zhu, Li
    Mao, Huaqing
    INTERNATIONAL JOURNAL OF ELECTRONIC SECURITY AND DIGITAL FORENSICS, 2015, 7 (01) : 41 - 53
  • [38] ON THE POWER OF PARITY POLYNOMIAL-TIME
    CAI, JY
    HEMACHANDRA, LA
    MATHEMATICAL SYSTEMS THEORY, 1990, 23 (02): : 95 - 106
  • [39] ON THE STRUCTURE OF POLYNOMIAL-TIME DEGREES
    AMBOSSPIES, K
    LECTURE NOTES IN COMPUTER SCIENCE, 1984, 166 : 198 - 208
  • [40] An arithmetic for polynomial-time computation
    Schwichtenberg, Helmut
    THEORETICAL COMPUTER SCIENCE, 2006, 357 (1-3) : 202 - 214