scholarly journals Detecting Unfavorable Driving States in Electroencephalography Based on a PCA Sample Entropy Feature and Multiple Classification Algorithms

Entropy ◽  
2020 ◽  
Vol 22 (11) ◽  
pp. 1248 ◽  
Author(s):  
Tao Zhang ◽  
Hong Wang ◽  
Jichi Chen ◽  
Enqiu He
Keyword(s):  
Traffic Accidents ◽  
Nearest Neighbor ◽  
Detection System ◽  
Principal Component ◽  
Sample Entropy ◽  
Support Vector ◽  
Classification Algorithms ◽  
K Nearest Neighbor ◽  
Feature Sets ◽  
Multiple Classification

Unfavorable driving states can cause a large number of vehicle crashes and are significant factors in leading to traffic accidents. Hence, the aim of this research is to design a robust system to detect unfavorable driving states based on sample entropy feature analysis and multiple classification algorithms. Multi-channel Electroencephalography (EEG) signals are recorded from 16 participants while performing two types of driving tasks. For the purpose of selecting optimal feature sets for classification, principal component analysis (PCA) is adopted for reducing dimensionality of feature sets. Multiple classification algorithms, namely, K nearest neighbor (KNN), decision tree (DT), support vector machine (SVM) and logistic regression (LR) are employed to improve the accuracy of unfavorable driving state detection. We use 10-fold cross-validation to assess the performance of the proposed systems. It is found that the proposed detection system, based on PCA features and the cubic SVM classification algorithm, shows robustness as it obtains the highest accuracy of 97.81%, sensitivity of 96.93%, specificity of 98.73% and precision of 98.75%. Experimental results show that the system we designed can effectively monitor unfavorable driving states.

IMPACT OF FULL RANK PRINCIPAL COMPONENT ANALYSIS ON CLASSIFICATION ALGORITHMS FOR FACE RECOGNITION

2012 ◽  
Vol 26 (03) ◽  
pp. 1256005 ◽  
Author(s):  
FENGXI SONG ◽  
JANE YOU ◽  
DAVID ZHANG ◽  
YONG XU
Keyword(s):  
Principal Component Analysis ◽  
Face Recognition ◽  
Nearest Neighbor ◽  
Experimental Studies ◽  
Principal Component ◽  
Full Rank ◽  
Component Analysis ◽  
Support Vector ◽  
Classification Algorithms ◽  
K Nearest Neighbor

Full rank principal component analysis (FR-PCA) is a special form of principal component analysis (PCA) which retains all nonzero components of PCA. Generally speaking, it is hard to estimate how the accuracy of a classifier will change after data are compressed by PCA. However, this paper reveals an interesting fact that the transformation by FR-PCA does not change the accuracy of many well-known classification algorithms. It predicates that people can safely use FR-PCA as a preprocessing tool to compress high-dimensional data without deteriorating the accuracies of these classifiers. The main contribution of the paper is that it theoretically proves that the transformation by FR-PCA does not change accuracies of the k nearest neighbor, the minimum distance, support vector machine, large margin linear projection, and maximum scatter difference classifiers. In addition, through extensive experimental studies conducted on several benchmark face image databases, this paper demonstrates that FR-PCA can greatly promote the efficiencies of above-mentioned five classification algorithms in appearance-based face recognition.

Optimizing Error Rate in Intrusion Detection System Using Artificial Neural Network Algorithm

2018 ◽  
Vol 6 (9) ◽  
pp. 152
Author(s):  
S. Vijaya Rani ◽  
G. N. K. Suresh Babu
Keyword(s):  
Neural Network ◽  
Artificial Neural Network ◽  
Intrusion Detection ◽  
Error Rate ◽  
Learning Process ◽  
Nearest Neighbor ◽  
Detection System ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Artificial Neural

The illegal hackers  penetrate the servers and networks of corporate and financial institutions to gain money and extract vital information. The hacking varies from one computing system to many system. They gain access by sending malicious packets in the network through virus, worms, Trojan horses etc. The hackers scan a network through various tools and collect information of network and host. Hence it is very much essential to detect the attacks as they enter into a network. The methods  available for intrusion detection are Naive Bayes, Decision tree, Support Vector Machine, K-Nearest Neighbor, Artificial Neural Networks. A neural network consists of processing units in complex manner and able to store information and make it functional for use. It acts like human brain and takes knowledge from the environment through training and learning process. Many algorithms are available for learning process This work carry out research on analysis of malicious packets and predicting the error rate in detection of injured packets through artificial neural network algorithms.

scholarly journals Feature and Decision Level Fusion in Children Multimodal Biometrics

