- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Recently Accepted Articles ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
The Scientific World Journal
Volume 2013 (2013), Article ID 346285, 8 pages
Decision Tree Approach for Soil Liquefaction Assessment
1Department of Civil Engineering, The University of Akron, Akron, OH 44325, USA
2Department of Statistics, The University of Akron, Akron, OH 44325, USA
Received 30 August 2013; Accepted 1 October 2013
Academic Editors: G.-C. Fang and S. Kazemian
Copyright © 2013 Amir H. Gandomi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
In the current study, the performances of some decision tree (DT) techniques are evaluated for postearthquake soil liquefaction assessment. A database containing 620 records of seismic parameters and soil properties is used in this study. Three decision tree techniques are used here in two different ways, considering statistical and engineering points of view, to develop decision rules. The DT results are compared to the logistic regression (LR) model. The results of this study indicate that the DTs not only successfully predict liquefaction but they can also outperform the LR model. The best DT models are interpreted and evaluated based on an engineering point of view.
Empirical classification techniques remain a highly researched topic, especially for real-world problems. In general, there are two types of classification techniques, statistical techniques and soft computing-based techniques. The most well-known soft computing techniques are artificial neural networks (ANNs), support vector machines (SVMs), and genetic programming (GP) . These techniques are heuristic and mostly have a random nature; therefore, several runs are required to achieve useful results, even for a constant parameter setting. In contrast, statistical classifiers do not have a random nature and they are mathematically proven. The most common statistical techniques are logistic regression (LR) and decision tree (DT). Although DT techniques have been successfully applied to several real-world problems, they have been rarely used in engineering, especially geotechnical engineering (e.g., ).
Soil liquefaction is a process by which intergranular stresses vanish within the soil. Generally, loose and saturated sandy soils are susceptible to liquefaction. Seismic shaking, nonseismic vibration, or waved-induced shear stresses can cause dynamic liquefaction. The application of noncyclic shear stresses can cause static liquefaction in some loose sediments . During the liquefaction process, a mass of saturated sandy soil tends to decrease in volume. If drainage conditions are not met or the drainage velocity is low, this decrease in volume will be accompanied with increased pore water pressure. Thereafter, the pore water pressure () will gradually equal the total stress () in the soil. Then, the value of effective stress () becomes zero; consequently, shear strength () approaches zero: In such a case, the saturated sandy soil functions as a liquid and cannot bear any shear strength, resulting in flow of the sand .
The potential failure of critical structures due to liquefaction is a major concern in geotechnical engineering. Thus, extensive research has been conducted to understand the liquefaction phenomenon. The results obtained from in situ tests such as the standard penetration test (SPT) and the cone penetration test (CPT) are widely used for the evaluation of the soil liquefaction potential (e.g., [5, 6]). As the most common in situ test, SPT provides an approximate measure of the dynamic soil resistance, as well as a disturbed drive sample. In order to perform this test, a hollow thick-walled tube is driven into the ground and the number of blows to advance the split-barrel sampler a vertical distance of 300 mm is measured. Using a drop weight system, a 63.5 kg (140 lb) hammer is repeatedly dropped from 0.76 m to achieve three successive increments of 150 mm . The value (“blow count”) or SPT resistance is the sum of the number of blows to advance the second and third increments. SPT can be used for characterizing a wide range of soil types. CPT is another fast and economical in situ test that provides continuous profiling of geostratigraphy and soil property evaluation . The test is performed by pushing a cylindrical steel probe into the ground at a constant rate of 20 mm/s and measuring the resistance to penetration. The standard penetrometer has a conical tip with 60° angle apex, 35.7 mm diameter body, and 150 cm2 friction sleeve. This test can be used in soils ranging from very soft clays to dense sands. CPT provides more accurate and reliable data for liquefaction analysis compared to more conventional soil tests, such as cyclic triaxial and simple shear tests. Thus, it can be considered as a very good complement to SPT measurements.
Classification techniques have been widely used for liquefaction modelling. Table 1 shows the techniques and the soil test used in each of them. From the table, it is clear that soft computing techniques have been widely used for liquefaction modeling. However, statistical methods such as LR and DT have been only used for liquefaction assessment based on CPT data. This paper presents liquefaction assessments based on SPT data using both LR and DT.
Generally, statistical and soft computing techniques are not based on engineering fundamentals, as they are empirically developed based on experimental data. In the current study, we have forced the liquefaction assessment DTs to use SPT results as the first variable to corroborate with the engineering point of view. Another common problem of most classification techniques is that they are not interpretable. However, DT does not have this issue and its built models can be easily interpreted based on the nature of the parameters. In this study, three different DT methodologies are used, including chi-squared automatic interaction detection (CHAID), exhaustive CHAID (E-CHAID), and classification and regression tree (CART) algorithms. The DT results are further compared with logistic regression (LR) analysis as a classical benchmark.
2. Predictive Modeling Techniques
2.1. Decision Tree Algorithms
Decision trees are becoming a more attractive predictive modeling procedure because of the easy interpretation by nonstatisticians. One of the advantages of DT analysis is that the relationship between the binary dependent variable and the related independent variables is clearly illustrated using a tree structure. DT analysis is especially useful when the independent variables are expressed as both categories and continuous values. This nonparametric modeling procedure makes no assumptions about the underlying data. DT analysis determines how independent variables best combine to explain the outcome of a given binary dependent variable. In simple terms, DTs break down to “yes” or “no” statements according to “if-then” logic. In DT algorithms, the data set is partitioned into two or more mutually exclusive subsets in each split. The goal is to produce subsets of the data which are as homogeneous as possible with respect to the target (dependent) variable.
Kass  proposed the CHAID (chi-squared automatic interaction detection) algorithm as the first tree-based classification technique. Continuous predictors are discretized into several groups and changed to ordinal predictors. The main steps of the algorithm are the merging, splitting, and stopping steps. Merging is useful for any potential parent node that has more than two categories; in this step, potential parent nodes are merged until all adjusted values are less than the defined . Splitting of potential parents is the process used to find the best split, using the lowest value; the splitting step selects which independent variable to be used to optimally split the node. The stopping step checks if the tree growing process should be stopped according to certain stopping rules (e.g., reaching the maximum tree depth level or minimum parent or child nodes).
Biggs et al.  proposed a new CHAID algorithm called exhaustive CHAID (E-CHAID). In E-CHAID, the basic CHAID algorithm is changed to improve merging and testing of dependent variables; as a consequence, E-CHAID is more computationally intensive. In the E-CHAID algorithm, there is no reference to any value; category merging continues until only two categories remain. Therefore, E-CHAID may not suitable for large data sets with many continuous predictor variables. The program then follows the splitting and stopping steps as described for the CHAID algorithm.
Breiman et al.  proposed the CART (classification and regression trees) algorithm. The main difference between the CART and CHAID algorithms is that the CART procedure will grow as a purely binary tree. Therefore, CART results are easier to understand, as parent nodes are always split into 2 child nodes. A complete binary tree algorithm partitions data and produces homogeneous subsets. In the CART procedure, we first develop the maximum tree and then prune it to avoid overfitting.
2.2. Logistic Regression
Logistic regression models are used when the dependent variable () is binary (e.g., the dependent variable can take the value of 1 with probability of success or the value of 0 with probability of failure ), and the independent variables () are either categorical or continuous values. The following is a representation of the binary multiple LR model: where is a constant and are the coefficients of the independent variables in the model. Equation (2), called the likelihood function, is used for estimating the LR coefficients in the model. The maximum likelihood estimation method uses an iterative procedure to find the model coefficients that best match the pattern of observations in the sample data. Interpretation of the model comes from transforming the LR coefficients for each independent variable. Simply take the exponential of the coefficients () to determine the influences of each independent variable on the dependent variable in terms of the odds ratio. To determine if each model coefficient is statistically significant, the Wald test will be used.
3. Liquefaction Modeling
3.1. Experimental Database and Data Preprocessing
A database  with 620 postearthquake observations and 12 variables has been used in this study. In addition to the seismic parameters, the database includes soil properties and the standard penetration test (SPT) results of the soil. The binary dependent variable is liquefaction and we selected a value of 0 for nonliquefied soils and a value of 1 for liquefied soils. The database includes the values of the following independent variables::soil specimen depth (m);()60:corrected PST number (%);:percent fines less than 75 μm (%);:ground water table depth (m);:total vertical stress (kPa);:effective vertical stress (kPa);:threshold acceleration, which contributes to the strain-based procedure and along with strain-based safety factor indicates the exceedance of the threshold strain (Hanna et al. 2007) (g);/:cyclic stress ratio, which illustrates the seismic demand on soil;:shear wave velocity (m/s);:initial soil friction angle (°);:earthquake magnitude (Richter);PHA:peak horizontal acceleration at ground surface (g).
The database was randomly divided into training and testing subsets. The training data were used for the model development using the algorithms. The testing data were used to evaluate the generalization capability of the obtained models on the unseen data. In order to obtain a consistent data division, several combinations of the training and testing sets were considered. Out of the 620 records, 80% was used as the training data and the remaining 20% of the data sets were taken for the testing of the generalization capability of the DTs and LR.
The descriptive statistics of the data used in this study are given in Table 2. From this table, it can be seen that the database contains only high magnitude earthquakes. The records indicate that 256 sites were liquefied and the remaining 364 were not liquefied.
The correlation matrix is computed for all parameters and is presented in Table 3. As expected, the total and effective vertical stresses have strong correlation, and specimen depth correlates strongly with both stresses. From this table, SPT results have high correlation with initial soil friction angle. This is expected as the friction angle represents the shear capacity of soil, which is the most important parameter in SPT results.
3.2. Model Construction Using DTs
The procedure of the CART algorithm ranks the independent variables in terms of their predictive power; the CART algorithm therefore serves as a powerful exploratory tool for understanding the underlying structure of the data . The relative importance of the 12 independent variables is shown in Figure 1. Figure 1 indicates that the most important predictor variable is friction angle (). Therefore, the first split of the CART algorithm is based on friction angle. In the CHAID and E-CHAID algorithms the lowest adjusted value in each level determines the most associate independent variable. After calculation, the friction angle has the lowest adjusted value at the beginning of the CHAID and E-CHAID algorithms, and again serves as the first split.
Based on geotechnical engineering theory, the SPT test results () should be the most associated parameter and should therefore be the first split in the DT algorithms. Therefore, for DT modeling, each algorithm was implemented in two ways:(1)let the DT algorithm determine the first split based on its own statistical method;(2)force the DT algorithm to use SPT test results as its first split.
The performance of a DT model mainly depends on the architecture and parameter settings. There are many parameters that are involved in the DT algorithms. For the CHAID and E-CHAID algorithms, the choices of maximum tree depth and minimum number of cases in the parent and child nodes play an important role in model construction. After evaluating different values for the maximum tree depth, it is apparent that only training results (not the results for unseen data) improve for maximum depths greater than 4. Therefore, to avoid overfitting, we have set the maximum tree depth as 4. Products of ten are considered for the minimum number of cases in the parent nodes; the minimum number of cases in the child nodes is always set as half of the parent nodes’ minimum. For this study, 30 and 15 are set as the values for the parent and child node maximum number of cases. Two chi-square statistics are commonly used in the CHAID and E-CHAID algorithms: Pearson and likelihood ratio. Pearson is faster than the likelihood ratio and is more suitable for very large databases. The likelihood ratio is more robust than Pearson, but its calculation is more time consuming and it is therefore more suitable for a small database . Due to its robustness, the likelihood ratio is used in this study as the chi-square statistic for both the CHAID and E-CHAID algorithms.
For the CART algorithm, the minimum number of cases in the parent and child nodes is set just like the other DT algorithms. The maximum tree depth is set as 7 and pruning is used to avoid overfitting (pruning at least one level in this problem). IBM SPSS software package version 21  was used to perform the analysis.
3.3. Model Construction Using LR
In the conventional classification process, logistic regression analysis is an important tool for building a model. In this study, the LR algorithm was performed to approximate the predictive power of the DT techniques in comparison with another statistical classification technique.
The LR models cannot be developed using the same input variables and data divisions as DTs. Before finding the final LR model, any multicollinearity problems between the independent variables were solved by removing the highly correlated independent variables from the model. Severe multicollinearity can cause instability in the model coefficients, especially when highly correlated variables are included in the model.
4. Results and Discussion
As described above and indicated in Table 4, six different DT-based models were obtained for the assessment of the soil liquefaction. The DT models for which the SPT results were the first variable are indicated with the suffix “SPT.” Overall performance of the DT and LR-based models in terms of misclassification rate (risk) on the training data and testing data subsets and the full data set are summarized in Table 4.
Two important characteristics of a classification model are sensitivity and specificity. Sensitivity quantifies the proportion of correctly identified positives (liquefied soils) and specificity gives the proportion of correctly identified negatives (nonliquefied soils). Sensitivity and specificity of all DT and LR models are also presented in Table 5. Comparing the performance of DTs and LRs, as tabulated in Tables 4 and 5, the DT results are clearly better than the LR results: the DTs generally have lower risk values and higher sensitivity and specificity values on the training, testing, and complete datasets. An interesting point from these tables is that when the DT algorithms are forced to used SPT results as the first variable, the model performances on the testing datasets (unseen data) are always improved. This suggests that the strategy of using SPT as the first variable is very effective for future prediction of new datasets. However, as expected, if the DTs use their own criteria for choosing the first variable during the training process, performance is improved on the training datasets but not the testing datasets.
As shown in Table 4, CHAID models (CHAID and CHAID-SPT) produce the lowest risks among all DTs and LRs. CHAID-SPT has the best performance on unseen testing data sets (risk equal to 0.169) and regular CHAID has the best performance on the training dataset (risk equal to 0.141). As predicting liquefied soil after earthquakes is very important, the highest sensitivity value for each set is bolded in Table 5. From this table, it can be seen that CHAID-SPT has the highest sensitivity on the testing datasets (sensitivity equal to 0.867) and CHAID has the highest sensitivity on the training datasets (sensitivity equal to 0.806). Therefore, these two models have been chosen as the final models.
Percentage of total records in the target category in each node is recognized as gain. The gains plot is a line chart of cumulative percentile gains calculated using cumulative percentile target over total target . The gains plot of the selected models (CHAID and CHAID-SPT) for the training results is presented in Figure 2. In this figure the straight line shows the random selection model, and the area between it and the model curve shows the model benefit area. Figure 2 shows the effectiveness of the CHAID and CHAID-SPT models. From this figure, it is clear that the CHAID model has the better benefit on the training data.
The final decision tree for the CHAID-SPT model is presented in Figure 3. This tree has 22 nodes, 14 of which are terminal nodes. The first level of the tree was split into four initial branches, corresponding to four ranges of SPT values. As seen in the first level of the tree, the two nodes for the highest SPT values are terminal nodes, which are interesting and show the importance of the SPT variable. For these two nodes (nodes 3 and 4), the chance of liquefaction is very low, which corresponds with geotechnical engineering theory.
In the second level, the percentage of fines is the best predictor for the soils with the lowest SPT values and its three splits show that liquefaction probability decreases with increasing percentage of fines. For larger SPT values (14 < SPT ≤ 24), peak ground surface horizontal acceleration is the best predictor. In this range, increasing peak horizontal acceleration substantially raises the chance of liquefaction, which corresponds with earthquake engineering fundamentals.
The third level consists largely of terminal nodes and has branches based on four different variables: earthquake magnitude, cyclic stress ratio, total vertical stress, and percentage of fines. In this level, the liquefaction probability decreases with increasing total vertical stress and increasing cyclic stress ratio. Like in the second level, liquefaction probability decreases with increasing percentage of fines.
In the fourth level, there are five terminal nodes: one node is split into three ranges of soil friction angle and one node is split using two ranges of effective vertical stress. In this level, the liquefaction probability decreases with increasing effective vertical stress, which corresponds to the trend of total vertical stress in the third level and geotechnical engineering fundamentals.
The final decision tree for the CHAID model is shown in Figure 4. This tree has more terminal nodes than the CHAID-SPT tree, with 26 nodes (17 of which are terminal nodes). The first level of the tree was split to six initial branches according to the initial soil friction angle, which was indicated as the variable most associated with liquefaction, according to the CHAID algorithm. As seen in the first level of the tree, the node for the highest angles ( > 39.29°) is a terminal node that indicates zero probability of liquefaction.
In the second level, nodes 1 and 2, related to the lowest initial soil friction angle ( ≤ 27.34°), are split using the percentage of fines. This indicates that percentage of fines is most associated with liquefaction prediction for low soil friction angles. From the branches of the nodes 1 and 2 of the CHAID tree (in the third level), the liquefaction probability decreases with increasing percentage of fines, which agrees with the previous results. The soil with an initial friction angle between the 28.49° and 33.5°, the cyclic stress ratio is the best predictor of liquefaction. The probability of liquefaction increases significantly with an increasing cyclic stress ratio.
In the third level, only one node is a parent node; the other six nodes are terminal nodes. In the fourth level, there are only two terminal nodes split using the percentage of fines. From the third and forth levels, it can be noted that liquefaction probability decreases with increasing percentage of fines.
From a comparison of the CHAID-SPT and CHAID trees, it can be seen that percentage of fines is the best second-level predictor for the lowest SPT values ( ≤ 14) and for the lowest initial soil friction angle values ( ≤ 27.34°). Another similarity of the developed CHAID and CHAID-SPT trees in the second level is that peak horizontal acceleration is the best predictor for midrange values of SPT (14 < ≤ 24) and midrange values of soil friction angle (33.5° < ≤ 39.29°). In the second level, for the highest values of SPT and initial soil friction angle, there is zero liquefaction probability. From these similarities, there appears to be a strong correlation between SPT and initial soil friction angle. This general conclusion can be also verified with the correlation coefficient of these two parameters (presented in Table 3). From these data, SPT and initial soil friction angle are high correlated parameters.
5. Summary and Conclusions
Six decision tree models were successfully developed in this study to classify the liquefied and nonliquefied soil using three different techniques. Based on geotechnical engineering theory, three of the decision trees were developed using SPT as the first variable. The results of the DT models were compared with those of an LR model; the results show that DT models generally have better performance than the LR model for this problem.
The two best models (CHAID and CHAID-SPT) were chosen based on the risk values and the sensitivity of the liquefaction prediction. The CHAID-SPT tree has better performance on the unseen (testing) dataset, indicating that basing DT models on engineering fundamentals can improve model performance. The general interpretation of the trees corresponds well with engineering theory, which indicates the reliability of the models. From the interpretation results of the trees, the SPT values and initial soil friction angle values (used as first variables of the trees) have strong correlation.
Some terminal nodes have small sample sizes, which may lead to results that are anecdotal. However, these anecdotal conclusions about soil liquefaction assessment are highly informative from an exploratory point of view. As the earthquake parameters do not have a wide range, their interpretation may not be accurate enough. Therefore, for future research, the database used in this study should be expanded to a wider range of earthquake parameters.
- A. H. Gandomi, X. S. Yang, S. Talatahari, and A. H. Alavi, “Metaheuristics in modeling and optimization,” in Metaheuristic Applications in Structures and Infrastructures, A. H. Gandomi, X. S. Yang, S. Talatahari, and A. H. Alavi, Eds., chapter 1, pp. 1–24, Elsevier, New York, NY, USA, 2013.
- J. Park, D. Ki, K. Kim, S. J. Lee, D. H. Kim, and K. J. Oh, “Using decision tree to develop a soil ecological quality assessment system for planning sustainable construction,” Expert Systems with Applications, vol. 38, no. 5, pp. 5463–5470, 2011.
- F. Darve, “Liquefaction phenomenon of granular materials and constitutive stability,” Engineering Computations, vol. 13, no. 7, pp. 5–28, 1996.
- S. S. H. Khozaghi and A. J. A. Choobbasti, “Predicting of liquefaction potential in soils using artificial neural networks,” Electronic Journal of Geotechnical Engineering, vol. 12, article 0723, 2007.
- H. B. Seed and I. M. Idriss, “Simplified procedure for evaluating soil liquefaction potential,” Journal of the Soil Mechanics and Foundations Division, vol. 97, no. 9, pp. 1249–1273, 1971.
- K. Tokimatsu and Y. Yoshimi, “Empirical correlation of soil liquefaction based on SPT N-value and fines content,” Soils and Foundations, vol. 23, no. 4, pp. 56–74, 1983.
- A. Arman, N. Samtani, R. Castelli, and G. Munfakh, “Geotechnical and foundation engineering module 1-subsurface investigations,” FHWA-HI-97-021, 1997.
- G. Kass, “An exploratory technique for investigating large quantities of categorical data,” Applied Statistics, vol. 29, no. 2, pp. 119–127, 1980.
- D. Biggs, B. de Ville, and E. Suen, “A method of choosing multiway partitions for classification and decision trees,” Journal of Applied Statistics, vol. 18, no. 1, pp. 49–62, 1991.
- L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone, Classification and Regression Trees, Chapman & Hall/CRC, New York, NY, USA, 1984.
- A. T. C. Goh, “Seismic liquefaction potential assessed by neural networks,” Journal of Geotechnical Engineering, vol. 120, no. 9, pp. 1467–1480, 1994.
- A. T. C. Goh, “Neural-network modeling of CPT seismic liquefaction data,” Journal of Geotechnical and Geoenvironmental Engineering, vol. 122, no. 1, pp. 70–73, 1996.
- Y. Najjar and H. Ali, “On the use of BPNN in liquefaction potential assessment tasks,” in Proceedings of the International Workshop on Artificial Intelligent and Mathematical Methods in Pavement and Geomechanical Systems, N. O. Attoh-Okine, Ed., pp. 55–63, 1998.
- A. T. C. Goh, “Probabilistic neural network for evaluating seismic liquefaction potential,” Canadian Geotechnical Journal, vol. 39, no. 1, pp. 219–232, 2002.
- M. Pal, “Support vector machines-based modelling of seismic liquefaction potential,” International Journal for Numerical and Analytical Methods in Geomechanics, vol. 30, no. 10, pp. 983–996, 2006.
- H. B. Zhao, Z. L. Ru, and S. Yin, “Updated support vector machine for seismic liquefaction evaluation based on the penetration tests,” Marine Georesources and Geotechnology, vol. 25, no. 3-4, pp. 209–220, 2007.
- A. M. Hanna, D. Ural, and G. Saygili, “Neural network model for liquefaction potential in soil deposits using Turkey and Taiwan earthquake data,” Soil Dynamics and Earthquake Engineering, vol. 27, no. 6, pp. 521–540, 2007.
- A. T. C. Goh and S. H. Goh, “Support vector machines: their use in geotechnical engineering as illustrated using seismic liquefaction data,” Computers and Geotechnics, vol. 34, no. 5, pp. 410–421, 2007.
- A. Baykasoǧlu, A. Çevik, L. Özbakir, and S. Kulluk, “Generating prediction rules for liquefaction through data mining,” Expert Systems with Applications, vol. 36, no. 10, pp. 12491–12499, 2009.
- A. H. Gandomi and A. H. Alavi, “Multi-stage genetic programming: a new strategy to nonlinear system modeling,” Information Sciences, vol. 181, no. 23, pp. 5227–5239, 2011.
- C. Kayadelen, “Soil liquefaction modeling by genetic expression programming and neuro-fuzzy,” Expert Systems with Applications, vol. 38, no. 4, pp. 4080–4087, 2011.
- A. H. Gandomi and A. H. Alavi, “A new multi-gene genetic programming approach to non-linear system modeling—part II: geotechnical and earthquake engineering problems,” Neural Computing and Applications, vol. 21, no. 1, pp. 189–201, 2012.
- P. M. Muduli and S. K. Das, “CPT-based seismic liquefaction potential evaluation using multi-gene genetic programming approach,” Indian Geotechnical Journal, 2013.
- A. H. Gandomi and A. H. Alavi, “Hybridizing genetic programming with orthogonal least squares for modeling of soil liquefaction,” International Journal of Earthquake Engineering and Hazard Mitigation, vol. 1, no. 1, pp. 2–8, 2013.
- S. Y. Lai, W. J. Chang, and P. S. Lin, “Logistic regression nodel for evaluating soil liquefaction probability using CPT data,” Journal of Geotechnical and Geoenvironmental Engineering, vol. 132, no. 6, pp. 694–704, 2006.
- G. Livingston, M. Piantedosi, P. Kurup, and T. G. Sitharam, “Using decision-tree learning to assess liquefaction potential from CPT and Vs,” in Proceedings of the 4th Geotechnical Earthquake Engineering and Soil Dynamics Congress, pp. 1–10, May 2008.
- H. Pham, Ed., Springer Handbook of Engineering Statistics, Springer, London, UK, 2006.
- M. J. Noruésis, IBM SPSS Decision Trees 20, IBM Corporation, 3rd edition, 2011.
- SPSS Inc., ver. 21, 2013, http://www.spss.com.