Interpretability of hinging hyperplanes

Tamás Kenesei, J. Abonyi

Research output: Chapter


The hinging hyperplane model was proposed by Breiman [20]. This type of nonlinear model is often referenced in the literature since it suffers from convergency and range problems [19, 33–35]. Methods such as a penalty of the hinging angle were proposed to improve Breiman’s algorithm [18]; alternatively, the Gauss-Newton algorithm can be used to obtain the final nonlinear model [34]. Several application examples have also been published in the literature; e.g., it can be used in the identification of piecewise affine systems via mixed-integer programming [36], and this model also lends itself to forming hierarchical models [19].

Original languageEnglish
Title of host publicationSpringerBriefs in Computer Science
Number of pages24
Publication statusPublished - jan. 1 2015

Publication series

NameSpringerBriefs in Computer Science
ISSN (Print)2191-5768
ISSN (Electronic)2191-5776

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Interpretability of hinging hyperplanes'. Together they form a unique fingerprint.

  • Cite this

    Kenesei, T., & Abonyi, J. (2015). Interpretability of hinging hyperplanes. In SpringerBriefs in Computer Science (9783319219417 ed., pp. 9-32). (SpringerBriefs in Computer Science; No. 9783319219417). Springer.