Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/96798
Title: Heuristic advances in identifying aftershocks in seismic sequences
Authors: D'Amico, Sebastiano
Cacciola, Matteo
Parrillo, Francesco
Morabito, Francesco Carlo
Versaci, Mario
Barrile, Vincenzo
Keywords: Earthquake aftershocks
Soft computing
Earthquake prediction -- Data processing
Radial basis functions
Neural networks (Computer science)
Support vector machines
Issue Date: 2009-02
Publisher: Elsevier
Citation: D’Amico, S., Cacciola, M., Parrillo, F., Carlo Morabito, F., Versaci, M., & Barrile, V. (2009). Heuristic advances in identifying aftershocks in seismic sequences. Computers & Geosciences, 35(2), 245-254.
Abstract: Soft computing techniques are known in scientific literature as capable methods for function approximation. Within this framework, they are applied to forecasting time series in non-linear problems, where estimation of the sample starting from actual measurements is very difficult. In this paper, we exploited soft computing techniques in order to predict the number of earthquakes (i.e. aftershocks) occuring after a large earthquake. The forecasting involves the aftershocks occuring day by day after a large earthquake, i.e. an earthquake having a magnitude MX7:0 Richter. In particular, a comparison between radial basis function neural networks and support vector regression machines has been carried out, in order to overcome some problems related to the so called Delta/Sigma method, i.e. a probabilistic approach already used to detect aftershock events with magnitude M45:5 after a large earthquake. A database for the Pacific area is used for the study, and the obtained results are very interesting.
URI: https://www.um.edu.mt/library/oar/handle/123456789/96798
Appears in Collections:Scholarly Works - FacSciGeo

Files in This Item:
File Description SizeFormat 
Heuristic_advances_in_identifying_aftershocks_in_seismic_sequences.pdf
  Restricted Access
658.33 kBAdobe PDFView/Open Request a copy


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.