Structural SVM Research Articles

Prediction of blast-hole utilization rate using structured nonlinear support vector machine combined with optimization algorithms

Prediction of blast-hole utilization rate using structured nonlinear support vector machine combined with optimization algorithms

A Hybrid Firefly with Particle Swarm Optimization Based Hyperspectral Image Classification and Segmentation Using Structured Support Vector Machine

A Hybrid Firefly with Particle Swarm Optimization Based Hyperspectral Image Classification and Segmentation Using Structured Support Vector Machine

Structured support vector machine with coarse-to-fine PatchMatch filtering for stereo matching

Structured support vector machine with coarse-to-fine PatchMatch filtering for stereo matching

Large-Scale Structured Output Classification via Multiple Structured Support Vector Machine by Splitting

Large-Scale Structured Output Classification via Multiple Structured Support Vector Machine by Splitting

ES-DLSSVM-Based Prognostics of Rolling Element Bearings

The degradation starting time is an important variable affecting the accuracy of degradation path prediction, but little work has been considered in existing studies. This article investigates the problem of predicting the performance of rolling element bearings based on early degradation analysis. Based on an improved dual linear structural support vector machine with envelope spectrum algorithm and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mu +4\sigma$</tex-math></inline-formula> criteria, a new health indicator is proposed to detect the degradation starting time. As well the detected time is sensitive to early anomalies. In addition, according to the degradation starting time, a convolutional neural network prediction model is established to predict the degradation path. Experiments show the effectiveness and superiority of the proposed method.

유해화학물질 취급시설 관련 뉴스와 국민신문고 민원 트렌드 빅데이터 분석

Since the 2013 revision of the Toxic Chemicals Management Act to the Chemical Substances Control Act, the evaluation of how internal and external environmental changes affect legal systems for facilities handling hazardous chemicals is crucial for prospective system enhancements. Through an analysis of news and civil complaints from 2014 to 2023, it was observed that both external news and internal civil complaints related to handling facilities peaked in 2019, declining as the legal system stabilized. News trends were tracked using Term Frequency(TF), while civil complaints were assessed using TF-IDF (Inverse Document Frequency) to identify significant keywords. The entity name analysis algorithm, Structured Support Vector Machine, was applied to investigate keyword relationships. Among the notices concerning handling facilities, civil complaints related to small quantity standards and small quantity handling facilities were the highest. Inquiries regarding damage reduction facility standards, such as bund walls and detectors, ranked prominently, suggesting a need for policy service improvements in this area.

An Enhanced SVM Model for Implicit Aspect Identification in Sentiment Analysis

Opinion Mining or Sentiment Analysis (SA) is a key component of E-commerce applications where a vast number of reviews are generated by customers. SA operates on aspect level where the views are expressed on a specific aspect of a product and have a big influence on the customers’ choices and businesses’ reputation. Aspect Based Sentiment Analysis (ABSA) is the task of categorizing text by aspect and identifying the sentiment attributed to it. Implicit Aspect Identification (IAI) is a subtask of ABSA. This paper aims to empirically investigate how external knowledge (e.g. WordNet) is integrated into SVM model to address some of its intrinsic issues when dealing with classification. To achieve this research goal, we propose an approach to improve Support Vector Machines (SVM) model to deal with IAI. Using WordNet (WN) semantic relations, we suggest an enhancement for the SVM kernel computation. Experiments are conducted on three benchmark datasets of products, laptops, and restaurant reviews. The effects of our approach are examined and analyzed according to three criteria: (i) kernel function used, (ii) different experimental settings, and (iii) SVM behavior towards Overfitting and Underfitting. The research finding of our work is that the integration of external knowledge (e.g. WordNet) is experimentally proved to be significantly helpful to SVM classification for IAI and especially for addressing Overfitting and Underfitting that are considered as two of the main structural SVM issues. The empirical results demonstrate that our approach helps SVM (i) improve its performance for the three considered kernels and under different experimental settings, and (ii) deal better with Overfitting and Underfitting.

A deep kernel method for lithofacies identification using conventional well logs

