scholarly journals A Fast SVM-Based Tongue’s Colour Classification Aided by k-Means Clustering Identifiers and Colour Attributes as Computer-Assisted Tool for Tongue Diagnosis

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Nur Diyana Kamarudin ◽  
Chia Yee Ooi ◽  
Tadaaki Kawanabe ◽  
Hiroshi Odaguchi ◽  
Fuminori Kobayashi
Keyword(s):  
Red Light ◽  
Support Vector ◽  
Computer Assisted ◽  
Transitional Region ◽  
Two Stage ◽  
True Rate ◽  
Lighting Condition ◽  
Tongue Diagnosis ◽  
Support Vectors ◽  
Stage Classification

In tongue diagnosis, colour information of tongue body has kept valuable information regarding the state of disease and its correlation with the internal organs. Qualitatively, practitioners may have difficulty in their judgement due to the instable lighting condition and naked eye’s ability to capture the exact colour distribution on the tongue especially the tongue with multicolour substance. To overcome this ambiguity, this paper presents a two-stage tongue’s multicolour classification based on a support vector machine (SVM) whose support vectors are reduced by our proposed k-means clustering identifiers and red colour range for precise tongue colour diagnosis. In the first stage, k-means clustering is used to cluster a tongue image into four clusters of image background (black), deep red region, red/light red region, and transitional region. In the second-stage classification, red/light red tongue images are further classified into red tongue or light red tongue based on the red colour range derived in our work. Overall, true rate classification accuracy of the proposed two-stage classification to diagnose red, light red, and deep red tongue colours is 94%. The number of support vectors in SVM is improved by 41.2%, and the execution time for one image is recorded as 48 seconds.

A Two-Stage Machine Learning Classification Approach to Identify Extremism in Arabic Opinions

2021 ◽  
Vol 10 (2) ◽  
pp. 736-745
Keyword(s):  
Machine Learning ◽  
Binary Classification ◽  
Feature Selection Method ◽  
Support Vector ◽  
Two Stage ◽  
Machine Learning Classification ◽  
Second Stage ◽  
Testing Data ◽  
Stage Classification ◽  
Positive Dataset

The increased usage of the Internet and social networks allowed and enabled people to express their views, which have generated an increasing attention lately. Sentiment Analysis (SA) techniques are used to determine the polarity of information, either positive or negative, toward a given topic, including opinions. In this research, we have introduced a machine learning approach based on Support Vector Machine (SVM), Naïve Bayes (NB) and Random Forest (RF) classifiers, to find and classify extreme opinions in Arabic reviews. To achieve this, a dataset of 1500 Arabic reviews was collected from Google Play Store. In addition, a two-stage Classification process was applied to classify the reviews. In the first stage, we built a binary classifier to sort out positive from negative reviews. In the second stage, however we applied a binary classification mechanism based on a set of proposed rules that distinguishes extreme positive from positive reviews, and extreme negative from negative reviews. Four major experiments were conducted with a total of 10 different sub experiments to fulfill the two-stage process using different X-validation schemas and Term Frequency-Inverse Document Frequency feature selection method. Obtained results have indicated that SVM was the best during the first stage classification with 30% testing data, and NB was the best with 20% testing data. The results of the second stage classification indicated that SVM has scored better results in identifying extreme positive reviews when dealing with the positive dataset with an overall accuracy of 68.7% and NB showed better accuracy results in identifying extreme negative reviews when dealing with the negative dataset, with an overall accuracy of 72.8%.

scholarly journals A two-stage classification method for borehole-wall images with support vector machine

PLoS ONE ◽  
2018 ◽  
Vol 13 (6) ◽  
pp. e0199749
Author(s):  
Zhaopeng Deng ◽  
Maoyong Cao ◽  
Laxmisha Rai ◽  
Wei Gao
Keyword(s):  
Support Vector Machine ◽  
Borehole Wall ◽  
Classification Method ◽  
Support Vector ◽  
Two Stage ◽  
Stage Classification

scholarly journals A two-stage classification algorithm for radar targets based on compressive detection

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Cong Liu ◽  
Yunqing Liu ◽  
Qiong Zhang ◽  
Xiaolong Li ◽  
Tong Wu ◽  
...  
Keyword(s):  
Data Storage ◽  
Support Vector ◽  
False Alarms ◽  
Support Vector Data Description ◽  
Echo Signal ◽  
Two Stage ◽  
First Order ◽  
Stage Classification ◽  
Radar Targets ◽  
One Class Classifier

AbstractAlgorithms are proposed to address the radar target detection problem of compressed sensing (CS) under the conditions of a low signal-to-noise ratio (SNR) and a low signal-to-clutter ratio (SCR) echo signal. The algorithms include a two-stage classification for radar targets based on compressive detection (CD) without signal reconstruction and a support vector data description (SVDD) one-class classifier. First, we present the sparsity of the echo signal in the distance dimension to design a measurement matrix for CD of the echo signal. Constant false alarm rate (CFAR) detection is performed directly on the CD echo signal to complete the first-order target classification. In simulations, the detection performance is similar to that of the traditional matched filtering algorithm, but the data rate is lower, and the necessary data storage space is reduced. Then, the power spectrum features are extracted from the data after the first-order classification and converted to the feature domain. The SVDD one-class classifier is introduced to train and classify the characteristic signals to complete the separation of the targets and the false alarms. Finally, the performance of the algorithm is verified by simulation. The number of false alarms is reduced, and the detection probability of the targets is improved.

