Advertisement
Browse Subject Areas
?

Click through the PLOS taxonomy to find articles in your field.

For more information about PLOS Subject Areas, click here.

  • Loading metrics

Predicting the Maximum Earthquake Magnitude from Seismic Data in Israel and Its Neighboring Countries

  • Mark Last ,

    Contributed equally to this work with: Mark Last, Nitzan Rabinowitz, Gideon Leonard

    mlast@bgu.ac.il

    Affiliation Department of Information Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva, Israel

  • Nitzan Rabinowitz ,

    Contributed equally to this work with: Mark Last, Nitzan Rabinowitz, Gideon Leonard

    Affiliation Human Monitoring Ltd., Rehovot, Israel

  • Gideon Leonard

    Contributed equally to this work with: Mark Last, Nitzan Rabinowitz, Gideon Leonard

    Affiliation Israel Atomic Energy Commission, Tel-Aviv, Israel

Predicting the Maximum Earthquake Magnitude from Seismic Data in Israel and Its Neighboring Countries

  • Mark Last, 
  • Nitzan Rabinowitz, 
  • Gideon Leonard
PLOS
x

Correction

14 Mar 2016: The PLOS ONE Staff (2016) Correction: Predicting the Maximum Earthquake Magnitude from Seismic Data in Israel and Its Neighboring Countries. PLOS ONE 11(3): e0151751. doi: 10.1371/journal.pone.0151751 View correction

Abstract

This paper explores several data mining and time series analysis methods for predicting the magnitude of the largest seismic event in the next year based on the previously recorded seismic events in the same region. The methods are evaluated on a catalog of 9,042 earthquake events, which took place between 01/01/1983 and 31/12/2010 in the area of Israel and its neighboring countries. The data was obtained from the Geophysical Institute of Israel. Each earthquake record in the catalog is associated with one of 33 seismic regions. The data was cleaned by removing foreshocks and aftershocks. In our study, we have focused on ten most active regions, which account for more than 80% of the total number of earthquakes in the area. The goal is to predict whether the maximum earthquake magnitude in the following year will exceed the median of maximum yearly magnitudes in the same region. Since the analyzed catalog includes only 28 years of complete data, the last five annual records of each region (referring to the years 2006–2010) are kept for testing while using the previous annual records for training. The predictive features are based on the Gutenberg-Richter Ratio as well as on some new seismic indicators based on the moving averages of the number of earthquakes in each area. The new predictive features prove to be much more useful than the indicators traditionally used in the earthquake prediction literature. The most accurate result (AUC = 0.698) is reached by the Multi-Objective Info-Fuzzy Network (M-IFN) algorithm, which takes into account the association between two target variables: the number of earthquakes and the maximum earthquake magnitude during the same year.

Introduction

As indicated by [1], the concept of time-dependent seismicity, which implies that current seismicity should be evaluated on the basis of the past data, has become an important topic in the evaluation of seismic hazards. Generally, there are two different aspects of earthquake prediction: long-term forecasting and short-term forecasting [2]. Whereas short-term forecasting is supposed to predict the exact time, location, and magnitude of an earthquake event, we focus here on long-term forecasting, which aims at predicting a large earthquake a year or even several years in advance. According to [2], most existing methods of long-term earthquake prediction are looking for recurrence patterns in the sequence of tectonic events occurring in the same region. However, large earthquakes often fail to occur around their expected recurrence times [3].

It has long been observed that the relationship between the frequency and the magnitude of seismic events in a given region follows the power law [4]. In other words, when observing earthquake occurrences over time we expect the earthquakes of small magnitude to be much more frequent than the earthquakes of large magnitude. Following the study of California earthquakes by [5], this relationship is named the Gutenberg-Richter inverse power law and it is defined mathematically as follows: (1) where N(M) is the cumulative number of events with magnitude greater or equal to M, a represents the logarithm of the number of earthquakes with magnitude greater or equal to zero, and b is the slope of the above equation. The values of a and b can be estimated from an empirical distribution of earthquake frequencies using the linear regression analysis [4]. The power law model is widely used for building earthquake hazard maps [6], which estimate the probability of exceeding a given magnitude over a specified amount of time, usually tens or hundreds of years. Thus, it is usually applied to long-term earthquake forecasting (like in [7]).