How to fit a properly nonlinear classification model from conventional well logs to lithofacies is a key problem for machine learning methods. Kernel methods (e.g., KFD, SVM, MSVM) are effective attempts to solve this issue due to abilities of handling nonlinear features by kernel functions. Deep mining of log features indicating lithofacies still needs to be improved for kernel methods. Hence, this work employs deep neural networks to enhance the kernel principal component analysis (KPCA) method and proposes a deep kernel method (DKM) for lithofacies identification using well logs. DKM includes a feature extractor and a classifier. The feature extractor consists of a series of KPCA models arranged according to residual network structure. A gradient-free optimization method is introduced to automatically optimize parameters and structure in DKM, which can avoid complex tuning of parameters in models. To test the validation of the proposed DKM for lithofacies identification, an open-sourced dataset with seven conventional logs (GR, CAL, AC, DEN, CNL, LLD, and LLS) and lithofacies labels from the Daniudi Gas Field in China is used. There are eight lithofacies, namely clastic rocks (pebbly, coarse, medium, and fine sandstone, siltstone, mudstone), coal, and carbonate rocks. The comparisons between DKM and three commonly used kernel methods (KFD, SVM, MSVM) show that (1) DKM (85.7%) outperforms SVM (77%), KFD (79.5%), and MSVM (82.8%) in accuracy of lithofacies identification; (2) DKM is about twice faster than the multi-kernel method (MSVM) with good accuracy. The blind well test in Well D13 indicates that compared with the other three methods DKM improves about 24% in accuracy, 35% in precision, 41% in recall, and 40% in F1 score, respectively. In general, DKM is an effective method for complex lithofacies identification. This work also discussed the optimal structure and classifier for DKM. Experimental results show that (m1,m2,0) is the optimal model structure and linear SVM is the optimal classifier. (m1,m2,0) means there are m1 KPCAs, and then m2 residual units. A workflow to determine an optimal classifier in DKM for lithofacies identification is proposed, too.

Direct Inference of Base-Pairing Probabilities with Neural Networks Improves Prediction of RNA Secondary Structures with Pseudoknots.

Existing approaches to predicting RNA secondary structures depend on how the secondary structure is decomposed into substructures, that is, the architecture, to define their parameter space. However, architecture dependency has not been sufficiently investigated, especially for pseudoknotted secondary structures. In this study, we propose a novel algorithm for directly inferring base-pairing probabilities with neural networks that do not depend on the architecture of RNA secondary structures, and then implement this approach using two maximum expected accuracy (MEA)-based decoding algorithms: Nussinov-style decoding for pseudoknot-free structures and IPknot-style decoding for pseudoknotted structures. To train the neural networks connected to each base pair, we adopt a max-margin framework, called structured support vector machines (SSVM), as the output layer. Our benchmarks for predicting RNA secondary structures with and without pseudoknots show that our algorithm outperforms existing methods in prediction accuracy.

Support vector machine embedding discriminative dictionary pair learning for pattern classification

Discriminative dictionary learning (DDL) aims to address pattern classification problems via learning dictionaries from training samples. Dictionary pair learning (DPL) based DDL has shown superiority as compared with most existing algorithms which only learn synthesis dictionaries or analysis dictionaries. However, in the original DPL algorithm, the discrimination capability is only promoted via the reconstruction error and the structures of the learned dictionaries, while the discrimination of coding coefficients is not considered in the process of dictionary learning. To address this issue, we propose a new DDL algorithm by introducing an additional discriminative term associated with coding coefficients. Specifically, a support vector machine (SVM) based term is employed to enhance the discrimination of coding coefficients. In this model, a structured dictionary pair and SVM classifiers are jointly learned, and an optimization method is developed to address the formulated optimization problem. A classification scheme based on both the reconstruction error and SVMs is also proposed. Simulation results on several widely used databases demonstrate that the proposed method can achieve competitive performance as compared with some state-of-the-art DDL algorithms.

Learning the pattern-based CRF for prediction of a protein local structure

We describe a pattern-based conditional random field model for the prediction of dihedral angles of an all-alpha protein from its primary structure. Such conditional random fields appear naturally in sequence labeling problems of bioinformatics and can be considered relative to the Hidden Markov Models. The learning of parameters of the model is done by the structural SVM technique. The accuracy that we achieved in predicting dihedral angles, φ and ψ, equals 22.8 and 48.3 degrees, respectively. The MDA score, defined as the percentage of residues that are found in correctly predicted eight-residue segments, attained 56.5%.

Hyperparameter Tuning with High Performance Computing Machine Learning for Imbalanced Alzheimer's Disease Data.