scholarly journals A Compound Wind Power Forecasting Strategy Based on Clustering, Two-Stage Decomposition, Parameter Optimization, and Optimal Combination of Multiple Machine Learning Approaches

Energies ◽  
2019 ◽  
Vol 12 (18) ◽  
pp. 3586 ◽  
Author(s):  
Sizhou Sun ◽  
Jingqi Fu ◽  
Ang Li
Keyword(s):  
Wind Power ◽  
Large Scale ◽  
Wind Farm ◽  
Search Algorithm ◽  
Interpolation Method ◽  
Least Square ◽  
Support Vector ◽  
Two Stage ◽  
Wind Power Forecasting ◽  
Power Forecasting

Given the large-scale exploitation and utilization of wind power, the problems caused by the high stochastic and random characteristics of wind speed make researchers develop more reliable and precise wind power forecasting (WPF) models. To obtain better predicting accuracy, this study proposes a novel compound WPF strategy by optimal integration of four base forecasting engines. In the forecasting process, density-based spatial clustering of applications with noise (DBSCAN) is firstly employed to identify meaningful information and discard the abnormal wind power data. To eliminate the adverse influence of the missing data on the forecasting accuracy, Lagrange interpolation method is developed to get the corrected values of the missing points. Then, the two-stage decomposition (TSD) method including ensemble empirical mode decomposition (EEMD) and wavelet transform (WT) is utilized to preprocess the wind power data. In the decomposition process, the empirical wind power data are disassembled into different intrinsic mode functions (IMFs) and one residual (Res) by EEMD, and the highest frequent time series IMF1 is further broken into different components by WT. After determination of the input matrix by a partial autocorrelation function (PACF) and normalization into [0, 1], these decomposed components are used as the input variables of all the base forecasting engines, including least square support vector machine (LSSVM), wavelet neural networks (WNN), extreme learning machine (ELM) and autoregressive integrated moving average (ARIMA), to make the multistep WPF. To avoid local optima and improve the forecasting performance, the parameters in LSSVM, ELM, and WNN are tuned by backtracking search algorithm (BSA). On this basis, BSA algorithm is also employed to optimize the weighted coefficients of the individual forecasting results that produced by the four base forecasting engines to generate an ensemble of the forecasts. In the end, case studies for a certain wind farm in China are carried out to assess the proposed forecasting strategy.

Financial Distress Prediction Based on Support Vector Machine with a Modified Kernel Function

2016 ◽  
Vol 25 (3) ◽  
pp. 417-429
Author(s):  
Chong Wu ◽  
Lu Wang ◽  
Zhe Shi
Keyword(s):  
Support Vector Machine ◽  
Kernel Function ◽  
Financial Distress ◽  
Classification Accuracy ◽  
Feature Space ◽  
Support Vector ◽  
Input Space ◽  
Financial Distress Prediction ◽  
Support Vectors ◽  
Distress Prediction

AbstractFor the financial distress prediction model based on support vector machine, there are no theories concerning how to choose a proper kernel function in a data-dependent way. This paper proposes a method of modified kernel function that can availably enhance classification accuracy. We apply an information-geometric method to modifying a kernel that is based on the structure of the Riemannian geometry induced in the input space by the kernel. A conformal transformation of a kernel from input space to higher-dimensional feature space enlarges volume elements locally near support vectors that are situated around the classification boundary and reduce the number of support vectors. This paper takes the Gaussian radial basis function as the internal kernel. Additionally, this paper combines the above method with the theories of standard regularization and non-dimensionalization to construct the new model. In the empirical analysis section, the paper adopts the financial data of Chinese listed companies. It uses five groups of experiments with different parameters to compare the classification accuracy. We can make the conclusion that the model of modified kernel function can effectively reduce the number of support vectors, and improve the classification accuracy.

A novel two-stage method of plant seedlings classification based on deep learning

2021 ◽  
pp. 1-11
Author(s):  
Tianhong Dai ◽  
Shijie Cong ◽  
Jianping Huang ◽  
Yanwen Zhang ◽  
Xinwang Huang ◽  
...  
Keyword(s):  
Deep Learning ◽  
Learning Technology ◽  
Two Stage ◽  
Second Stage ◽  
Stage Classification ◽  
Different Types ◽  
Two Stages ◽  
Plant Seedlings

In agricultural production, weed removal is an important part of crop cultivation, but inevitably, other plants compete with crops for nutrients. Only by identifying and removing weeds can the quality of the harvest be guaranteed. Therefore, the distinction between weeds and crops is particularly important. Recently, deep learning technology has also been applied to the field of botany, and achieved good results. Convolutional neural networks are widely used in deep learning because of their excellent classification effects. The purpose of this article is to find a new method of plant seedling classification. This method includes two stages: image segmentation and image classification. The first stage is to use the improved U-Net to segment the dataset, and the second stage is to use six classification networks to classify the seedlings of the segmented dataset. The dataset used for the experiment contained 12 different types of plants, namely, 3 crops and 9 weeds. The model was evaluated by the multi-class statistical analysis of accuracy, recall, precision, and F1-score. The results show that the two-stage classification method combining the improved U-Net segmentation network and the classification network was more conducive to the classification of plant seedlings, and the classification accuracy reaches 97.7%.

Sign in / Sign up

Export Citation Format

Share Document