2020 ◽  
Vol 8 (5) ◽  
pp. 2522-2527
Keyword(s):  
Nearest Neighbor ◽  
Principal Component ◽  
Identification Accuracy ◽  
Support Vector ◽  
Biometric System ◽  
K Nearest Neighbor ◽  
Decision Level ◽  
Multimodal Biometric System ◽  
Decision Level Fusion ◽  
Level Fusion

In this paper, we design method for recognition of fingerprint and IRIS using feature level fusion and decision level fusion in Children multimodal biometric system. Initially, Histogram of Gradients (HOG), Gabour and Maximum filter response are extracted from both the domains of fingerprint and IRIS and considered for identification accuracy. The combination of feature vector of all the possible features is recommended by biometrics traits of fusion. For fusion vector the Principal Component Analysis (PCA) is used to select features. The reduced features are fed into fusion classifier of K-Nearest Neighbor (KNN), Support Vector Machine (SVM), Navie Bayes(NB). For children multimodal biometric system the suitable combination of features and fusion classifiers is identified. The experimentation conducted on children’s fingerprint and IRIS database and results reveal that fusion combination outperforms individual. In addition the proposed model advances the unimodal biometrics system.

scholarly journals Fatigue Detection on Face Image Using FaceNet Algorithm and K-Nearest Neighbor Classifier

2021 ◽  
Vol 7 (1) ◽  
pp. 22
Author(s):  
Faisal Dharma Adhinata ◽  
Diovianto Putra Rakhmadani ◽  
Danur Wijayanto
Keyword(s):  
Nearest Neighbor ◽  
Detection System ◽  
Well Being ◽  
Extraction Process ◽  
Polynomial Kernel ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Time Data ◽  
Multiclass Svm ◽  
Fatigue Detection

Background: The COVID-19 pandemic has made people spend more time on online meetings more than ever. The prolonged time looking at the monitor may cause fatigue, which can subsequently impact the mental and physical health. A fatigue detection system is needed to monitor the Internet users well-being. Previous research related to the fatigue detection system used a fuzzy system, but the accuracy was below 85%. In this research, machine learning is used to improve accuracy.Objective: This research examines the combination of the FaceNet algorithm with either k-nearest neighbor (K-NN) or multiclass support vector machine (SVM) to improve the accuracy.Methods: In this study, we used the UTA-RLDD dataset. The features used for fatigue detection come from the face, so the dataset is segmented using the Haar Cascades method, which is then resized. The feature extraction process uses FaceNet's pre-trained algorithm. The extracted features are classified into three classes—focused, unfocused, and fatigue—using the K-NN or multiclass SVM method.Results: The combination between the FaceNet algorithm and K-NN, with a value of  resulted in a better accuracy than the FaceNet algorithm with multiclass SVM with the polynomial kernel (at 94.68% and 89.87% respectively). The processing speed of both combinations of methods has allowed for real-time data processing.Conclusion: This research provides an overview of methods for early fatigue detection while working at the computer so that we can limit staring at the computer screen too long and switch places to maintain the health of our eyes. 

scholarly journals Identifying Fragmented Reading and Evaluating Its Influence on Cognition Based on Single Trial Electroencephalogram

2021 ◽  
Vol 15 ◽  
Author(s):  
Jingwen Feng ◽  
Bo Hu ◽  
Jingting Sun ◽  
Junpeng Zhang ◽  
Wen Wang ◽  
...  
Keyword(s):  
Cognitive Impairment ◽  
Classification Accuracy ◽  
Nearest Neighbor ◽  
Support Vector ◽  
Continuous Performance Task ◽  
Single Trial ◽  
K Nearest Neighbor ◽  
Background Condition ◽  
Frequency Bands ◽  
Feature Sets

Background: The use of social media daily could nurture a fragmented reading habit. However, little is known whether fragmented reading (FR) affects cognition and what are the underlying electroencephalogram (EEG) alterations it may lead to.Purpose: This study aimed to identify whether individuals have FR habits based on the single-trial EEG spectral features using machine learning (ML), as well as to find out the potential cognitive impairment induced by FR.Methods: Subjects were recruited through a questionnaire and divided into FR and noFR groups according to the time they spent on FR per day. Moreover, 64-channel EEG was acquired in Continuous Performance Task (CPT) and segmented into 0.5–1.5 s post-stimulus epochs under cue and background conditions. The sample sizes were as follows: FR in cue condition, 692 trials; noFR in cue condition, 688 trials; FR in background condition, 561 trials; noFR in background condition, 585 trials. For these single-trials, the relative power (RP) of six frequency bands [delta (1–3 Hz), theta (4–7 Hz), alpha (8–13 Hz), beta1 (14–20 Hz), beta2 (21–29 Hz), lower gamma (30–40 Hz)] were extracted as features. After feature selection, the most important feature sets were fed into three ML models, namely Support-Vector Machine (SVM), K-Nearest Neighbor (KNN), and Naive Bayes to perform the identification of FR. RP of six frequency bands was also used as feature sets to conduct classification tasks.Results: The classification accuracy reached up to 96.52% in the SVM model under cue conditions. Specifically, among six frequency bands, the most important features were found in alpha and gamma bands. Gamma achieved the highest classification accuracy (86.69% for cue, 86.45% for background). In both conditions, alpha RP in central sites of FR was stronger than noFR (p < 0.001). Gamma RP in the frontal site of FR was weaker than noFR in the background condition (p < 0.001), while alpha RP in parieto-occipital sites of FR was stronger than noFR in the cue condition (p < 0.001).Conclusion: Fragmented reading can be identified based on single-trial EEG evoked by CPT using ML, and the RP of alpha and gamma may reflect the impairment on attention and working memory by FR. FR might lead to cognitive impairment and is worth further exploration.

