scholarly journals Detection of Knee Joint Disorders using SVM Classifier

2021 ◽  
pp. 261-271
Author(s):  
Alphonsa Salu S. J. ◽  
Jeraldin Auxillia D
Keyword(s):  
Principal Component Analysis ◽  
Feature Selection ◽  
Knee Joint ◽  
Principal Component ◽  
Approximate Entropy ◽  
Component Analysis ◽  
Invasive Technique ◽  
Support Vector ◽  
Svm Classifier ◽  
Entropy Measures

A non-invasive technique using knee joint vibroarthographic (VAG) signals can be used for the early diagnosis of knee joint disorders. Among the algorithms devised for the detection of knee joint disorders using VAG signals, algorithms based on entropy measures can provide better performance. In this work, the VAG signal is preprocessed using wavelet decomposition into sub band signals. Features of the decomposed sub bands such as approximate entropy, sample entropy & wavelet energy are extracted as a quantified measure of complexity of the signal. A feature selection based on Principal Component Analysis (PCA) is performed in order to select the significant features. The extracted features are then used for classification of VAG signal into normal and abnormal VAG using support vector machine. It is observed that the classifier provides a better accuracy with feature selection using principal component analysis. And the results show that the classifier was able to classify the signal with an accuracy of 82.6%, error rate of 0.174, sensitivity of 1.0 and specificity of 0.888.

scholarly journals Feature Extraction and Classification for the Detection of Knee Joint Disorders using Random Forest Classifier

2021 ◽  
Vol 9 (10) ◽  
pp. 1348-1356
Keyword(s):  
Principal Component Analysis ◽  
Feature Selection ◽  
Random Forest ◽  
Knee Joint ◽  
Principal Component ◽  
Approximate Entropy ◽  
Component Analysis ◽  
Random Forest Classifier ◽  
Invasive Technique ◽  
Entropy Measures

A non-invasive technique using knee joint vibroarthrographic (VAG) signals can be used for the early diagnosis of knee joint disorders. Among the algorithms devised for the detection of knee joint disorders using VAG signals, algorithms based on entropy measures can provide better performance. In this work, the VAG signal is preprocessed using wavelet decomposition into sub band signals. Features of the decomposed sub bands such as approximate entropy, sample entropy and wavelet energy are extracted as a quantified measure of complexity of the signal. A feature selection based on Principal Component Analysis (PCA) is performed in order to select the significant features. The extracted features are then used for classification of VAG signal into normal and abnormal VAG using random forest classifier. It is observed that the classifier provides a better accuracy with feature selection using principal component analysis. And the result shows that the classifier is able to classify the signal with an accuracy of 87%, error rate of 0.13, sensitivity of 0.874 and specificity of 0.777.

Efficient Feature Descriptor using Gabor Filter and Principal Component Analysis for Glaucoma Diagnosis

2021 ◽  
pp. 6787-6794
Author(s):  
Anisha Rebinth, Dr. S. Mohan Kumar
Keyword(s):  
Principal Component Analysis ◽  
Gabor Filter ◽  
Principal Component ◽  
Component Analysis ◽  
Disease Diagnosis ◽  
Image Features ◽  
Support Vector ◽  
Svm Classifier ◽  
Feature Descriptor ◽  
Glaucoma Diagnosis

An automated Computer Aided Diagnosis (CAD) system for glaucoma diagnosis using fundus images is developed. The various glaucoma image classification schemes using the supervised and unsupervised learning approaches are reviewed. The research paper involves three stages of glaucoma disease diagnosis. First, the pre-processing stage the texture features of the fundus image is recorded with a two-dimensional Gabor filter at various sizes and orientations. The image features are generated using higher order statistical characteristics, and then Principal Component Analysis (PCA) is used to select and reduce the dimension of the image features. For the performance study, the Gabor filter based features are extracted from the RIM-ONE and HRF database images, and then Support Vector Machine (SVM) classifier is used for classification. Final stage utilizes the SVM classifier with the Radial Basis Function (RBF) kernel learning technique for the efficient classification of glaucoma disease with accuracy 90%.

scholarly journals Multivariate Analysis and Machine Learning for Ripeness Classification of Cape Gooseberry Fruits

