scholarly journals Improved Instance Selection Methods for Support Vector Machine Speed Optimization

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Andronicus A. Akinyelu ◽  
Aderemi O. Adewumi
Keyword(s):  
Support Vector Machine ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Instance Selection ◽  
Training Time ◽  
Svm Classification ◽  
Support Vectors ◽  
Increase With Increase ◽  
Dataset Size ◽  
Machine Speed

Support vector machine (SVM) is one of the top picks in pattern recognition and classification related tasks. It has been used successfully to classify linearly separable and nonlinearly separable data with high accuracy. However, in terms of classification speed, SVMs are outperformed by many machine learning algorithms, especially, when massive datasets are involved. SVM classification speed scales linearly with number of support vectors, and support vectors increase with increase in dataset size. Hence, SVM classification speed can be enormously reduced if it is trained on a reduced dataset. Instance selection techniques are one of the most effective techniques suitable for minimizing SVM training time. In this study, two instance selection techniques suitable for identifying relevant training instances are proposed. The techniques are evaluated on a dataset containing 4000 emails and results obtained compared to other existing techniques. Result reveals excellent improvement in SVM classification speed.

A Multi-Classified Method of Support Vector Machine (SVM) Based on Entropy

2012 ◽  
Vol 241-244 ◽  
pp. 1629-1632 ◽  
Author(s):  
Yan Yue
Keyword(s):  
Support Vector Machine ◽  
Information Entropy ◽  
Recognition Rate ◽  
Support Vector ◽  
Entropy Theory ◽  
Classification Rate ◽  
Svm Classification ◽  
Computational Load ◽  
Support Vectors ◽  
Reduction Coefficient

Studies propose to combine standard SVM classification with the information entropy to increase SVM classification rate as well as reduce computational load of SVM testing. The algorithm uses the information entropy theory to per-treat samples’ attributes, and can eliminate some attributes which put small impacts on the date classification by introducing the reduction coefficient, and then reduce the amount of support vectors. The results show that this algorithm can reduce the amount of support vectors in the process of the classification with support vector machine, and heighten the recognition rate when the amount of the samples is larger compared to standard SVM and DAGSVM.

scholarly journals Predicting Future Occurrence of Acute Hypotensive Episodes Using Noninvasive and Invasive Features

2021 ◽  
Vol 186 (Supplement_1) ◽  
pp. 445-451
Author(s):  
Yifei Sun ◽  
Navid Rashedi ◽  
Vikrant Vaze ◽  
Parikshit Shah ◽  
Ryan Halter ◽  
...  
Keyword(s):  
Machine Learning ◽  
Support Vector Machine ◽  
Real World ◽  
Short Term Memory ◽  
Model Performance ◽  
Learning Technologies ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Continuous Map

ABSTRACT Introduction Early prediction of the acute hypotensive episode (AHE) in critically ill patients has the potential to improve outcomes. In this study, we apply different machine learning algorithms to the MIMIC III Physionet dataset, containing more than 60,000 real-world intensive care unit records, to test commonly used machine learning technologies and compare their performances. Materials and Methods Five classification methods including K-nearest neighbor, logistic regression, support vector machine, random forest, and a deep learning method called long short-term memory are applied to predict an AHE 30 minutes in advance. An analysis comparing model performance when including versus excluding invasive features was conducted. To further study the pattern of the underlying mean arterial pressure (MAP), we apply a regression method to predict the continuous MAP values using linear regression over the next 60 minutes. Results Support vector machine yields the best performance in terms of recall (84%). Including the invasive features in the classification improves the performance significantly with both recall and precision increasing by more than 20 percentage points. We were able to predict the MAP with a root mean square error (a frequently used measure of the differences between the predicted values and the observed values) of 10 mmHg 60 minutes in the future. After converting continuous MAP predictions into AHE binary predictions, we achieve a 91% recall and 68% precision. In addition to predicting AHE, the MAP predictions provide clinically useful information regarding the timing and severity of the AHE occurrence. Conclusion We were able to predict AHE with precision and recall above 80% 30 minutes in advance with the large real-world dataset. The prediction of regression model can provide a more fine-grained, interpretable signal to practitioners. Model performance is improved by the inclusion of invasive features in predicting AHE, when compared to predicting the AHE based on only the available, restricted set of noninvasive technologies. This demonstrates the importance of exploring more noninvasive technologies for AHE prediction.

scholarly journals CAFD: Context-Aware Fault Diagnostic Scheme towards Sensor Faults Utilizing Machine Learning

Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 617
Author(s):  
Umer Saeed ◽  
Young-Doo Lee ◽  
Sana Ullah Jan ◽  
Insoo Koo
Keyword(s):  
Machine Learning ◽  
Learning Algorithm ◽  
Diagnostic System ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Context Aware ◽  
Sensor Faults ◽  
Training Time ◽  
Low Intensity ◽  
Fault Diagnostic

