scholarly journals Support Vector Machines for the Estimation of Specific Charge in Tunnel Blasting

2021 ◽  
Author(s):  
Aref Alipour ◽  
Mojtaba Mokhtarian-Asl ◽  
Mostafa Asadizadeh
Keyword(s):  
Blast Hole ◽  
Ground Vibration ◽  
Polynomial Kernel ◽  
Support Vector ◽  
Data Sets ◽  
Specific Charge ◽  
Hydro Power ◽  
Cross Section Area ◽  
Tunnel Blasting ◽  
Input Variables

Mine tunnels, short transportation tunnels, and hydro-power plan underground spaces excavations are carried out based on Drilling and Blasting (D&B) method. Determination of specific charge in tunnel D&B, according to the involved parameters, is very significant to present an appropriate D&B design. Suitable explosive charge selection and distribution lead to reduced undesirable effects of D&B such as inappropriate pull rate, over-break, under-break, unauthorized ground vibration, air blast, and fly rock. So far, different models are presented to estimate specific charge in tunnel blasting. In this study, 332 data sets, including geomechanical characteristics, D&B, and specific charge are gathered from 33 tunnels. The data are related to three dams and hydropower plans in Iran (Gotvand, Masjed-Solayman, and Siah-Bishe). Specific charge is modeled in inclined hole cut drilling pattern. In this regard, Support Vector Machine (SVM) algorithm based on polynomial Kernel function is used as a tool for modeling. Rock Quality Designation (RQD) index, Uniaxial Compressive Strength (UCS), tunnel cross-section area, maximum depth of blast hole, and blast hole coupling ratio are considered as independent input variables and the specific charge is considered as a dependent output variable. The modeling results confirm the acceptable performance of SVM in specific charge estimation with minimum error.

scholarly journals An Improved Skewness Decision Tree SVM Algorithm for the Classification of Steel Cord Conveyor Belt Defects

2018 ◽  
Vol 8 (12) ◽  
pp. 2574 ◽  
Author(s):  
Qinghua Mao ◽  
Hongwei Ma ◽  
Xuhui Zhang ◽  
Guangming Zhang
Keyword(s):  
Decision Tree ◽  
Classification Accuracy ◽  
Pso Algorithm ◽  
Conveyor Belt ◽  
Kernel Functions ◽  
Polynomial Kernel ◽  
Support Vector ◽  
Data Sets ◽  
Classification Problems ◽  
Steel Cord

Skewness Decision Tree Support Vector Machine (SDTSVM) algorithm is widely known as a supervised learning model for multi-class classification problems. However, the classification accuracy of the SDTSVM algorithm depends on the perfect selection of its parameters and the classification order. Therefore, an improved SDTSVM (ISDTSVM) algorithm is proposed in order to improve the classification accuracy of steel cord conveyor belt defects. In the proposed model, the classification order is determined by the sum of the Euclidean distances between multi-class sample centers and the parameters are optimized by the inertia weight Particle Swarm Optimization (PSO) algorithm. In order to verify the effectiveness of the ISDTSVM algorithm with different feature space, experiments were conducted on multiple UCI (University of California Irvine) data sets and steel cord conveyor belt defects using the proposed ISDTSVM algorithm and the conventional SDTSVM algorithm respectively. The average classification accuracies of five-fold cross-validation were obtained, based on two kinds of kernel functions respectively. For the Vowel, Zoo, and Wine data sets of the UCI data sets, as well as the steel cord conveyor belt defects, the ISDTSVM algorithm improved the classification accuracy by 3%, 3%, 1% and 4% respectively, compared to the SDTSVM algorithm. The classification accuracy of the radial basis function kernel were higher than the polynomial kernel. The results indicated that the proposed ISDTSVM algorithm improved the classification accuracy significantly, compared to the conventional SDTSVM algorithm.

scholarly journals Prediction of BlastInduced Ground Vibration (BIGV) of Metro Construction Using Difference Evolution AlgorithmOptimized Gaussian Process (DE-GP)

