K-plane regression

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

PDF inf_sci_292_39_2015.pdf - Published Version Restricted to Registered users only Download (668kB) | Request a copy

Abstract

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.

Item Type:	Journal Article
Publication:	INFORMATION SCIENCES
Additional Information:	Copyright for this articles belongs to the ELSEVIER SCIENCE INC, 360 PARK AVE SOUTH, NEW YORK, NY 10010-1710 USA
Department/Centre:	Division of Electrical Sciences > Electrical Engineering
Date Deposited:	14 Dec 2014 06:35
Last Modified:	14 Dec 2014 06:35
URI:	http://eprints.iisc.ac.in/id/eprint/50412

Actions (login required)

View Item