Accurate detection is still a challenge in machine learning (ML) for Alzheimer's disease (AD). Class imbalance in imbalanced AD data is another big challenge for machine-learning algorithms working under the assumption that the data are evenly distributed within classes. Here, we present a hyperparameter tuning workflow with high-performance computing (HPC) for imbalanced data related to prevalent mild cognitive impairment (MCI) and AD in the Health and Aging Brain Study-Health Disparities (HABS-HD) project. We applied a single-node multicore parallel mode to hyperparameter tuning of gamma, cost, and class weight using a support vector machine (SVM) model with 10 times repeated fivefold cross-validation. We executed the hyperparameter tuning workflow with R's bigmemory, foreach, and doParallel packages on Texas Advanced Computing Center (TACC)'s Lonestar6 system. The computational time was dramatically reduced by up to 98.2% for the high-performance SVM hyperparameter tuning model, and the performance of cross-validation was also improved (the positive predictive value and the negative predictive value at base rate 12% were, respectively, 16.42% and 92.72%). Our results show that a single-node multicore parallel structure and high-performance SVM hyperparameter tuning model can deliver efficient and fast computation and achieve outstanding agility, simplicity, and productivity for imbalanced data in AD applications.

Novel deep neural network framework for biomedical named entity recognition

With the dramatic improvements in the field of bio-informatics, extracting information from text and analyzing the association between the entities has received more attention in the past few years. Entity Recognition (ER) meant to extract and recognize the entities from any text. Biomedical Named Entity Recognition (BNER) gets more and more attention from the researchers since it is a fundamental task in biomedical information extraction. Various methods has been proposed to perform the task of BioNER. Different kind of approaches are dictionary based, rule based approaches, traditional machine learning approaches that combines supervised and unsupervised methods and neural network based approach. The state-of-art systems previously adopted various supervised machine learning methods Hidden Markov Models (HMMs), Maximum Entropy Markov Models (MEMMs), Support vector machines(SVM),Structural Support Vector Machines(SSVMS),Conditional Random Fields(CRF) to derive semantic and syntatic features from annotated datasets. However, CRF is one of the most successful method used for NER and it has obtained finest result because of the robustness and ability for sequence lebelling task. Recently, studies have demonstrated the application of deep learning based approaches for biomedical named entity recognition (BioNER) and shown promising results.

Retraction Note to: A structured support vector machine for hyperspectral satellite image segmentation and classification based on modified swarm optimization approach

Retraction Note to: A structured support vector machine for hyperspectral satellite image segmentation and classification based on modified swarm optimization approach

Hyperspectral Image Classification Based on Non-Parallel Support Vector Machine

Support vector machine (SVM) has a good effect in the supervised classification of hyperspectral images. In view of the shortcomings of the existing parallel structure SVM, this article proposes a non-parallel SVM model. Based on the traditional parallel boundary structure vector machine, this model adds an additional empirical risk minimization term to the original optimization problem by adding the least square term of the sample and obtains two non-parallel hyperplanes, respectively, forming a new non-parallel SVM algorithm to minimize the additional empirical risk of non-parallel SVM (Additional Empirical Risk Minimization Non-parallel Support Vector Machine, AERM-NPSVM). On the basis of AERM-NPSVM, the bias constraint is added to it, and AERM-NPSVM (BC-AERM-NPSVM) is further obtained. The experimental results show that, compared with the traditional parallel SVM model and the classical non-parallel SVM model, Twin Support Vector Machine (TWSVM), the new model, has a better effect in hyperspectral image classification and better generalization performance.

Classification of tissue biopsies by Raman spectroscopy guided by quantitative phase imaging and its application to bladder cancer.

We present a multimodal label-free optical measurement approach for analyzing sliced tissue biopsies by a unique combination of quantitative phase imaging and localized Raman spectroscopy. First, label-free quantitative phase imaging of the entire unstained tissue slice is performed using automated scanning. Then, pixel-wise segmentation of the tissue layers is performed by a kernelled structural support vector machine based on Haralick texture features, which are extracted from the quantitative phase profile, and used to find the best locations for performing the label-free localized Raman measurements. We use this multimodal label-free measurement approach for segmenting the urothelium in benign and malignant bladder cancer tissues by quantitative phase imaging, followed by location-guided Raman spectroscopy measurements. We then use sparse multinomial logistic regression (SMLR) on the Raman spectroscopy measurements to classify the tissue types, demonstrating that the prior segmentation of the urothelium done by label-free quantitative phase imaging improves the Raman spectra classification accuracy from 85.7% to 94.7%.

Using the Improved SSD Algorithm to Motion Target Detection and Tracking.