A long-term forecasting model for estimating large (M ≥ 4.95) earthquake probabilities is presented in [8]. Their model extends the common recurrence approach by assuming that future earthquakes are more likely to occur in areas where past earthquakes have occurred, including small ones (M ≥ 2). This assumption implies that the future number of earthquakes in a given area can be predicted based on the past number of earthquakes in the neighboring locations. They used the records of 300,278 seismic events in California from 1 January 1981 until 1 April 2010 with magnitude M ≥ 1.7. Their predictive feature is the seismicity rate (the number of M ≥ 2 events in a given cell smoothed by a kernel function) during the 24-year training period, whereas the predicted attribute is the number of M ≥ 3.5 or M ≥ 4.95 events during the subsequent five-year target period. In their experiments, the number of neighboring locations (the smoothing parameter) was set to 10. The effect of more distant locations was completely ignored. The magnitude distribution in a given location (cell) during the target period was estimated using the Gutenberg—Richter (GR) ratio [5]. The performance of each prediction model was evaluated by its average probability gain per earthquake relative to the reference (uniform) model. The highest probability gain reported by [8] was about 6.0.

Another attempt to utilize recurrence patterns in seismic time series is made in [9]. The goal is to predict events with a magnitude greater or equal to 4.5. The data points in a given area are grouped into sets of five chronologically ordered earthquakes. Each sequence is represented by the mean of the magnitude of the five-earthquakes, the time elapsed from the first earthquake and the fifth one and the signed variation of the b-values in the Gutenberg—Richter equation, which is determined from the fifty preceding events. Based on these three features, the five-event sequences in each area are partitioned into groups using the k-means clustering algorithm [10]. The authors have used the Spanish seismic data set, which included 4,017 earthquakes, whose magnitude varied between 3.0 and 7.0, during a 29-year period (1978–2007). The optimal number of clusters (k) was set to three according to the silhouette index [11]. After applying the proposed methodology to two separate areas in the dataset, having the highest amount of seismic events, certain sequences of clusters were found as precursors of moderate—large earthquakes with sensitivity and specificity of about 80%-90%.

The study of [4] makes an attempt to utilize multiple predictive features for predicting the magnitude of the largest seismic event in the following month, which is considered a short-term forecasting task. Their feature set contains eight seismic indicators including three indicators based on the Gutenberg—Richter law. Three neural network models were used in their study: a feed-forward Levenberg-Marquardt backpropagation (LMBP) neural network, a recurrent neural network, and a radial basis function (RBF) neural network. The models were trained and tested on seismic data from two different regions in California. In each region, the training set included monthly data from 41 years (1950–1990), whereas the period from January 1991 to September 2005 was used for testing. The monthly seismicity indicators were calculated for sliding windows of the last 50, 100, and 200 seismic events. Six binary classification tasks were defined by increasing the threshold magnitude from 4.5 to 7.0 in increments of 0.5. The network output of 1 represented the occurrence of an earthquake of predefined threshold magnitude or greater during the following month. The output of 0 stood for an absence of such an event. For the lowest threshold of 4.5, the reported recall (“hit rate”) of earthquakes exceeding the threshold magnitude varied between 0.44 and 0.67 with the false alarm rate of 0.31–0.44.

Though the level of seismic activity in Israel and its neighboring countries is considered moderate, the region did experience some devastating earthquakes in the past and the rapid increase in population density, along with inconsistent construction standards, makes it particularly vulnerable to strong earthquakes in the future [7]. The authors of [1] have studied the earthquake distribution along the Dead Sea Fault (DSF) during the past 60,000 years. They analyzed data sets of prehistoric—paleoseismic, historical, and modern (instrumental) observations (from the years 1983–2007) in three different segments along the DSF: the southern Arava Valley, the northern Jordan Valley, and the Dead Sea basin. They found that the Gutenberg—Richter relation between the magnitude and frequency of earthquakes [5] provides a good explanation for the data observed in each segment separately as well as for all DSF data. The Gutenberg—Richter relation was also used by [7] for estimating the earthquake recurrence rates and the 50-year seismic hazard for ten seismic zones in Israel.

This paper presents the first attempt to apply data mining and time-series analysis methods for long-term earthquake prediction in Israel and its vicinity, utilizing a relatively small catalog of seismic events. We also construct a larger set of seismic indicators than the previous works in long-term earthquake forecasting and perform a comprehensive evaluation of multiple classification techniques on this task. Rather than training separate classification models on small datasets related to each region, we combine the data of 10 regions into one data table to produce a general classification model. Then we demonstrate the use of ROC curves for evaluating earthquake forecasting methods. We show that the Multi-Objective Info-Fuzzy Network (M-IFN) algorithm outperforms single-objective classification algorithms on the earthquake prediction task. Finally, we indicate further directions for the contribution of data mining methods to this important and challenging field.