Sensors’ existence as a key component of Cyber-Physical Systems makes it susceptible to failures due to complex environments, low-quality production, and aging. When defective, sensors either stop communicating or convey incorrect information. These unsteady situations threaten the safety, economy, and reliability of a system. The objective of this study is to construct a lightweight machine learning-based fault detection and diagnostic system within the limited energy resources, memory, and computation of a Wireless Sensor Network (WSN). In this paper, a Context-Aware Fault Diagnostic (CAFD) scheme is proposed based on an ensemble learning algorithm called Extra-Trees. To evaluate the performance of the proposed scheme, a realistic WSN scenario composed of humidity and temperature sensor observations is replicated with extreme low-intensity faults. Six commonly occurring types of sensor fault are considered: drift, hard-over/bias, spike, erratic/precision degradation, stuck, and data-loss. The proposed CAFD scheme reveals the ability to accurately detect and diagnose low-intensity sensor faults in a timely manner. Moreover, the efficiency of the Extra-Trees algorithm in terms of diagnostic accuracy, F1-score, ROC-AUC, and training time is demonstrated by comparison with cutting-edge machine learning algorithms: a Support Vector Machine and a Neural Network.

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.

Machine Learning Models for Finger Bend Evaluation using Implemented Low cost Flex Sensor

2021 ◽  
Vol 9 (VI) ◽  
pp. 3605-3611
Author(s):  
Pratyush Kaware
Keyword(s):  
Machine Learning ◽  
Support Vector Machine ◽  
Low Cost ◽  
Learning Algorithms ◽  
Cost Effective ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Learning Models ◽  
Machine Learning Models

In this paper a cost-effective sensor has been implemented to read finger bend signals, by attaching the sensor to a finger, so as to classify them based on the degree of bent as well as the joint about which the finger was being bent. This was done by testing with various machine learning algorithms to get the most accurate and consistent classifier. Finally, we found that Support Vector Machine was the best algorithm suited to classify our data, using we were able predict live state of a finger, i.e., the degree of bent and the joints involved. The live voltage values from the sensor were transmitted using a NodeMCU micro-controller which were converted to digital and uploaded on a database for analysis.

Search on Method of Netwok Intrusion Detection Based on Support Vector Machine with Pre-Extracting Support Vector

2013 ◽  
Vol 655-657 ◽  
pp. 1787-1790
Author(s):  
Sheng Chen Yu ◽  
Li Min Sun ◽  
Yang Xue ◽  
Hui Guo ◽  
Xiao Ju Wang ◽  
...  
Keyword(s):  
Support Vector Machine ◽  
Intrusion Detection ◽  
Intrusion Detection System ◽  
Detection System ◽  
Detection Algorithm ◽  
Support Vector ◽  
Distance Ratio ◽  
Training Time ◽  
Training Examples ◽  
Center Distance

Intrusion detection algorithm based on support vector machine with pre-extracting support vector is proposed which combines the center distance ratio and classification algorithm. Given proper thresholds, we can use the support vector as a substitute for the training examples. Then the scale of dataset is decreased and the performance of support vector machine is improved in the detection rate and the training time. The experiment result has shown that the intrusion detection system(IDS) based on support vector machine with pre-extracting support needs less training time under the same detection performance condition.

scholarly journals Predicting Student’s Performance Using Machine Learning Algorithm

2021 ◽  
pp. 53-58
Author(s):  
Sheela Rani P ◽  
Dhivya S ◽  
Dharshini Priya M ◽  
Dharmila Chowdary A
Keyword(s):  
Machine Learning ◽  
Support Vector Machine ◽  
Prediction Model ◽  
Naive Bayes ◽  
Learning Algorithm ◽  
Naïve Bayes ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Learning Approaches ◽  
K Nearest Neighbors

Machine learning is a new analysis discipline that uses knowledge to boost learning, optimizing the training method and developing the atmosphere within which learning happens. There square measure 2 sorts of machine learning approaches like supervised and unsupervised approach that square measure accustomed extract the knowledge that helps the decision-makers in future to require correct intervention. This paper introduces an issue that influences students' tutorial performance prediction model that uses a supervised variety of machine learning algorithms like support vector machine , KNN(k-nearest neighbors), Naïve Bayes and supplying regression and logistic regression. The results supported by various algorithms are compared and it is shown that the support vector machine and Naïve Bayes performs well by achieving improved accuracy as compared to other algorithms. The final prediction model during this paper may have fairly high prediction accuracy .The objective is not just to predict future performance of students but also provide the best technique for finding the most impactful features that influence student’s while studying.

scholarly journals Detection of Blood Cancer Cells Using Microscopic Images

2021 ◽  
Vol 9 (8) ◽  
pp. 995-1003
Author(s):  
Vidyashree M S
Keyword(s):  
Machine Learning ◽  
Support Vector Machine ◽  
Cancer Cells ◽  
Blood Cells ◽  
White Blood Cells ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Support Vector Machine Algorithm ◽  
Blood Cancer ◽  
Acute Myeloid

Abstract: Blood Cancer cells forming a tissue is called lymphoma. Thus, disease decreases the cells to fight against the infection or cancer blood cells. Blood cancer is also categorized in too many types. The two main categories of blood cancer are Acute Lymphocytic Lymphoma and Acute Myeloid Lymphoma. In this project proposes a approach that robotic detects and segments the nucleolus from white blood cells in the microscopic Blood images. Here in this project, we have used the two Machine learning algorithms that are k-means algorithm, Support vector machine algorithm. K-mean algorithm is use for segmentation and clustering. Support vector machine algorithm is used for classification. Keywords: k-means, Support vector machine, Lymphoma, Acute Lymphocytic Lymphoma, Machine Learning

Sign in / Sign up

Export Citation Format

Share Document