scholarly journals Plant disease prediction using classification algorithms

2021 ◽  
Vol 10 (1) ◽  
pp. 257
Author(s):  
Maria Morgan ◽  
Carla Blank ◽  
Raed Seetan
Keyword(s):  
Neural Network ◽  
Artificial Neural Network ◽  
Nearest Neighbor ◽  
Disease Classification ◽  
Future Research ◽  
Support Vector ◽  
Classification Algorithms ◽  
Disease Prediction ◽  
K Nearest Neighbor ◽  
Artificial Neural

<p>This paper investigates the capability of six existing classification algorithms (Artificial Neural Network, Naïve Bayes, k-Nearest Neighbor, Support Vector Machine, Decision Tree and Random Forest) in classifying and predicting diseases in soybean and mushroom datasets using datasets with numerical or categorical attributes. While many similar studies have been conducted on datasets of images to predict plant diseases, the main objective of this study is to suggest classification methods that can be used for disease classification and prediction in datasets that contain raw measurements instead of images. A fungus and a plant dataset, which had many differences, were chosen so that the findings in this paper could be applied to future research for disease prediction and classification in a variety of datasets which contain raw measurements. A key difference between the two datasets, other than one being a fungus and one being a plant, is that the mushroom dataset is balanced and only contained two classes while the soybean dataset is imbalanced and contained eighteen classes. All six algorithms performed well on the mushroom dataset, while the Artificial Neural Network and k-Nearest Neighbor algorithms performed best on the soybean dataset. The findings of this paper can be applied to future research on disease classification and prediction in a variety of dataset types such as fungi, plants, humans, and animals.</p>

scholarly journals COMPARATIVE STUDY OF CLASSIFICATION ALGORITHMS: HOLDOUTS AS ACCURACY ESTIMATION

2016 ◽  
Vol 1 (1) ◽  
pp. 13 ◽  
Author(s):  
Debby Erce Sondakh
Keyword(s):  
Decision Tree ◽  
Nearest Neighbor ◽  
Naive Bayes ◽  
Decision Rules ◽  
Naïve Bayes ◽  
Support Vector ◽  
Classification Algorithms ◽  
K Nearest Neighbor ◽  
Accuracy Estimation ◽  
F Measure

Penelitian ini bertujuan untuk mengukur dan membandingkan kinerja lima algoritma klasifikasi teks berbasis pembelajaran mesin, yaitu decision rules, decision tree, k-nearest neighbor (k-NN), naïve Bayes, dan Support Vector Machine (SVM), menggunakan dokumen teks multi-class. Perbandingan dilakukan pada efektifiatas algoritma, yaitu kemampuan untuk mengklasifikasi dokumen pada kategori yang tepat, menggunakan metode holdout atau percentage split. Ukuran efektifitas yang digunakan adalah precision, recall, F-measure, dan akurasi. Hasil eksperimen menunjukkan bahwa untuk algoritma naïve Bayes, semakin besar persentase dokumen pelatihan semakin tinggi akurasi model yang dihasilkan. Akurasi tertinggi naïve Bayes pada persentase 90/10, SVM pada 80/20, dan decision tree pada 70/30. Hasil eksperimen juga menunjukkan, algoritma naïve Bayes memiliki nilai efektifitas tertinggi di antara lima algoritma yang diuji, dan waktu membangun model klasiifikasi yang tercepat, yaitu 0.02 detik. Algoritma decision tree dapat mengklasifikasi dokumen teks dengan nilai akurasi yang lebih tinggi dibanding SVM, namun waktu membangun modelnya lebih lambat. Dalam hal waktu membangun model, k-NN adalah yang tercepat namun nilai akurasinya kurang.

scholarly journals Biometric authenticator algorithm based on multiresolution analysis

