Abstract | ||
---|---|---|
In many experimental studies in scientific applications a set of given data is to be approximated. This can be performed either by minimizing the least absolute deviation or by minimizing the least square error. The objective of this paper is to demonstrate the use of gravitational search algorithm and its recently proposed hybridized variants, called LXGSA, PMGSA and LXPMGSA, to fit polynomials of degree 1, 2, 3, or 4 to a set of N points. It is concluded that one of the hybridized version namely, LXPMGSA outperform all other variants for this problem. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1007/978-981-10-0451-3_74 | PROCEEDINGS OF FIFTH INTERNATIONAL CONFERENCE ON SOFT COMPUTING FOR PROBLEM SOLVING (SOCPROS 2015), VOL 2 |
Keywords | DocType | Volume |
Gravitational search algorithm,Method of least square,Least absolute deviation | Conference | 437 |
ISSN | Citations | PageRank |
2194-5357 | 0 | 0.34 |
References | Authors | |
0 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Amarjeet Singh | 1 | 526 | 49.37 |
Kusum Deep | 2 | 876 | 82.14 |
Aakash Deep | 3 | 0 | 0.34 |