Computer vision-based motion target detection and tracking, which is widely used in video surveillance, human-computer interaction, range interpretation, and other fields, is one of the current research hotspots in the field of computer vision. In engineering scenarios, the two are inseparable and need to work together to accomplish specific tasks. The related research is progressing rapidly, but there is still room for improving its timeliness, accuracy, and automation. In this paper, we summarize and classify some classical target detection methods, analyze the basic principles of convolutional neural networks, and analyze the classical detection algorithms based on region suggestion and deep regression networks. After that, we improve the SSD algorithm for the shortage of low-level feature convolution layers, which has insufficient feature extraction and leads to poor detection of small targets. For the motion target tracking problem, this paper studies the motion target tracking method based on support vector machine and proposes the tracking method of support vector regression and the corresponding online support vector regression solution method based on the analysis of support vector tracking method and structural support vector tracking method. In this paper, we propose a tracking method that fuses structural support vector machines and correlation filtering. The structure is based on the idea of Inception, which adds and replaces some feature convolution layers of the original network while maintaining the original lightweight backbone. The final experiments on the VOC data set demonstrate that the improved algorithm improves the average detection accuracy by 2.6% compared to the original algorithm and basically maintains the real-time speed as well. Experimental simulations on a subset of VOC data (human set) show a significant improvement in AP values and more effective and reliable detection tracking of moving targets. The stability and accuracy of motion target detection and tracking are improved by setting parameters, such as confidence level; the effectiveness and continuity of detection and tracking are judged by setting the interframe centroid distance.

Parallel and Distributed Structured SVM Training

Structured Support Vector Machines (structured SVMs) are a fundamental machine learning algorithm, and have solid theoretical foundation and high effectiveness in applications such as natural language parsing and computer vision. However, training structured SVMs is very time-consuming, due to the large number of constraints and inferior convergence rates, especially for large training data sets. The high cost of training structured SVMs has hindered its adoption to new applications. In this article, we aim to improve the efficiency of structured SVMs by proposing a parallel and distributed solution (namely <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">FastSSVM</i> ) for training structured SVMs building on top of MPI and OpenMP. FastSSVM exploits a series of optimizations (e.g., optimizations on data storage and synchronization) to efficiently use the resources of the nodes in a cluster and the cores of the nodes. Moreover, FastSSVM tackles the large constraint set problem by batch processing and addresses the slow convergence challenge by adapting stop conditions based on the improvement of each iteration. We theoretically prove that our solution is guaranteed to converge to a global optimum. A comprehensive experimental study shows that FastSSVM can achieve at least four times speedup over the existing solutions, and in some cases can achieve two to three orders of magnitude speedup.

Graph-based modelling of superpixels for automatic identification of empty shelves in supermarkets

Automatic detection of empty spaces (gaps) between the displayed products as seen in the images of shelves of a supermarket is an interesting image segmentation problem. This paper presents the first known attempt to solve this commercially relevant challenge. The shelf image is first over-segmented into a number of superpixels to construct a graph of superpixels (SG). Subsequently, a graph convolutional network and a Siamese network are built to process the SG. Finally, a structural support vector machine based inference model is formulated based on SG for segmenting the gap and non-gap regions. In order to validate our method, we manually annotate the images of shelves of three benchmark datasets of retail products. We have achieved ∼70 to ∼85% segmentation accuracy (in terms of mean intersection-over-union) on the annotated datasets. A part of the annotated data is released at https://github.com/gapDetection/gapDetectionDatasets.

Construction of multi-modal perception model of communicative robot in non-structural cyber physical system environment based on optimized BT-SVM model

With the rapid development of intelligent control technology, computer technology, bionics, artificial intelligence and other disciplines, more and more attention has been paid to the research of intelligent mobile robot technology, and autonomous positioning is the basis for mobile robots to conduct autonomous navigation and exploration research. Sensors assist each other to provide a wealth of perception information about the internal state of the robot and the external surrounding environment. This paper proposes a method for optimizing the Support Vector Machine (SVM) multi-classifier with a binary tree structure, which improves the accuracy of multi-modal tactile signal recognition. The improved particle swarm clustering algorithm is used to optimize the binary tree structure, reduce the error accumulation of the binary tree structure SVM multi-classifier, and further improve the accuracy of multi-modal tactile signal recognition. The effect of the method in this paper is verified by robot grasping experiments. The results show that the use of multi-modal information of two-dimensional images and three-dimensional point cloud images can effectively identify and locate target objects of different shapes. Compared with the processing method of two-dimensional or point cloud monomodal image information, the positioning error can be reduced by 54.8%, and the direction error can be reduced by 50.8%, which has better robustness and accuracy. The simulation results show that the improved PSOBT-SVM model has the best classification effect for artificial features, PCA features and spatio-temporal correlation features. The improved PSOBT-SVM optimizes the classification accuracy without changing the number of SVM classifiers, and proves its accuracy in classifying multimodal tactile signals.