The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Constructing a model for data in <tmath>${\cal R}^{2}$</tmath> 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 <tmath>${\cal R}^{2}$</tmath>. 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.</p>
Genetic algorithms, optimization, statistical data analysis, splines.

C. Murthy and J. Pittman, "Fitting Optimal Piecewise Linear Functions Using Genetic Algorithms," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 22, no. , pp. 701-718, 2000.
99 ms
(Ver 3.3 (11022016))