skip to main content
10.1145/1276958.1276969acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
Article

A particle swarm optimization approach for estimating parameter confidence regions

Published: 07 July 2007 Publication History

Abstract

Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires determination of parameter space confidence regions in addition to point estimates. In most practical applications, the relation of the parameters to model fitness is highly nonlinear and noisy data leads to further deviations. Thus the confidence regions obtained by using locally linearized models are often misleading. Uniform covering by probabilistic rejection (UCPR) is a robust technique that has been developed to solve this problem, and has been proven to be more efficient than other approximate random search techniques. In this paper, we propose a contour particle swarm optimization (C-PSO) technique and compare its performance against UCPR in predicting the confidence regions. Results indicate that for problems with low number of parameters, both the algorithms are quite comparable. However, real world models such as genetic networks have a large number of parameters and the UCPR fails in finding good convergence due to its limited search capabilities. In such problems, the C-PSO technique was able to find the confidence regions with better resolution and efficiency.

References

[1]
S. Das, P. Koduru, S. M. Welch, M. Gui, M. Cochran, A. Wareing, B. Babin, Adding Local Search to Particle Swarm Optimization, Proceedings, World Congress on Computational Intelligence, Vancouver, Canada, 2006.
[2]
P. Koduru, S. Das, S. M. Welch, A Particle Swarm Optimization-Nelder Mead Hybrid Algorithm for Balanced Exploration and Exploitation in Multidimensional Search Space, Proceedings, International Conference on Artificial Intelligence, Las Vegas, Nevada, 457--464, 2006.
[3]
M. Clerc and J. Kennedy, The particle swarm-explosion, stability, and convergence in a multidimensional complex space, IEEE Transactions on Evolutionary Computation, vol. 6, no. 1, 58--73, 2002.
[4]
Mendes, R.; Kennedy, J.; Neves, J., The fully informed particle swarm: simpler, maybe better, IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, 204 -- 210, June 2004.
[5]
Kalyanmoy Deb, Multi-Objective Optimization Using Evolutionary Algorithms, Wiley, London, 2001.
[6]
Coello, C.A.C., Pulido, G.T., Lechuga, M.S., Handling multiple objectives with particle swarm optimization, IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, 256 -- 279, June 2004.
[7]
S. M. Welch, J. L. Roe and Z. Dong, Z., A genetic neural network model of flowering time control in Arabidopsis thaliana, Agron. J. Vol. 95, 71--81, 2003.
[8]
S. M. Welch, Z. Dong and J. L. Roe, Modelling gene networks controlling transition to flowering in Arabidopsis, Proceedings of the 4th International Crop Science Congress, Brisbane, Australia, Sep 26 -- Oct 1, 2004.
[9]
Z. Dong, Incorporation of genomic information into the simulation of flowering time in Arabidopsis thaliana, Ph.D. dissertation, Kansas State University, 2003.
[10]
S. M. Welch, J. L. Roe, S. Das, Z. Dong, R. He, and M. B. Kirkham, Merging genomic control networks with soil-plant-atmosphere-continuum (SPAC) models, Agricultural Systems, 2004.
[11]
A. V. Hill, The possible effect of aggregation of molecules of haemoglobin on its dissociation curves, J. Physiol. 40 (1910), iv-viii.
[12]
S. Das, P. Koduru, S. M. Welch, M. Gui, M. Cochran, A. Wareing, B. Babin, Adding Local Search to Particle Swarm Optimization, Proc. of the World Congress on Computational Intelligence, Vancouver, BC, Canada, 2006.
[13]
O. Klepper, E.M.T. Hendrix, A comparison of algorithms for global characterization of confidence region for nonlinear models, Environmental Toxicology and Chemistry, vol. 13, 1887--1899, 1994.
[14]
N.R. Draper, H. Smith, Applied Regression Analysis, John Wiley, New York, 1966.
[15]
J. A. Nelder and R. A. Mead, A simplex method for function minimization, Computer Journal, Vol. 7 no. 4, 308--313, 1965.
[16]
S. Kojima, Y. Takahashi, Y. Kobayashi, L. Monna, T. Saski, T. Araaki and M. Yano, Hd3a, a rice ortholog of the Arabidopsis FT gene, promotes transistion to flowering downstream of Hd1 under short-day conditions, Plant Cell Physiology, 43, 1096--1105, 2002.
[17]
J.E. Fieldsend and S. Singh, A multi-objective algorithm based upon particle swarm optimization, an efficient data structure and turbulence, In Proceedings of the 2002 U.K. Workshop on Computational Intelligence, Birmingham, UK, 37--44, September, 2002.

Cited By

View all
  • (2019)Optimization of a True Moving Bed unit and determination of its feasible operating region using a novel Sliding Particle Swarm OptimizationComputers and Industrial Engineering10.1016/j.cie.2019.06.020135:C(368-381)Online publication date: 1-Sep-2019

Index Terms

  1. A particle swarm optimization approach for estimating parameter confidence regions

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation
        July 2007
        2313 pages
        ISBN:9781595936974
        DOI:10.1145/1276958
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 07 July 2007

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. Genomics
        2. confidence regions
        3. evolutionary algorithms
        4. particle swarm optimization

        Qualifiers

        • Article

        Conference

        GECCO07
        Sponsor:

        Acceptance Rates

        GECCO '07 Paper Acceptance Rate 266 of 577 submissions, 46%;
        Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)21
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 16 Feb 2025

        Other Metrics

        Citations

        Cited By

        View all
        • (2019)Optimization of a True Moving Bed unit and determination of its feasible operating region using a novel Sliding Particle Swarm OptimizationComputers and Industrial Engineering10.1016/j.cie.2019.06.020135:C(368-381)Online publication date: 1-Sep-2019

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Figures

        Tables

        Media

        Share

        Share

        Share this Publication link

        Share on social media