2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Tengfei Jiang ◽  
Annan Jiang ◽  
Shuai Zheng ◽  
Mengfei Xu
Keyword(s):  
Gaussian Process ◽  
Ground Vibration ◽  
Support Vector ◽  
Total Charge ◽  
Output Variable ◽  
Empirical Formulas ◽  
Maximum Charge ◽  
Powder Factor ◽  
Input Variables ◽  
Gp Model

Rock blasting often has an irreversible impact on the surrounding environment and threatens the safety of life and property. Therefore, accurate prediction of blast-induced ground vibration (BIGV) is a prerequisite for safe construction. In view of the fact that traditional blasting peak particle velocity (PPV) empirical formulas cannot be accurately predicted, this study selected 88 sets of blasting monitoring data, based on distance from the blast-face, maximum charge per delay, total charge, hole depth, spacing, burden, stemming length, and powder factor being used as input variables and PPV being used as output variable to characterize BIGV. First, a nonlinear mapping relationship between input variables and output variable is established through the Gaussian process (GP). The differential evolution algorithm (DE) is used to optimize the hyperparameters σf, σn, and l of the GP, and a blasting PPV model based on the DE-GP is constructed. The proposed model is compared with the empirical formulas, least square support vector machine (LSSVM), artificial neural network (ANN), and GP model, and its prediction performance is evaluated by statistical indicators such as root mean square error (RMSE). Finally, the cosine amplitude method (CAM) is used to analyze the sensitivity of blasting parameters. The results show that the DE-GP algorithm for blasting vibration velocity prediction has higher precision and accuracy, which is significantly better than other models, and is the closest to the measured PPV. Distance from the blast-face, total charge, and maximum charge per delay have a greater impact on the prediction of PPV, while stemming length and powder factor have a smaller impact on the prediction of PPV. The DE-GP model proposed by this research has certain reference value for the prediction and control of PPV in blasting construction.

Identification of Candidate Genetic Markers and a Novel 4-genes Diagnostic Model in Osteoarthritis through Integrating Multiple Microarray Data

2020 ◽  
Vol 23 (8) ◽  
pp. 805-813
Author(s):  
Ai Jiang ◽  
Peng Xu ◽  
Zhenda Zhao ◽  
Qizhao Tan ◽  
Shang Sun ◽  
...  
Keyword(s):  
Signaling Pathway ◽  
Microarray Data ◽  
Differential Expression Analysis ◽  
Enrichment Analysis ◽  
Mapk Signaling ◽  
Functional Enrichment ◽  
Joint Disease ◽  
Support Vector ◽  
Diagnostic Model ◽  
Data Sets

Background: Osteoarthritis (OA) is a joint disease that leads to a high disability rate and a low quality of life. With the development of modern molecular biology techniques, some key genes and diagnostic markers have been reported. However, the etiology and pathogenesis of OA are still unknown. Objective: To develop a gene signature in OA. Method: In this study, five microarray data sets were integrated to conduct a comprehensive network and pathway analysis of the biological functions of OA related genes, which can provide valuable information and further explore the etiology and pathogenesis of OA. Results and Discussion: Differential expression analysis identified 180 genes with significantly expressed expression in OA. Functional enrichment analysis showed that the up-regulated genes were associated with rheumatoid arthritis (p < 0.01). Down-regulated genes regulate the biological processes of negative regulation of kinase activity and some signaling pathways such as MAPK signaling pathway (p < 0.001) and IL-17 signaling pathway (p < 0.001). In addition, the OA specific protein-protein interaction (PPI) network was constructed based on the differentially expressed genes. The analysis of network topological attributes showed that differentially upregulated VEGFA, MYC, ATF3 and JUN genes were hub genes of the network, which may influence the occurrence and development of OA through regulating cell cycle or apoptosis, and were potential biomarkers of OA. Finally, the support vector machine (SVM) method was used to establish the diagnosis model of OA, which not only had excellent predictive power in internal and external data sets (AUC > 0.9), but also had high predictive performance in different chip platforms (AUC > 0.9) and also had effective ability in blood samples (AUC > 0.8). Conclusion: The 4-genes diagnostic model may be of great help to the early diagnosis and prediction of OA.

scholarly journals Multiscale Supervised Classification of Point Clouds with Urban and Forest Applications