Materials and Methods

Catalog Description

We have obtained 9,531 instrumental records of earthquake events, which took place between 05/01/1900 and 07/08/2011. These records are stored in the Geophysical Institute of Israel (GII) database (www.gii.co.il) and they are available from the Institute upon request. Each record includes the following information:

  1. Earthquake timing (YEAR, MONTH, DAY, HOUR, MINUTE, and SECOND)
  2. Earthquake magnitude expressed by the following three parameters:
    • Md—Local Richter Magnitude
    • Mb–Estimated Body Waves Magnitude
    • Mm–Seismic Moment Magnitude
  3. Earthquake location (X, Y, H, LAT(N), and LON (E))
  4. AREA (33 distinct areas defined by the Geophysical Institute of Israel). Details on the boundaries and the characteristics of seismogenic zones in Israel are available in [12]. The map of seismogenic zones is shown in Fig 1.
  5. FELT (F—felt, blank—not felt)
  6. MSK (The maximum measured magnitude in Israel on the MSK, Medvedev-Sponheuer-Karnik, scale)

The dataset includes only events where at least one of the magnitudes (Md, Mb or Mm) has reached the level of 2.0 and higher. Thus, we have computed the maximal magnitude of each event as the maximum of its three magnitudes (Md, Mb, and Mm). The calculated attribute is called Max_Event_Magnitude. Based on the website documentation, we have assumed the GII catalog to be complete with respect to this threshold since 1983, leaving us with 9,042 earthquake events to be used in our analysis. In our analysis, we have focused on top 10 areas having the highest number of earthquakes, which cover around 80% of all recorded earthquakes. The list of these areas is presented in Table 1 and their geographic location is shown in Fig 1. The areas are connected to each other and they cover part of the Syrian African Fault, the Sinai Peninsula, the Gulf of Suez, and the East Mediterranean (including Cyprus). The second column of Table 1 shows the total number of recorded seismic events, whereas the third and the fourth columns present the maximum and the medium magnitude, respectively, recorded in each area during the period of study. The total number of mainshocks in each area is shown in the last column.

Data Cleaning

It is a common practice to remove foreshock and aftershock events before computing various seismic indicators [9]. An aftershock is defined as a minor shock following the mainshock of an earthquake whereas a foreshock is an earthquake followed by an event of equal or larger magnitude within a short period of time [13]. Since the time windows for both foreshock and aftershock removal are usually measured in days [13], we have replaced multiple events recorded on the same day by a single “daily event” having the maximum magnitude on that day. No significant information is lost by this operation, since all events of lower magnitude, which occurred on the same day, can be safely considered as either foreshocks or aftershocks of the maximum magnitude event. Based on [13], we have defined Algorithm 1 for foreshock and aftershock removal, which is applied to a set of daily seismic events in a given area. The algorithm assumes the set of events to be sorted in the order of their occurrence.

Algorithm 1. Foreshock and aftershock removal

Input:

Fore_Shock_Win //the size of the foreshock window (days)

After_Shock_Win //the size of the aftershock window (days)

Num_Records //number of daily events in a given area

Max_of_Max [k] //magnitude of daily event k

Date [k] //date of daily event k

Output: Shock[k] // shock type of daily event k (S–mainshock, F–foreshock, A–aftershock)

For (k = 0; k < Num_Records; k++)

Shock [k] ← S //default = mainshock

//Identify foreshocks

 If (k < (Num_Records—1))

  Nextk + 1

  Diff_Next ← (Date[Next]Date[k]) //Compute difference to the next record suspicious as mainshock

  Diff[k]Diff_Next

  While ((Diff_NextFore_Shock_Win) and (Shock[k] = S) and (Next < Num_Records))

   If (Max_of_Max[Next] ≥ Max_of_Max[k])

    Shock[k] ← F//foreshock

    ForeshocksForeshocks + 1

   Else

    Next++

    If (Next < Num_Records)

     Diff_Next ← (Date[Next]—Date[k]) //Compute difference to the next suspicious record

    End If

   End If

  End While

 End If

