K-plane regression


Autoria(s): Manwani, Naresh; Sastry, PS
Data(s)

2015

Resumo

In this paper, we present a novel algorithm for piecewise linear regression which can learn continuous as well as discontinuous piecewise linear functions. The main idea is to repeatedly partition the data and learn a linear model in each partition. The proposed algorithm is similar in spirit to k-means clustering algorithm. We show that our algorithm can also be viewed as a special case of an EM algorithm for maximum likelihood estimation under a reasonable probability model. We empirically demonstrate the effectiveness of our approach by comparing its performance with that of the state of art algorithms on various datasets. (C) 2014 Elsevier Inc. All rights reserved.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/50412/1/inf_sci_292_39_2015.pdf

Manwani, Naresh and Sastry, PS (2015) K-plane regression. In: INFORMATION SCIENCES, 292 . pp. 39-56.

Relação

http://dx.doi.org/10.1016/j.ins.2014.08.058

http://eprints.iisc.ernet.in/50412/

Palavras-Chave #Electrical Engineering
Tipo

Journal Article

PeerReviewed