Difference between revisions of "User:Shawndouglas/sandbox/sublevel6"

From LIMSWiki
Jump to navigationJump to search
Line 48: Line 48:
The aim of our work is to propose our numerical tool that can provide information on the future dynamics given few follow-up data. Thus, we first model longitudinal data via widely used mathematical models in population dynamics. As such, on one hand we aim at validating such a model by approximating the parameters involved in the dynamics. On the other one, we are also interested in giving reliable information on the future dynamics of the curves.
The aim of our work is to propose our numerical tool that can provide information on the future dynamics given few follow-up data. Thus, we first model longitudinal data via widely used mathematical models in population dynamics. As such, on one hand we aim at validating such a model by approximating the parameters involved in the dynamics. On the other one, we are also interested in giving reliable information on the future dynamics of the curves.


In order to achieve our goal, we propose our numerical tool based on optimization methods coupled with interpolation techniques. Specifically, we approximate the parameters involved in the dynamics by means of stochastic optimization algorithms (SOMs).<ref name="KennedyParticle95">{{cite journal |title=Particle swarm optimization |journal=Proceedings of ICNN'95 - International Conference on Neural Networks |author=Kennedy, J.; Eberhart, R. |volume=4 |pages=1942–8 |year=1995 |doi=10.1109/ICNN.1995.488968}}</ref><ref name="ParsopoulosParticle02">{{cite book |chapter=Particle swarm optimization method for constrained optimization problems |title=Intelligent Technologies: from Theory to Applications  |author=Parsopoulos, K.; Vrahatis, M. |editor=Sincák, P.; Kvasnicka, V.; Vascák, J.; Pospíchal, J. |publisher=IOS Press |volume=76 |series=Frontiers in Artificial Intelligence and Applications |pages=214–20 |year=2002 |isbn=9781586032562}}</ref><ref name="PedersenSimp10">{{cite journal |title=Simplifying Particle Swarm Optimization |journal=Applied Soft Computing |author=Pedersen, M.E.H.; Chipperfield, A.J. |volume=10 |issue=2 |pages=618–28 |year=2010 |doi=10.1016/j.asoc.2009.08.029}}</ref><ref name="ShiAMod98">{{cite journal |title=A modified particle swarm optimizer |journal=1998 IEEE International Conference on Evolutionary Computation Proceedings |author=Shi, Y.; Eberhart, R. |pages=69–73 |year=1998 |doi=10.1109/ICEC.1998.699146}}</ref> Moreover, for each data series, we improve the performances of the optimization tools by means of radial basis function (RBF) interpolation; see [8] for a general overview and [9,10] for particular instances on the topic and applications. In the interpolation process, we also take into account the critical computational issue of carrying out stable computations. For this reason, and since data are subject to noise, we adopt a kind of Tikhonov regularization (see [11]).
In order to achieve our goal, we propose our numerical tool based on optimization methods coupled with interpolation techniques. Specifically, we approximate the parameters involved in the dynamics by means of stochastic optimization algorithms (SOMs).<ref name="KennedyParticle95">{{cite journal |title=Particle swarm optimization |journal=Proceedings of ICNN'95 - International Conference on Neural Networks |author=Kennedy, J.; Eberhart, R. |volume=4 |pages=1942–8 |year=1995 |doi=10.1109/ICNN.1995.488968}}</ref><ref name="ParsopoulosParticle02">{{cite book |chapter=Particle swarm optimization method for constrained optimization problems |title=Intelligent Technologies: from Theory to Applications  |author=Parsopoulos, K.; Vrahatis, M. |editor=Sincák, P.; Kvasnicka, V.; Vascák, J.; Pospíchal, J. |publisher=IOS Press |volume=76 |series=Frontiers in Artificial Intelligence and Applications |pages=214–20 |year=2002 |isbn=9781586032562}}</ref><ref name="PedersenSimp10">{{cite journal |title=Simplifying Particle Swarm Optimization |journal=Applied Soft Computing |author=Pedersen, M.E.H.; Chipperfield, A.J. |volume=10 |issue=2 |pages=618–28 |year=2010 |doi=10.1016/j.asoc.2009.08.029}}</ref><ref name="ShiAMod98">{{cite journal |title=A modified particle swarm optimizer |journal=1998 IEEE International Conference on Evolutionary Computation Proceedings |author=Shi, Y.; Eberhart, R. |pages=69–73 |year=1998 |doi=10.1109/ICEC.1998.699146}}</ref> Moreover, for each data series, we improve the performances of the optimization tools by means of radial basis function (RBF) interpolation; see Fasshauer and McCourt<ref name="FasshauerKernel15">{{cite book |title=Kernel-based Approximation Methods using MATLAB |author=Fasshauer, G.; McCourt, M. |publisher=World Scientific |series=Interdisciplinary Mathematical Sciences |volume=19 |pages=536 |year=2015 |isbn=9789814630139 |doi=10.1142/9335}}</ref> for a general overview and Cavoretto ''et al.''<ref name="CavorettoOptimal18">{{cite journal |title=Optimal Selection of Local Approximants in RBF-PU Interpolation |journal=Journal of Scientific Computing |author=Cavoretto, R.; De Rossi, A.; Perracchione, E. |volume=74 |issue=1 |pages=1–22 |year=2018 |doi=10.1007/s10915-017-0418-7}}</ref><ref name="CavorettoTopology18">{{cite journal |title=Topology analysis of global and local RBF transformations for image registration |journal=Mathematics and Computers in Simulation |author=Cavoretto, R.; De Rossi, A.; Qiao, H. |volume=147 |issue=5 |pages=52–72 |year=2018 |doi=10.1016/j.matcom.2017.10.010}}</ref> for particular instances on the topic and applications. In the interpolation process, we also take into account the critical computational issue of carrying out stable computations. For this reason, and since data are subject to noise, we adopt a kind of Tikhonov regularization.<ref name="CancelliereOCReP15">{{cite journal |title=OCReP: An Optimally Conditioned Regularization for pseudoinversion based neural training |journal=Neural Networks |author=Cancelliere, R.; Gai, M.; Gallinari, P.; Rubini, L. |volume=71 |issue=11 |pages=76–87 |year=2015 |doi=10.1016/j.neunet.2015.07.015}}</ref>


==References==
==References==

Revision as of 18:22, 19 August 2018

This is sublevel2 of my sandbox, where I play with features and test MediaWiki code. If you wish to leave a comment for me, please see my discussion page instead.

Sandbox begins below

Full article title A new numerical method for processing longitudinal data: Clinical applications
Journal Epidemiology Biostatistics and Public Health
Author(s) Stura, Ilaria; Perracchione, Emma; Migliaretti, Giuseppe; Cavallo, Franco
Author affiliation(s) Università di Torino, Università di Padova
Primary contact Email: Ilaria dot stura at unito dot it
Year published 2018
Volume and issue 15(2)
Page(s) e12881
DOI 10.2427/12881
ISSN 2282-0930
Distribution license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Website https://ebph.it/index.php/ebph/article/view/12881
Download https://ebph.it/article/view/12881/11630 (PDF)
This article should not be considered complete until this message box has been removed. This is a work in progress.

Abstract

Background: Processing longitudinal data is a computational issue that arises in many applications, such as in aircraft design, medicine, optimal control, and weather forecasting. Given some longitudinal data, i.e., scattered measurements, the aim consists in approximating the parameters involved in the dynamics of the considered process. For this problem, a large variety of well-known methods have already been developed.

Results: Here, we propose an alternative approach to be used as an effective and accurate tool for the parameters fitting and prediction of individual trajectories from sparse longitudinal data. In particular, our mixed model, that uses radial basis functions (RBFs) combined with stochastic optimization algorithms (SOMs), is here presented and tested on clinical data. Further, we also carry out comparisons with other methods that are widely used in this framework.

Conclusion: The main advantages of the proposed method are the flexibility with respect to the datasets, meaning that it is effective also for truly irregularly distributed data, and its ability to extract reliable information on the evolution of the dynamics.

Keywords: statistical method, radial basis function; stochastic optimization algorithm, longitudinal data

Introduction

Longitudinal data are often the object of study in many fields, e.g., sociology, meteorology, and medicine. In medicine, repeated measurements are used to monitor patients’ behaviors and also to adjust therapies accordingly. However, many problems occur when these data are analyzed. Indeed, each time series could have a different number of observations and not be equally spaced. In addition, the sampling period could vary from patient to patient, and measurement errors and also missing data often occur. Thus, since in these cases common methods such as linear regression usually fail, the recent research is directed towards more robust statistical methods. For instance, longitudinal data are commonly analyzed using parametric models such as Bayesian ones[1], as well as functional data analysis (FDA).[2][3] In both cases, many data are required in order to model the behavior of the studied variable(s). These methods, in fact, try to find an "average curve" using all the data, including truncated series and observations with missing information.

However, in clinical applications the estimate on the future dynamics of a single series, given few previous values, could be needed; think for instance to tumor volumes during a treatment, height/weight of children during growth, and concentration of some substance in the body. Each patient is different and could have different growth behavior and different growth parameters, so an "average curve" could not be sufficient. An important piece of information could be, for example, the possible future development of the subject, given his/her previous growth and the clinical background (e.g., treatments). These data could be compared with the real dynamics, in order to see if the response of the patients to the treatment is stable (the parameters do not vary in the future) or not (change in the parameters).

The aim of our work is to propose our numerical tool that can provide information on the future dynamics given few follow-up data. Thus, we first model longitudinal data via widely used mathematical models in population dynamics. As such, on one hand we aim at validating such a model by approximating the parameters involved in the dynamics. On the other one, we are also interested in giving reliable information on the future dynamics of the curves.

In order to achieve our goal, we propose our numerical tool based on optimization methods coupled with interpolation techniques. Specifically, we approximate the parameters involved in the dynamics by means of stochastic optimization algorithms (SOMs).[4][5][6][7] Moreover, for each data series, we improve the performances of the optimization tools by means of radial basis function (RBF) interpolation; see Fasshauer and McCourt[8] for a general overview and Cavoretto et al.[9][10] for particular instances on the topic and applications. In the interpolation process, we also take into account the critical computational issue of carrying out stable computations. For this reason, and since data are subject to noise, we adopt a kind of Tikhonov regularization.[11]

References

  1. ↑ Rao, C.R. (1987). "Prediction of Future Observations in Growth Curve Models". Statistical Science 2 (4): 434–47. doi:10.1214/ss/1177013119. 
  2. ↑ Ji, H; Müller, H.-G. (2017). "Optimal designs for longitudinal and functional data". Statistical Methodology Series B 79 (3): 859-876. doi:10.1111/rssb.12192. 
  3. ↑ Ramsay, J.; Silverman, B.W. (2005). Functional Data Analysis. Springer-Verlag. pp. 428. ISBN 9780387400808. 
  4. ↑ Kennedy, J.; Eberhart, R. (1995). "Particle swarm optimization". Proceedings of ICNN'95 - International Conference on Neural Networks 4: 1942–8. doi:10.1109/ICNN.1995.488968. 
  5. ↑ Parsopoulos, K.; Vrahatis, M. (2002). "Particle swarm optimization method for constrained optimization problems". In Sincák, P.; Kvasnicka, V.; Vascák, J.; Pospíchal, J.. Intelligent Technologies: from Theory to Applications. Frontiers in Artificial Intelligence and Applications. 76. IOS Press. pp. 214–20. ISBN 9781586032562. 
  6. ↑ Pedersen, M.E.H.; Chipperfield, A.J. (2010). "Simplifying Particle Swarm Optimization". Applied Soft Computing 10 (2): 618–28. doi:10.1016/j.asoc.2009.08.029. 
  7. ↑ Shi, Y.; Eberhart, R. (1998). "A modified particle swarm optimizer". 1998 IEEE International Conference on Evolutionary Computation Proceedings: 69–73. doi:10.1109/ICEC.1998.699146. 
  8. ↑ Fasshauer, G.; McCourt, M. (2015). Kernel-based Approximation Methods using MATLAB. Interdisciplinary Mathematical Sciences. 19. World Scientific. pp. 536. doi:10.1142/9335. ISBN 9789814630139. 
  9. ↑ Cavoretto, R.; De Rossi, A.; Perracchione, E. (2018). "Optimal Selection of Local Approximants in RBF-PU Interpolation". Journal of Scientific Computing 74 (1): 1–22. doi:10.1007/s10915-017-0418-7. 
  10. ↑ Cavoretto, R.; De Rossi, A.; Qiao, H. (2018). "Topology analysis of global and local RBF transformations for image registration". Mathematics and Computers in Simulation 147 (5): 52–72. doi:10.1016/j.matcom.2017.10.010. 
  11. ↑ Cancelliere, R.; Gai, M.; Gallinari, P.; Rubini, L. (2015). "OCReP: An Optimally Conditioned Regularization for pseudoinversion based neural training". Neural Networks 71 (11): 76–87. doi:10.1016/j.neunet.2015.07.015. 

Notes

This presentation is faithful to the original, with only a few minor changes to presentation, spelling, and grammar. We also added PMCID and DOI when they were missing from the original reference. No other modifications were made in accordance with the "no derivatives" portion of the distribution license.

Retrieved from "https://www.limswiki.org/index.php?title=User:Shawndouglas/sandbox/sublevel6&oldid=33817"