2020 ◽  
Vol 20 (3) ◽  
pp. 1332
Author(s):  
Soumia Kerrache ◽  
Beladgham Mohammed ◽  
Hamza Aymen ◽  
Kadri Ibrahim
Keyword(s):  
Feature Extraction ◽  
Multiresolution Analysis ◽  
Nearest Neighbor ◽  
Curvelet Transform ◽  
Principal Component ◽  
Image Features ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Feature Extraction Method ◽  
Fusion Approach

Features extraction is an essential process in identifying person biometrics because the effectiveness of the system depends on it. Multiresolution Analysis success can be used in the system of a person’s identification and pattern recognition. In this paper, we present a feature extraction method for two-dimensional face and iris authentication.  Our approach is a combination of principal component analysis (PCA) and curvelet transform as an improved fusion approach for feature extraction. The proposed fusion approach involves image denoising using 2D-Curvelet transform to achieve compact representations of curves singularities. This is followed by the application of PCA as a fusion rule to improve upon the spatial resolution. The limitations of the only PCA algorithm are a poor recognition speed and complex mathematical calculating load, to reduce these limitations, we are applying the curvelet transform. <br /> To assess the performance of the presented method, we have employed three classification techniques: Neural networks (NN), K-Nearest Neighbor (KNN) and Support Vector machines (SVM).<br />The results reveal that the extraction of image features is more efficient using Curvelet/PCA.

scholarly journals Pear Defect Detection Method Based on ResNet and DCGAN

Information ◽  
2021 ◽  
Vol 12 (10) ◽  
pp. 397
Author(s):  
Yan Zhang ◽  
Shiyun Wa ◽  
Pengshuo Sun ◽  
Yaojun Wang
Keyword(s):  
Defect Detection ◽  
Clustering Algorithm ◽  
Nearest Neighbor ◽  
Detection System ◽  
Implementation Process ◽  
Support Vector ◽  
Detection Accuracy ◽  
K Nearest Neighbor ◽  
Generation Network ◽  
Low Efficiency

To address the current situation, in which pear defect detection is still based on a workforce with low efficiency, we propose the use of the CNN model to detect pear defects. Since it is challenging to obtain defect images in the implementation process, a deep convolutional adversarial generation network was used to augment the defect images. As the experimental results indicated, the detection accuracy of the proposed method on the 3000 validation set was as high as 97.35%. Variant mainstream CNNs were compared to evaluate the model’s performance thoroughly, and the top performer was selected to conduct further comparative experiments with traditional machine learning methods, such as support vector machine algorithm, random forest algorithm, and k-nearest neighbor clustering algorithm. Moreover, the other two varieties of pears that have not been trained were chosen to validate the robustness and generalization capability of the model. The validation results illustrated that the proposed method is more accurate than the commonly used algorithms for pear defect detection. It is robust enough to be generalized well to other datasets. In order to allow the method proposed in this paper to be applied in agriculture, an intelligent pear defect detection system was built based on an iOS device.

Snow Detection using In-Vehicle Video Camera with Texture-Based Image Features Utilizing K-Nearest Neighbor, Support Vector Machine, and Random Forest

2019 ◽  
Vol 2673 (8) ◽  
pp. 221-232 ◽  
Author(s):  
Md Nasim Khan ◽  
Mohamed M. Ahmed
Keyword(s):  
Real Time ◽  
Prediction Accuracy ◽  
Nearest Neighbor ◽  
Detection System ◽  
Weather Conditions ◽  
Video Camera ◽  
Image Features ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Weather Information

Snowfall negatively affects pavement and visibility conditions, making it one of the major causes of motor vehicle crashes in winter weather. Therefore, providing drivers with real-time roadway weather information during adverse weather is crucial for safe driving. Although road weather stations can provide weather information, these stations are expensive and often do not represent real-time trajectory-level weather information. The main motivation of this study was to develop an affordable in-vehicle snow detection system which can provide trajectory-level weather information in real time. The system utilized SHRP2 Naturalistic Driving Study video data and was based on machine learning techniques. To train the snow detection models, two texture-based image features including gray level co-occurrence matrix (GLCM) and local binary pattern (LBP), and three classification algorithms: support vector machine (SVM), k-nearest neighbor (K-NN), and random forest (RF) were used. The analysis was done on an image dataset consisting of three weather conditions: clear, light snow, and heavy snow. While the highest overall prediction accuracy of the models based on the GLCM features was found to be around 86%, the models considering the LBP based features provided a much higher prediction accuracy of 96%. The snow detection system proposed in this study is cost effective, does not require a lot of technical support, and only needs a single video camera. With the advances in smartphone cameras, simple mobile apps with proper data connectivity can effectively be used to detect roadway weather conditions in real time with reasonable accuracy.

Sign in / Sign up

Export Citation Format

Share Document