Curve fitting has many applications in lots of domains. The literature is full of fitting methods which are suitable for specific kinds of problems. In this paper we introduce a more general method to cover more range of problems. Our goal is to fit some cubic Bezier curves to data points of any distribution and order. The curves should be good representatives of the points and be connected and smooth. Theses constraints and the big search space make the fitting process difficult. We use the good capabilities of the coevolutionary algorithms in large problem spaces to fit the curves to the clusters of the data. The data are clustered using hierarchical techniques before the fitting process. © 2011 Springer-Verlag.
CITATION STYLE
Afshar, N. A., Soryani, M., & Rahmani, A. T. (2011). Curve fitting using coevolutionary genetic algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7077 LNCS, pp. 201–210). https://doi.org/10.1007/978-3-642-27242-4_24
Mendeley helps you to discover research relevant for your work.