//Identify aftershocks

 If (k > 0)

  Previousk—1

  Diff_Previous ← (Date[k]—Date[Previous]) //Compute difference to the previous record suspicious as mainshock

  While ((Diff_PreviousAfter_Shock_Win) and (Shock[k] ≠ A) and Previous ≥ 0)

   If (Max_of_Max[Previous] > Max_of_Max[k])

    Shock[k] ← A //aftershock

    After_ShocksAfter_Shocks + 1

   Else

    PreviousPrevious—1

    If (Previous ≥ 0)

     Diff_Previous = (Date[k]—Date[Previous]) //Compute difference to the previous suspicious record

    End If

   End If

  End While

 End If

End For //Next record

Following the foreshock and aftershock studies presented in [13] and [14], we have set the sizes of the foreshock and the aftershock windows to 5 and 10 days, respectively. The number of mainshocks identified in each area by Algorithm 1 is shown in the fifth column of Table 1.

Seismicity Indicators Extraction

The ultimate goal of this study is to predict the maximum earthquake magnitude in a given area during the next year. Thus the feature vector can include any seismic indicator, which can be calculated at the end of the current year. We start with the description of the six indicators adopted from [4] and then present some additional indicators, which were not used in the previous studies.

Existing Indicators [4].

All six indicators of [4] are calculated over a sliding window of the last n events in a given area preceding the forecasted period. The minimal value of n used in various studies is 50 (e.g., [4] [9]) and this is also the value we have used here. The value of n determines the first period in a given catalog (a year in our case), for which the seismic indicators can be estimated and the forecast can be made. Due to the limited amount of complete data in the GII catalog (about 28 years only), we have not experimented with values of n, which are larger than 50. As indicated in Table 1, we have limited our analysis to top 10 areas that experienced at least 110 mainshocks. The definitions of the specific indicators follow.

  1. The T value. This is the time elapsed over the last n events of magnitude greater than a predefined threshold value. It is defined as
    (2)
    where tn is the time of occurrence of the n-th event and t1 is the time of occurrence of the first event. If there is an increase in the seismic activity during the period preceding the forecasted year, the T value becomes smaller and vice versa. The threshold value used in our study is the completeness threshold of the GII catalog (Richter magnitude of 2.0).
  2. The Mean Magnitude. This is the mean of the Richter magnitudes of the last n events defined as
    (3)
    This is another important indicator of recent seismic activity.
  3. The rate of square root of seismic energy released (dE1/2). The rate of square root of seismic energy released over time T is defined as
    (4)
    where E1/2 is the square root of the seismic energy (E) is calculated from the corresponding Richter magnitude M using the following empirical relationship [15]:
    (5)
    If the release of seismic energy is disrupted for significantly long periods of time (called "seismic quiescence"), the accumulated energy will be released abruptly in the form of a major seismic event when the stored energy reaches a threshold [16].
  4. The slope of the regression line fitting the curve of the log of the earthquake frequency versus magnitude (b value). This parameter is based on the Gutenberg-Richter inverse power law (Eq 1) and it can be calculated using Algorithm 2 from the last n events sorted in the order of their occurrence. The algorithm calls a standard Linear_Regression function, which implements the least squares linear regression method with the following input parameters:
    n–the sample size (number of observations)
    Intercept– 0 if the equation intercept (a) should be equal to zero and 1 otherwise
    yn values of the dependent variable (log10 N(M) in our case)
    xn values of the independent variable (M in our case)
    More details on calculating the coefficients of the linear regression equation with the least squares method are available in [17].
    Algorithm 2. Calculating the Gutenberg-Richter relationship
    Input:
    Min_Shock_No //ID of the first mainshock in the sliding window of last events
    Max_Shock_No //ID of the last mainshock in the sliding window of last events
    Shock_Max_of_Max[m] //Magnitude of mainshock m
    Output:
    a, b //Coefficients of Eq (1)
    Tot_Shocks //Size of the regression sample
    Tot_Shocks = Max_Shock_No—Min_Shock_No + 1
    j ← 0 //Initialize the index of the regression sample
    For (l = Min_Shock_No; lMax_Shock_No; l++)
      N_Sample [j] ← 0 //initialize N (M)–the number of events with magnitude greater or equal to the magnitude of event j
      Shock_Max_of_Max_Sample [j] ← Shock_Max_of_Max[l]; // copy the mainshocks subset to the regression sample
      For (m = Min_Shock_No; mMax_Shock_No; m++)
       If (Shock_Max_of_Max[m] ≥ Shock_Max_of_Max[l])
        N_sample [j] ← N_sample [j] + 1 //increment number of events with magnitude greater or equal to the event l
       End If
      End For
      j ← j + 1 // Increment the index of the regression sample
    End For
    Linear_Regression. (Tot_Shocks, 1, log10 (N_Sample), Shock_Max_of_Max_Sample) //Find the coefficients a and b of the linear regression equation using the least squares method with non-zero intercept
  5. The Mean Squared Error (MSE) of the regression line based on the Gutenberg-Richter inverse power law (η value). We use here an unbiased estimator of this parameter, which is defined as follows:
    (6)
    Where Ni is the number of events in the sliding window with magnitude Mi or greater. This is a measure of the conformance of the observed seismic data to the Gutenberg-Richter inverse power-law relationship.
  6. Magnitude deficit or the difference between the largest observed magnitude and the largest expected magnitude based on the Gutenberg-Richter relationship (ΔM value). It is shown in [4]) that this value is equal to the ratio a/b of the Eq (1) coefficients.