Sensors ◽  
2019 ◽  
Vol 19 (20) ◽  
pp. 4523 ◽  
Author(s):  
Carlos Cabo ◽  
Celestino Ordóñez ◽  
Fernando Sáchez-Lasheras ◽  
Javier Roca-Pardiñas ◽  
and Javier de Cos-Juez
Keyword(s):  
Random Forest ◽  
Laser Scanning ◽  
Supervised Classification ◽  
Computing Time ◽  
Principal Component ◽  
Point Clouds ◽  
Support Vector ◽  
Linear Discriminant ◽  
Vector Machines ◽  
Input Variables

We analyze the utility of multiscale supervised classification algorithms for object detection and extraction from laser scanning or photogrammetric point clouds. Only the geometric information (the point coordinates) was considered, thus making the method independent of the systems used to collect the data. A maximum of five features (input variables) was used, four of them related to the eigenvalues obtained from a principal component analysis (PCA). PCA was carried out at six scales, defined by the diameter of a sphere around each observation. Four multiclass supervised classification models were tested (linear discriminant analysis, logistic regression, support vector machines, and random forest) in two different scenarios, urban and forest, formed by artificial and natural objects, respectively. The results obtained were accurate (overall accuracy over 80% for the urban dataset, and over 93% for the forest dataset), in the range of the best results found in the literature, regardless of the classification method. For both datasets, the random forest algorithm provided the best solution/results when discrimination capacity, computing time, and the ability to estimate the relative importance of each variable are considered together.

scholarly journals Towards Application of One-Class Classification Methods to Medical Data

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Itziar Irigoien ◽  
Basilio Sierra ◽  
Concepción Arenas
Keyword(s):  
State Of The Art ◽  
Gaussian Mixture ◽  
Support Vector ◽  
Support Vector Data Description ◽  
Data Sets ◽  
Biomedical Data ◽  
Vector Data ◽  
Target Class ◽  
Tumor Recognition ◽  
One Class Classification

In the problem of one-class classification (OCC) one of the classes, the target class, has to be distinguished from all other possible objects, considered as nontargets. In many biomedical problems this situation arises, for example, in diagnosis, image based tumor recognition or analysis of electrocardiogram data. In this paper an approach to OCC based on a typicality test is experimentally compared with reference state-of-the-art OCC techniques—Gaussian, mixture of Gaussians, naive Parzen, Parzen, and support vector data description—using biomedical data sets. We evaluate the ability of the procedures using twelve experimental data sets with not necessarily continuous data. As there are few benchmark data sets for one-class classification, all data sets considered in the evaluation have multiple classes. Each class in turn is considered as the target class and the units in the other classes are considered as new units to be classified. The results of the comparison show the good performance of the typicality approach, which is available for high dimensional data; it is worth mentioning that it can be used for any kind of data (continuous, discrete, or nominal), whereas state-of-the-art approaches application is not straightforward when nominal variables are present.

scholarly journals Three-Dimensional Site Characterization Model of Bangalore Using Support Vector Machine

2012 ◽  
Vol 2012 ◽  
pp. 1-10
Author(s):  
Pijush Samui
Keyword(s):  
Support Vector Machine ◽  
Three Dimensional ◽  
Site Characterization ◽  
Standard Penetration Test ◽  
Support Vector ◽  
Characterization Model ◽  
Svm Model ◽  
Input Variables ◽  
Learning Machine ◽  
A Site

The main objective of site characterization is the prediction of in situ soil properties at any half-space point at a site based on limited tests. In this study, the Support Vector Machine (SVM) has been used to develop a three dimensional site characterization model for Bangalore, India based on large amount of Standard Penetration Test. SVM is a novel type of learning machine based on statistical learning theory, uses regression technique by introducing ε-insensitive loss function. The database consists of 766 boreholes, with more than 2700 field SPT values () spread over 220 sq km area of Bangalore. The model is applied for corrected () values. The three input variables (, , and , where , , and are the coordinates of the Bangalore) were used for the SVM model. The output of SVM was the data. The results presented in this paper clearly highlight that the SVM is a robust tool for site characterization. In this study, a sensitivity analysis of SVM parameters (σ, , and ε) has been also presented.