Processes ◽  
2019 ◽  
Vol 7 (12) ◽  
pp. 928 ◽  
Author(s):  
Miguel De-la-Torre ◽  
Omar Zatarain ◽  
Himer Avila-George ◽  
Mirna Muñoz ◽  
Jimy Oblitas ◽  
...  
Keyword(s):  
Machine Learning ◽  
Principal Component Analysis ◽  
Feature Selection ◽  
Principal Component ◽  
Component Analysis ◽  
Support Vector ◽  
Color Spaces ◽  
Combination Methods ◽  
Fruit Samples ◽  
Cape Gooseberry

This paper explores five multivariate techniques for information fusion on sorting the visual ripeness of Cape gooseberry fruits (principal component analysis, linear discriminant analysis, independent component analysis, eigenvector centrality feature selection, and multi-cluster feature selection.) These techniques are applied to the concatenated channels corresponding to red, green, and blue (RGB), hue, saturation, value (HSV), and lightness, red/green value, and blue/yellow value (L*a*b) color spaces (9 features in total). Machine learning techniques have been reported for sorting the Cape gooseberry fruits’ ripeness. Classifiers such as neural networks, support vector machines, and nearest neighbors discriminate on fruit samples using different color spaces. Despite the color spaces being equivalent up to a transformation, a few classifiers enable better performances due to differences in the pixel distribution of samples. Experimental results show that selection and combination of color channels allow classifiers to reach similar levels of accuracy; however, combination methods still require higher computational complexity. The highest level of accuracy was obtained using the seven-dimensional principal component analysis feature space.

scholarly journals Towards a software defect proneness model: feature selection

2021 ◽  
Vol 4 (4) ◽  
pp. 354-365
Author(s):  
Vitaliy S. Yakovyna ◽  
◽  
Ivan I. Symets
Keyword(s):  
Principal Component Analysis ◽  
Feature Selection ◽  
Random Forest ◽  
Software Reliability ◽  
Principal Component ◽  
Component Analysis ◽  
Support Vector ◽  
Tree Classifier ◽  
Code Metrics ◽  
Software Code

This article is focused on improving static models of software reliability based on using machine learning methods to select the software code metrics that most strongly affect its reliability. The study used a merged dataset from the PROMISE Software Engineering repository, which contained data on testing software modules of five programs and twenty-one code metrics. For the prepared sampling, the most important features that affect the quality of software code have been selected using the following methods of feature selection: Boruta, Stepwise selection, Exhaustive Feature Selection, Random Forest Importance, LightGBM Importance, Genetic Algorithms, Principal Component Analysis, Xverse python. Basing on the voting on the results of the work of the methods of feature selection, a static (deterministic) model of software reliability has been built, which establishes the relationship between the probability of a defect in the software module and the metrics of its code. It has been shown that this model includes such code metrics as branch count of a program, McCabe’s lines of code and cyclomatic complexity, Halstead’s total number of operators and operands, intelligence, volume, and effort value. A comparison of the effectiveness of different methods of feature selection has been put into practice, in particular, a study of the effect of the method of feature selection on the accuracy of classification using the following classifiers: Random Forest, Support Vector Machine, k-Nearest Neighbors, Decision Tree classifier, AdaBoost classifier, Gradient Boosting for classification. It has been shown that the use of any method of feature selection increases the accuracy of classification by at least ten percent compared to the original dataset, which confirms the importance of this procedure for predicting software defects based on metric datasets that contain a significant number of highly correlated software code metrics. It has been found that the best accuracy of the forecast for most classifiers was reached using a set of features obtained from the proposed static model of software reliability. In addition, it has been shown that it is also possible to use separate methods, such as Autoencoder, Exhaustive Feature Selection and Principal Component Analysis with an insignificant loss of classification and prediction accuracy

scholarly journals Intrusion Detection System using One Class SVM with and without Feature Selection in Wormhole Attack Detection

2019 ◽  
Vol 9 (2S4) ◽  
pp. 629-638
Keyword(s):  
Principal Component Analysis ◽  
Feature Selection ◽  
Ad Hoc ◽  
Detection System ◽  
Principal Component ◽  
Component Analysis ◽  
Svm Classifier ◽  
Feature Selection Technique ◽  
Selection Technique ◽  
Wormhole Attack