The work of [4] has used two additional seismic indicators: Mean time between characteristic events (large earthquakes) and Coefficient of variation of the mean time between characteristic events. We have excluded these indicators from our study for two reasons: the short period of the available complete data, which includes a small number of large earthquakes if any, and the limited performance of these two features reported in [4].

New Indicators.

In addition to the seismic indicators (1)–(6) adopted from the existing earthquake prediction literature, we have defined two new feature types based on the Gutenberg-Richter law during the forecasted period (a year in our case). Our goal is to predict whether the maximum earthquake magnitude in the following year will exceed some magnitude threshold (e.g., the median of maximum yearly magnitudes in the same area). Eq (1) implies that the expected number of events exceeding a threshold th during the forecasted period can be calculated by: (7) Consequently, the probability that the magnitude of a randomly selected event will exceed the threshold th can be found by the ratio between N(M ≥ th) and the expected number of recorded events N(M ≥ M0), where M0 is the completeness threshold of the catalog (2.0 in case of the GII database). This probability is derived below: (8) From Eq (8), we can find the probability that the maximum magnitude of n events recorded in the forecasted period will exceed the threshold as a complement of the probability that the magnitude of all n events will be below the threshold: (9) Unfortunately, Eq (9) cannot be used directly for estimating the probability of the maximum earthquake magnitude to exceed the threshold th, since the number of events in the forecasted period is not known in advance and we are not aware of any reliable models predicting this number. Instead, we try to utilize the recurrence patterns potentially presenting in the yearly earthquake data by calculating the moving averages of the yearly number of events over 1–10 years preceding the forecasted year and apply Eq (9) to each of these moving averages. Thus we obtain 20 new seismic indicators: MA (1)–MA (10) and Prob_Max (1)–Prob_Max (10), where MA (x) stands for the moving average of the number of events (mainshocks) over x years and Prob_Max (x) is the probability that the maximum magnitude of MA (x) events will exceed the threshold th. Consequently, we have increased the number of predictive features from six to twenty-six.

Earthquake Prediction Algorithms and Tools

We define the earthquake magnitude prediction as a binary classification task based on the median of maximum yearly magnitudes in a given area. According to our approach, the forecasted year is labeled as belonging to one of two classes: "Yes" if the maximum earthquake magnitude exceeds the median or "No" if it is below the median. We have chosen the median magnitude as the prediction threshold, since it presents the most balanced classification task and also due to the fact that the median magnitudes in most areas under study fall in the range of [3.5, 4.2] making the difference between earthquakes which rarely cause any damage and the earthquakes where some extent of damage should be expected. We assume that all seismic indicators defined in the previous section are calculated at the end of the previous year, which also serves as the end-point of the sliding window of n last events.

Due to the large number of available seismic indicators [26], we have evaluated the predictive effect of each indicator using a popular feature selection metric called Information Gain Ratio (IGR) [18], which “punishes” the multi-valued attributes via dividing their information gain by their own entropy (“Split Information”). The Information Gain Ratios of seismic indicators were calculated and normalized in the [0, 1] range using the Weight by Information Gain Ratio operator of RapidMiner [19]. As indicated below, when using classification methods, which do not have a built-in feature selection property (k-NN, ANN, and SVM), we have removed the attributes with normalized weights below 0.8 using the Select by Weights RapidMiner operator.

