TY - JOUR
T1 - Fitting optimal piecewise linear functions using genetic algorithms
AU - Pittman, Jennifer
AU - Murthy, C. A.
N1 - Funding Information:
The research of J. Pittman is supported by the U.S. Army Research Office under Assert grant DAAG55-97-1-0219. The research of C.A. Murthy is supported by the U.S. Army Research Office under Assert grant DAAHO4-96-1-0082.
PY - 2000/7
Y1 - 2000/7
N2 - Constructing a model for data in R2 is a common problem in many scientific fields, including pattern recognition, computer vision, and applied mathematics. Often little is known about the process which generated the data or its statistical properties. For example, in fitting a piecewise linear model, the number of pieces, as well as the knot locations, may be unknown. Hence, the method used to build the statistical model should have few assumptions, yet, still provide a model that is optimal in some sense. Such methods can be designed through the use of genetic algorithms. In this paper, we examine the use of genetic algorithms to fit piecewise linear functions to data in R2. The number of pieces, the location of the knots, and the underlying distribution of the data are assumed to be unknown. We discuss existing methods which attempt to solve this problem and introduce a new method which employs genetic algorithms to optimize the number and location of the pieces. Experimental results are presented which demonstrate the performance of our method and compare it to the performance of several existing methods. We conclude that our method represents a valuable tool for fitting both robust and nonrobust piecewise linear functions.
AB - Constructing a model for data in R2 is a common problem in many scientific fields, including pattern recognition, computer vision, and applied mathematics. Often little is known about the process which generated the data or its statistical properties. For example, in fitting a piecewise linear model, the number of pieces, as well as the knot locations, may be unknown. Hence, the method used to build the statistical model should have few assumptions, yet, still provide a model that is optimal in some sense. Such methods can be designed through the use of genetic algorithms. In this paper, we examine the use of genetic algorithms to fit piecewise linear functions to data in R2. The number of pieces, the location of the knots, and the underlying distribution of the data are assumed to be unknown. We discuss existing methods which attempt to solve this problem and introduce a new method which employs genetic algorithms to optimize the number and location of the pieces. Experimental results are presented which demonstrate the performance of our method and compare it to the performance of several existing methods. We conclude that our method represents a valuable tool for fitting both robust and nonrobust piecewise linear functions.
UR - http://www.scopus.com/inward/record.url?scp=0034230126&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0034230126&partnerID=8YFLogxK
U2 - 10.1109/34.865188
DO - 10.1109/34.865188
M3 - Article
AN - SCOPUS:0034230126
SN - 0162-8828
VL - 22
SP - 701
EP - 718
JO - IEEE Transactions on Pattern Analysis and Machine Intelligence
JF - IEEE Transactions on Pattern Analysis and Machine Intelligence
IS - 7
ER -