An Ad-hoc network is a kind of wireless construction from one to another computer, without having Wi-Fi access point or Router. However, the Ad hoc approach offers marginal security and decreases the data transfer rate. Consequently, it helps the attacker to connect with the ad-hoc network without any trouble. Therefore, a robust and reliable intrusion detection system (IDS) is a necessity of today’s information security domain. These IDS systems play a vital role in monitoring the threats encountered in a network by detecting the change in the normal profile due to attacks. Recently, to detect attacks the IDS are being equipped with machine learning algorithms to attain better accuracy and fast detection speed. Most of the IDS use different network features. However, enormous number of features makes the detection and prevention complicated. The IDS presented in this paper employs random forest and principal component analysis to minimize the number of features for network IDS for wireless ad hoc networks. The one class SVM has been used for detection of worm hole attack with and without feature selection. The performances of these approaches are compared with various existing techniques with false positive rate (FPR), accuracy and detection rate. Here, the accuracy improves and false positive rate reduces when intrusion is detected with feature selection technique. This paper discusses the performance of the one class SVM classifier in the wireless adhoc network IDS with random forest feature selection and principal component analysis feature selection techniques and one class SVM classifier without feature selection technique in the detection of wormhole attack. And the performance of one class SVM IDS is better in the detection of wormhole attack while it is implemented with principal component analysis feature selection technique.

New Pattern Recognition Method Based on Wavelet De-Noising and Kernel Principal Component Analysis

2012 ◽  
Vol 235 ◽  
pp. 74-78 ◽  
Author(s):  
Jia Jun Zhang ◽  
Li Juan Liang
Keyword(s):  
Principal Component Analysis ◽  
Image Recognition ◽  
Principal Component ◽  
Component Analysis ◽  
Face Image ◽  
Kernel Principal Component Analysis ◽  
Support Vector ◽  
Svm Classifier ◽  
Face Images ◽  
The Face

The background noise influences the face image recognition greatly. It is crucial to remove the noise signals prior to the face image recognition processing. For this purpose, the wavelet de-noising technology has combined with the kernel principal component analysis (KPCA) to identify face images in this paper. The wavelet de-noising technology was firstly used to remove the noise signals. Then the KPCA was employed to extract useful principal components for the face image recognition. By doing so, the dimensionality of the feature space can be reduced effectively and hence the performance of the face image recognition can be enhanced. Lastly, a support vector machine (SVM) classifier was used to recognize the face images. Experimental tests have been conducted to validate and evaluate the proposed method for the face image recognition. The analysis results have showed high performance of the newly proposed method for face image identification.

scholarly journals Multiview Machine Vision Research of Fruits Boxes Handling Robot Based on the Improved 2D Kernel Principal Component Analysis Network

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Xinning Li ◽  
Hu Wu ◽  
Xianhai Yang ◽  
Peng Xue ◽  
Shuai Tan
Keyword(s):  
Principal Component Analysis ◽  
Recognition Rate ◽  
Principal Component ◽  
Component Analysis ◽  
Mean Value ◽  
Kernel Principal Component Analysis ◽  
Support Vector ◽  
Svm Classifier ◽  
Labour Intensity ◽  
The Mean

In order to better realize the orchard intelligent mechanization and reduce the labour intensity of workers, the study of intelligent fruit boxes handling robot is necessary. The first condition to realize intelligence is the fruit boxes recognition, which is the research content of this paper. The method of multiview two-dimensional (2D) recognition was adopted. A multiview dataset for fruits boxes was built. For the sake of the structure of the original image, the model of binary multiview 2D kernel principal component analysis network (BM2DKPCANet) was established to reduce the data redundancy and increase the correlation between the views. The method of multiview recognition for the fruits boxes was proposed combining BM2DKPCANet with the support vector machine (SVM) classifier. The performance was verified by comparing with principal component analysis network (PCANet), 2D principal component analysis network (2DPCANet), kernel principal component analysis network (KPCANet), and binary multiview kernel principal component analysis network (BMKPCANet) in terms of recognition rate and time consumption. The experimental results show that the recognition rate of the method is 11.84% higher than the mean value of PCANet though it needs more time. Compared with the mean value of KPCANet, the recognition rate exceeded 2.485%, and the time saved was 24.5%. The model can meet the requirements of fruits boxes handling robot.

Sign in / Sign up

Export Citation Format

Share Document