The following classification algorithms were used in our experiments:

  • J48, the Java implementation of the most popular decision-tree algorithm C4.5 [18]. As C4.5 chooses the best testing feature at each tree node, the algorithm was used without feature selection.
  • AdaBoost [20], a well-known meta-learner algorithm, which repeatedly applies a weak classifier to weighted examples in a dataset. At each step, the weights of the examples are updated to put more focus on the incorrectly classified examples. Following relatively poor results with J48 (see below), we have used AdaBoost in conjunction with J48. No feature selection was applied.
  • Information Network (IN) [21], a decision-tree algorithm, which uses the same feature across the nodes of a given layer. The features are selected incrementally to maximize a global decrease in the conditional entropy of the classification attribute. The IN induction algorithm is using the pre-pruning approach: when no attribute causes a statistically significant decrease in the entropy, the model construction is stopped. In [21], the algorithm is shown empirically to produce much more compact models than other methods of decision-tree learning, while preserving nearly the same level of classification accuracy.
  • Multi-Objective Info-Fuzzy Network (M-IFN) [22], a multi-objective extension of the IN model, where each leaf node is associated with several target (predicted) attributes. The M-IFN algorithm was shown theoretically and empirically to produce the optimal (most accurate) models when all target attributes are either mutually independent or completely dependent on each other. This property makes it particularly useful for trying to simultaneously predict two target attributes, the maximum magnitude and the total number of seismic events, which are known to be related to each other by the Gutenberg-Richter law. Both IN and M-IFN have the built-in feature selection property. Both algorithms have only one tuning parameter, the significance level, which has a default value of 0.001.
  • K-Nearest Neighbors (k-NN) [23], a “lazy” learning algorithm, which classifies each testing example by the labels of k training examples that are most similar to it. To avoid the impact of irrelevant features on distance calculations, we have applied this algorithm with feature selection by removing the attributes with normalized weights below 0.8. The best value of k was chosen to optimize the classification performance (k = 2 for all features and k = 3 for the basic features).
  • Support Vector Machine (SVM) [24], a powerful classification algorithm, which searches for the optimal separating hyperplane between two classes. We have chosen SVM with RBF kernel, since it optimized the classification performance. Feature selection was applied with the same threshold (0.8).
  • Artificial Neural Networks (ANN) [23], a biologically inspired method for learning complex, nonlinear functions. We have experimented with two ANN learning algorithms: Backpropagation (BP) and Gaussian radial basis function network (RBF). The attributes with normalized weights below 0.8 were removed.

All above classification algorithms, except IN and M-IFN, were applied using the appropriate RapidMiner operators. For IN and M-IFN, we have used our own implementation of the algorithms, which can be downloaded from doi:10.5061/dryad.9tq97. Unless indicated above, the default settings of all algorithms, set by RapidMiner or by the IN / M-IFN software, were kept unchanged.

Results

Rather than training separate classification models on small datasets related to each seismic area, we have combined the data of 10 areas into one data table to produce a general classification model. Since the analyzed catalog includes only 28 years of complete data, we have kept the last five annual records of each area (referring to the years 2006–2010) for testing while using the previous annual records for training. The class label of each record was set to zero if the maximum magnitude in the corresponding year and area was below the area median, and set to one otherwise. When running the M-IFN algorithm, we have added a second target attribute to each yearly record—the number of mainshocks. Our training set included 136 records, whereas the testing set had 49 records. The years, where no earthquakes were recorded in a given area (e.g., Sinai in 2010), were excluded from the analysis. The preprocessed training and testing datasets in the IN / M-IFN compatible format can be downloaded from doi:10.5061/dryad.9tq97.

The Information Gain Ratio (IGR) weights of all features are shown in Table 2, in the ascending order of importance. It is noteworthy that the six moving average features have taken the highest rankings [21–26], followed by six magnitude exceeding probabilities (ranks 15–20). The b coefficient of the Gutenberg-Richter equation is ranked only 14 out of 26, whereas other seismic indicators of [4] are ranked between 5 and 12 only.

thumbnail
Table 2. Information Gain Ratio weights of all features (*—selected features).

http://dx.doi.org/10.1371/journal.pone.0146101.t002