Persian Handwritten Number Recognition Using Adapted Framing Feature and Support Vector Machines

2016 ◽  
Vol 15 (01) ◽  
pp. 1650004 ◽  
Author(s):  
Hedieh Sajedi ◽  
Mehran Bahador
Keyword(s):  
Support Vector Machines ◽  
Recognition Rate ◽  
Nearest Neighbors ◽  
Polynomial Kernel ◽  
Support Vector ◽  
K Nearest Neighbors ◽  
New Approach ◽  
Number Recognition ◽  
Vector Machines

In this paper, a new approach for segmentation and recognition of Persian handwritten numbers is presented. This method utilizes the framing feature technique in combination with outer profile feature that we named this the adapted framing feature. In our proposed approach, segmentation of the numbers into digits has been carried out automatically. In the classification stage of the proposed method, Support Vector Machines (SVM) and k-Nearest Neighbors (k-NN) are used. Experimentations are conducted on the IFHCDB database consisting 17,740 numeral images and HODA database consisting 102,352 numeral images. In isolated digit level on IFHCDB, the recognition rate of 99.27%, is achieved by using SVM with polynomial kernel. Furthermore, in isolated digit level on HODA, the recognition rate of 99.07% is achieved by using SVM with polynomial kernel. The experiments illustrate that applying our proposed method resulted higher accuracy compared to previous researches.

Bayesian Trigonometric Support Vector Classifier

2003 ◽  
Vol 15 (9) ◽  
pp. 2227-2254 ◽  
Author(s):  
Wei Chu ◽  
S. Sathiya Keerthi ◽  
Chong Jin Ong
Keyword(s):  
Loss Function ◽  
Gaussian Processes ◽  
Likelihood Function ◽  
Support Vector ◽  
Data Sets ◽  
Model Adaptation ◽  
Bayesian Techniques ◽  
Benchmark Data ◽  
Support Vector Classifier ◽  
Set Up

This letter describes Bayesian techniques for support vector classification. In particular, we propose a novel differentiable loss function, called the trigonometric loss function, which has the desirable characteristic of natural normalization in the likelihood function, and then follow standard gaussian processes techniques to set up a Bayesian framework. In this framework, Bayesian inference is used to implement model adaptation, while keeping the merits of support vector classifier, such as sparseness and convex programming. This differs from standard gaussian processes for classification. Moreover, we put forward class probability in making predictions. Experimental results on benchmark data sets indicate the usefulness of this approach.

Nondegenerate Piecewise Linear Systems: A Finite Newton Algorithm and Applications in Machine Learning

2012 ◽  
Vol 24 (4) ◽  
pp. 1047-1084 ◽  
Author(s):  
Xiao-Tong Yuan ◽  
Shuicheng Yan
Keyword(s):  
Linear Systems ◽  
Optimization Problems ◽  
Piecewise Linear ◽  
Optimization Methods ◽  
Coefficient Matrix ◽  
Learning Problems ◽  
Support Vector ◽  
Data Sets ◽  
Piecewise Linear Systems ◽  
Vector Machines

We investigate Newton-type optimization methods for solving piecewise linear systems (PLSs) with nondegenerate coefficient matrix. Such systems arise, for example, from the numerical solution of linear complementarity problem, which is useful to model several learning and optimization problems. In this letter, we propose an effective damped Newton method, PLS-DN, to find the exact (up to machine precision) solution of nondegenerate PLSs. PLS-DN exhibits provable semiiterative property, that is, the algorithm converges globally to the exact solution in a finite number of iterations. The rate of convergence is shown to be at least linear before termination. We emphasize the applications of our method in modeling, from a novel perspective of PLSs, some statistical learning problems such as box-constrained least squares, elitist Lasso (Kowalski & Torreesani, 2008 ), and support vector machines (Cortes & Vapnik, 1995 ). Numerical results on synthetic and benchmark data sets are presented to demonstrate the effectiveness and efficiency of PLS-DN on these problems.

Sign in / Sign up

Export Citation Format

Share Document