Since the maximum magnitude prediction is a probability estimation problem, we have used the area under testing ROC curves (Testing AUC) for evaluating different classification algorithms. The ROC (Receiver Operating Characteristics) curves [25] are two-dimensional graphs in which the TP (True Positive) rate is plotted on the Y axis and the FP (False Positive) rate is plotted on the X axis. In the case of earthquake prediction models, an ROC curve depicts the relative trade-off between true positives (years which exceeded the median magnitude and were predicted in advance) and false positives (unnecessary warnings issued for the years which did not exceed the median). In any ROC curve, the diagonal line y = x represents the strategy of randomly guessing a class. A useful classifier should have an ROC curve above the diagonal line implying that its AUC is higher than 0.5. An ideal classifier, which is never wrong in its prediction, would have the maximum AUC of 1.0.

To further evaluate the contribution of the 20 new seismic indicators (moving averages over 1–10 years and the corresponding median exceeding probabilities), we have performed two sets of experiments with all classification algorithms: using all 26 features and using only the six basic features from [4]. The testing AUC results are presented in Table 3. The multi-objective model of M-IFN clearly shows the best result (AUC = 0.698), explained by its capability to take into account the relationship between two target variables: the number of earthquakes and the maximum earthquake magnitude during the same year. Such multi-target classification capability is missing in all other classification algorithms included in our experiments. SVM and RBF-based neural network are ranked second and third, respectively. It is evident that the new features provide a significant improvement in the classification performance over the basic features of [4] for all tested classification algorithms. Some induced models were as good as a random guess (e.g., J48 with basic features) or even worse (like BP-NN with all features).

The M-IFN algorithm, which has induced the most accurate prediction model, has selected the following predictive features:

  • MA (1)–the number of events (mainshocks) in the last year
  • Prob_Max (3)—the probability that the maximum magnitude of MA (3) events will exceed the median
  • Prob_Max (7)—the probability that the maximum magnitude of MA (7) events will exceed the median

The M-IFN prediction rules are shown in Table 4. The rules with the highest probability of the maximum earthquake magnitude to exceed the median (Rules 2, 5, and 7) refer either directly, or indirectly to an increase in the number of events during the preceding one, three and seven years, respectively. This result agrees with the precursory scale increase phenomenon, which involves an increase in the magnitude and rate of occurrence of minor earthquakes as a precursor of a major seismic event [26].

The M-IFN Testing ROC curve is shown in Fig 2. The Youden Index [27] value of the curve (max (tp—fp)) is 39.41% corresponding to sensitivity of 60.00%, specificity of 79.41%, and false alarm rate of 20.59%.

Conclusion

The results of this work demonstrate the potential of data mining methods for the important task of earthquake prediction in seismically active areas around the world. As opposed to previously published long-term forecasting methods, such as [7] and [8], which build mainly upon the Gutenberg-Richter inverse power law, we show in this paper that the data mining models can utilize multiple seismic indicators as predictive features. The best performing model in this study, Multi-Objective Info-Fuzzy Network (M-IFN), does not require any fine-tuning of its parameters, unlike the clustering approach presented in [9], which involves selecting the optimal number of clusters. The specificity of the M-IFN model over the 10 analyzed areas (79.41%) is close to the specificity of one of the two area models induced by [9] from the Spanish seismic dataset (82.56%), whereas the M-IFN sensitivity (60.00%) is lower by 20%–30% than the sensitivity of the two area models in [9]. Compared to the short-term forecasting study in [4], which has reported the sensitivity / recall of 0.44–0.67 and the false alarm rate of 0.31–0.44, the M-IFN sensitivity of 0.60 corresponds to the false alarm rate of 0.21 only.

Possible ways for further improving the accuracy of data mining models include taking into account spatio-temporal associations between neighboring seismic areas (similar to [8]) and applying time-series forecasting models for predicting the number and the magnitude of seismic events in subsequent periods.

Acknowledgments

We thank the Geophysical Institute of Israel for collecting and providing the seismic data used in this study.

Author Contributions

Conceived and designed the experiments: GL NR ML. Performed the experiments: ML. Analyzed the data: ML NR. Contributed reagents/materials/analysis tools: ML. Wrote the paper: ML NR GL.

References

  1. 1. Hamiel Y, Amit R, Begin ZB, Marco S, Katz O, Salamon A, et al. The seismicity along the Dead Sea Fault during the last 60,000 years. Bull. Seism. Soc. Am. 2009 June; 99(3): 2020–2026.
  2. 2. Murck BW, Skinner BJ. Geology Today: Understanding Our Planet New York: John Wiley & Sons; 1999.
  3. 3. Stein S, Geller R, Liu M. Bad Assumptions or Bad Luck: Why Earthquake Hazard Maps Need Objective Testing. Seismol. Res. Lett. 2011 September/October; 82: 623–626.
  4. 4. Panakkat A, Adeli H. Neural Network Models for Earthquake Magnitude Prediction Using Multiple Seismicity Indicators. Int J Neural Syst. 2007; 17(01): 13–33.
  5. 5. Gutenberg B, Richter CF. Frequency of earthquakes in California. Bull. Seism. Soc. Am. 1944 October; 34: 185–188.
  6. 6. Frankel A. Mapping Seismic Hazard in the Central and Eastern United States. Seismol. Res. Lett. 1995; 66(4): 8–21.
  7. 7. Arieh E, Rabinowitz N. Probabilistic assessment of earthquake hazard in Israel. Tectonophysics. 1989 October 10; 167(2–4): 223–233.
  8. 8. Werner MJ, Helmstetter A, Jackson DD, Kagan YY. High-Resolution Long-Term and Short-Term Earthquake Forecasts for California. Bull. Seism. Soc. Am. 2011 August; 101: 1630–1648.
  9. 9. Morales-Esteban A, Martinez-Alvarez F, Troncoso A, Justo JL, Rubio-Escudero C. Pattern recognition to forecast seismic time series. Expert Syst. Appl. 2010 December; 37(12): 8333–8342.
  10. 10. Lloyd SP. Least Squares Quantization in PCM. IEEE Trans. Information Theory. 1982; 28: 129–137.
  11. 11. Kaufmann L, Rousseeuw PJ. Finding groups in data: An introduction to cluster analysis Hoboken: John Wiley & Sons; 2008.
  12. 12. The Geophysical Institute of Israel, Seismology Division. Seismological Bulletin. Earthquakes in and around Israel. 2010. Report No.: GII No. 033/777/14.
  13. 13. Tormann T, Savage MK, Smith EGC, Stirling MW, Wiemer S. Time-, Distance-, and Magnitude-Dependent Foreshock Probability Model for New Zealand. Bull. Seismol. Soc. Am. 2008; 98(5): 2149–2160.
  14. 14. Ziv A. Does aftershock duration scale with mainshock size? Geophys. Res. Lett. 2006; 33(17): 1944–8007.
  15. 15. Keilis-Borok VI, Kossobokov VG. Premonitory activation of earthquake flow: Algorithm M8. Phys. Earth Planet. Inter. 1990;(61): 73–83.
  16. 16. Tiampo K, Rundle J, McGinnis S, Gross S, Klein W. Mean-field threshold systems and phase dynamics: An application to earthquake fault systems. Europhys. Lett. 2002;(60): 481–487.
  17. 17. Minium EW, Clarke RC, Coladarci T. Elements of Statistical Reasoning. 2nd ed. New York: John Wiley & Sons; 1999.
  18. 18. Quinlan JR. C4.5: Programs for Machine Learning San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.; 1993.
  19. 19. Mierswa I, Wurst M, Klinkenberg R, Scholz M, Euler T. YALE: Rapid Prototyping for Complex Data Mining Tasks. In KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining; 2006; Philadelphia, PA, USA: ACM. 935–940.
  20. 20. Freund Y, Schapire RE. A decision-theoretic generalization of on-line learning and an application to boosting. In Proceedings of the Second European Conference on Computational Learning Theory (EuroCOLT '95); 1995; London, UK: Springer-Verlag. 23–37.
  21. 21. Last M, Maimon O. A Compact and Accurate Model for Classification. IEEE Trans. Knowl. Data Eng. 2004; 16(2): 203–215.
  22. 22. Last M. Multi-Objective Classification with Info-Fuzzy Networks. In Proceedings of the 15th European Conference on Machine Learning (ECML 2004); 2004; Berlin: Springer-Verlag. 239–249.
  23. 23. Mitchell T. Machine Learning: McGraw Hill; 1997.
  24. 24. Cristianini N, Shawe-Taylor J. Support Vector Machines: Cambridge University Press; 2000.
  25. 25. Fawcett T. An introduction to ROC analysis. Pattern Recogn. Lett. 2006; 27(8): 861–874.
  26. 26. Rhoades DA. Application of the EEPAS model to forecasting earthquakes of moderate magnitude in southern California. Seismol. Res. Lett. 2007; 78(1): 110–115.
  27. 27. Krzanowski WJ, Hand DJ. ROC Curves for Continuous Data: Chapman & Hall/CRC; 2009.