scholarly journals TWO LEVELS FUSION DECISION FOR MULTISPECTRAL IMAGE PATTERN RECOGNITION

2015 ◽  
Vol II-2/W2 ◽  
pp. 69-74
Author(s):  
H. Elmannai ◽  
M. A. Loghmari ◽  
M. S. Naceur
Keyword(s):  
Pattern Recognition ◽  
Feature Extraction ◽  
Majority Vote ◽  
Source Separation ◽  
Curvelet Transform ◽  
Training Data ◽  
Gabor Wavelet ◽  
Support Vector ◽  
Data Set ◽  
Non Linear

Major goal of multispectral data analysis is land cover classification and related applications. The dimension drawback leads to a small ratio of the remote sensing training data compared to the number of features. Therefore robust methods should be associated to overcome the dimensionality curse. The presented work proposed a pattern recognition approach. Source separation, feature extraction and decisional fusion are the main stages to establish an automatic pattern recognizer. <br><br> The first stage is pre-processing and is based on non linear source separation. The mixing process is considered non linear with gaussians distributions. The second stage performs feature extraction for Gabor, Wavelet and Curvelet transform. Feature information presentation provides an efficient information description for machine vision projects. <br><br> The third stage is a decisional fusion performed in two steps. The first step assign the best feature to each source/pattern using the accuracy matrix obtained from the learning data set. The second step is a source majority vote. Classification is performed by Support Vector Machine. Experimentation results show that the proposed fusion method enhances the classification accuracy and provide powerful tool for pattern recognition.

scholarly journals Detection and Characterization of Physical Activity and Psychological Stress from Wristband Data

Signals ◽  
2020 ◽  
Vol 1 (2) ◽  
pp. 188-208
Author(s):  
Mert Sevil ◽  
Mudassir Rashid ◽  
Mohammad Reza Askari ◽  
Zacharie Maloney ◽  
Iman Hajizadeh ◽  
...  
Keyword(s):  
Physical Activity ◽  
Signal Processing ◽  
Feature Extraction ◽  
Psychological Stress ◽  
Training Data ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Data Set ◽  
Linear Discriminant ◽  
Physiological Variables

Wearable devices continuously measure multiple physiological variables to inform users of health and behavior indicators. The computed health indicators must rely on informative signals obtained by processing the raw physiological variables with powerful noise- and artifacts-filtering algorithms. In this study, we aimed to elucidate the effects of signal processing techniques on the accuracy of detecting and discriminating physical activity (PA) and acute psychological stress (APS) using physiological measurements (blood volume pulse, heart rate, skin temperature, galvanic skin response, and accelerometer) collected from a wristband. Data from 207 experiments involving 24 subjects were used to develop signal processing, feature extraction, and machine learning (ML) algorithms that can detect and discriminate PA and APS when they occur individually or concurrently, classify different types of PA and APS, and estimate energy expenditure (EE). Training data were used to generate feature variables from the physiological variables and develop ML models (naïve Bayes, decision tree, k-nearest neighbor, linear discriminant, ensemble learning, and support vector machine). Results from an independent labeled testing data set demonstrate that PA was detected and classified with an accuracy of 99.3%, and APS was detected and classified with an accuracy of 92.7%, whereas the simultaneous occurrences of both PA and APS were detected and classified with an accuracy of 89.9% (relative to actual class labels), and EE was estimated with a low mean absolute error of 0.02 metabolic equivalent of task (MET).The data filtering and adaptive noise cancellation techniques used to mitigate the effects of noise and artifacts on the classification results increased the detection and discrimination accuracy by 0.7% and 3.0% for PA and APS, respectively, and by 18% for EE estimation. The results demonstrate the physiological measurements from wristband devices are susceptible to noise and artifacts, and elucidate the effects of signal processing and feature extraction on the accuracy of detection, classification, and estimation of PA and APS.

A Performance Comparison of EMG Classification Methods for Hand and Finger Motion

2014 ◽  
Author(s):  
Sungtae Shin ◽  
Reza Langari ◽  
Reza Tafreshi
Keyword(s):  
Pattern Recognition ◽  
Feature Extraction ◽  
Discriminant Analysis ◽  
Dimension Reduction ◽  
Time Domain ◽  
Classification Accuracy ◽  
Human Motion ◽  
Support Vector ◽  
Classification Methods ◽  
Data Set

For recognizing human motion intent, electromyogram (EMG) based pattern recognition approaches have been studied for many years. A number of methods for classifying EMG patterns have been introduced in the literature. On the purpose of selecting the best performing method for the practical application, this paper compares EMG pattern recognition methods in terms of motion type, feature extraction, dimension reduction, and classification algorithm. Also, for more usability of this research, hand and finger EMG motion data set which had been published online was used. Time-domain, empirical mode decomposition, discrete wavelet transform, and wavelet packet transform were adopted as the feature extraction. Three cases, such as no dimension reduction, principal component analysis (PCA), and linear discriminant analysis (LDA), were compared. Six classification algorithms were also compared: naïve Bayes, k-nearest neighbor, quadratic discriminant analysis, support vector machine, multi-layer perceptron, and extreme machine learning. The performance of each case was estimated by three perspectives: classification accuracy, train time, and test (prediction) time. From the experimental results, the time-domain feature set and LDA were required for the highest classification accuracy. Fast train time and test time are dependent on the classification methods.

QSAR Study of PARP Inhibitors by GA-MLR, GA-SVM and GA-ANN Approaches

2020 ◽  
Vol 16 (8) ◽  
pp. 1088-1105
Author(s):  
Nafiseh Vahedi ◽  
Majid Mohammadhosseini ◽  
Mehdi Nekoei
Keyword(s):  
Present Report ◽  
Principal Component ◽  
Parp Inhibitors ◽  
Support Vector ◽  
Ann Model ◽  
Statistical Parameters ◽  
Qsar Study ◽  
Data Set ◽  
Test Set ◽  
Non Linear

Background: The poly(ADP-ribose) polymerases (PARP) is a nuclear enzyme superfamily present in eukaryotes. Methods: In the present report, some efficient linear and non-linear methods including multiple linear regression (MLR), support vector machine (SVM) and artificial neural networks (ANN) were successfully used to develop and establish quantitative structure-activity relationship (QSAR) models capable of predicting pEC50 values of tetrahydropyridopyridazinone derivatives as effective PARP inhibitors. Principal component analysis (PCA) was used to a rational division of the whole data set and selection of the training and test sets. A genetic algorithm (GA) variable selection method was employed to select the optimal subset of descriptors that have the most significant contributions to the overall inhibitory activity from the large pool of calculated descriptors. Results: The accuracy and predictability of the proposed models were further confirmed using crossvalidation, validation through an external test set and Y-randomization (chance correlations) approaches. Moreover, an exhaustive statistical comparison was performed on the outputs of the proposed models. The results revealed that non-linear modeling approaches, including SVM and ANN could provide much more prediction capabilities. Conclusion: Among the constructed models and in terms of root mean square error of predictions (RMSEP), cross-validation coefficients (Q2 LOO and Q2 LGO), as well as R2 and F-statistical value for the training set, the predictive power of the GA-SVM approach was better. However, compared with MLR and SVM, the statistical parameters for the test set were more proper using the GA-ANN model.

Headnote Prediction Using Machine Learning

2021 ◽  
Vol 18 (5) ◽  
Author(s):  
Sarmad Mahar ◽  
Sahar Zafar ◽  
Kamran Nishat
Keyword(s):  
Machine Learning ◽  
Feature Extraction ◽  
Active Learning ◽  
Text Classification ◽  
Extraction Methods ◽  
Text Summarization ◽  
Training Data ◽  
Second Step ◽  
Support Vector ◽  
Classification Algorithms

Headnotes are the precise explanation and summary of legal points in an issued judgment. Law journals hire experienced lawyers to write these headnotes. These headnotes help the reader quickly determine the issue discussed in the case. Headnotes comprise two parts. The first part comprises the topic discussed in the judgment, and the second part contains a summary of that judgment. In this thesis, we design, develop and evaluate headnote prediction using machine learning, without involving human involvement. We divided this task into a two steps process. In the first step, we predict law points used in the judgment by using text classification algorithms. The second step generates a summary of the judgment using text summarization techniques. To achieve this task, we created a Databank by extracting data from different law sources in Pakistan. We labelled training data generated based on Pakistan law websites. We tested different feature extraction methods on judiciary data to improve our system. Using these feature extraction methods, we developed a dictionary of terminology for ease of reference and utility. Our approach achieves 65% accuracy by using Linear Support Vector Classification with tri-gram and without stemmer. Using active learning our system can continuously improve the accuracy with the increased labelled examples provided by the users of the system.

A sentiment analysis system for social media using machine learning techniques: Social enablement

2018 ◽  
Vol 34 (3) ◽  
pp. 569-581 ◽  
Author(s):  
Sujata Rani ◽  
Parteek Kumar
Keyword(s):  
Machine Learning ◽  
Social Media ◽  
Sentiment Analysis ◽  
Media Analysis ◽  
Training Data ◽  
Machine Learning Techniques ◽  
Support Vector ◽  
Analysis Tool ◽  
Data Set ◽  
Learning Techniques

Abstract In this article, an innovative approach to perform the sentiment analysis (SA) has been presented. The proposed system handles the issues of Romanized or abbreviated text and spelling variations in the text to perform the sentiment analysis. The training data set of 3,000 movie reviews and tweets has been manually labeled by native speakers of Hindi in three classes, i.e. positive, negative, and neutral. The system uses WEKA (Waikato Environment for Knowledge Analysis) tool to convert these string data into numerical matrices and applies three machine learning techniques, i.e. Naive Bayes (NB), J48, and support vector machine (SVM). The proposed system has been tested on 100 movie reviews and tweets, and it has been observed that SVM has performed best in comparison to other classifiers, and it has an accuracy of 68% for movie reviews and 82% in case of tweets. The results of the proposed system are very promising and can be used in emerging applications like SA of product reviews and social media analysis. Additionally, the proposed system can be used in other cultural/social benefits like predicting/fighting human riots.

An Incremental Isomap Method for Hyperspectral Dimensionality Reduction and Classification

2021 ◽  
Vol 87 (6) ◽  
pp. 445-455
Author(s):  
Yi Ma ◽  
Zezhong Zheng ◽  
Yutang Ma ◽  
Mingcang Zhu ◽  
Ran Huang ◽  
...  
Keyword(s):  
Manifold Learning ◽  
Nearest Neighbor ◽  
Hyperspectral Image ◽  
Hyperspectral Data ◽  
Training Data ◽  
Support Vector ◽  
Data Sets ◽  
K Nearest Neighbor ◽  
Data Set ◽  
Data Points

Many manifold learning algorithms conduct an eigen vector analysis on a data-similarity matrix with a size of N×N, where N is the number of data points. Thus, the memory complexity of the analysis is no less than O(N2). We pres- ent in this article an incremental manifold learning approach to handle large hyperspectral data sets for land use identification. In our method, the number of dimensions for the high-dimensional hyperspectral-image data set is obtained with the training data set. A local curvature varia- tion algorithm is utilized to sample a subset of data points as landmarks. Then a manifold skeleton is identified based on the landmarks. Our method is validated on three AVIRIS hyperspectral data sets, outperforming the comparison algorithms with a k–nearest-neighbor classifier and achieving the second best performance with support vector machine.

Simple Convolutional-Based Models: Are They Learning the Task or the Data?

2021 ◽  
pp. 1-17
Author(s):  
Luis Sa-Couto ◽  
Andreas Wichert
Keyword(s):  
Neural Networks ◽  
Pattern Recognition ◽  
Training Data ◽  
Model Complexity ◽  
Data Sets ◽  
Simple Task ◽  
Data Set ◽  
Knowing That ◽  
Handwritten Digit ◽  
End To End

Abstract Convolutional neural networks (CNNs) evolved from Fukushima's neocognitron model, which is based on the ideas of Hubel and Wiesel about the early stages of the visual cortex. Unlike other branches of neocognitron-based models, the typical CNN is based on end-to-end supervised learning by backpropagation and removes the focus from built-in invariance mechanisms, using pooling not as a way to tolerate small shifts but as a regularization tool that decreases model complexity. These properties of end-to-end supervision and flexibility of structure allow the typical CNN to become highly tuned to the training data, leading to extremely high accuracies on typical visual pattern recognition data sets. However, in this work, we hypothesize that there is a flip side to this capability, a hidden overfitting. More concretely, a supervised, backpropagation based CNN will outperform a neocognitron/map transformation cascade (MTCCXC) when trained and tested inside the same data set. Yet if we take both models trained and test them on the same task but on another data set (without retraining), the overfitting appears. Other neocognitron descendants like the What-Where model go in a different direction. In these models, learning remains unsupervised, but more structure is added to capture invariance to typical changes. Knowing that, we further hypothesize that if we repeat the same experiments with this model, the lack of supervision may make it worse than the typical CNN inside the same data set, but the added structure will make it generalize even better to another one. To put our hypothesis to the test, we choose the simple task of handwritten digit classification and take two well-known data sets of it: MNIST and ETL-1. To try to make the two data sets as similar as possible, we experiment with several types of preprocessing. However, regardless of the type in question, the results align exactly with expectation.

Exploiting Rules to Enhance Machine Learning in Extracting Information From Multi-Institutional Prostate Pathology Reports

2020 ◽  
pp. 865-874
Author(s):  
Enrico Santus ◽  
Tal Schuster ◽  
Amir M. Tahmasebi ◽  
Clara Li ◽  
Adam Yala ◽  
...  
Keyword(s):  
Machine Learning ◽  
Hybrid Systems ◽  
High Performance ◽  
Feature Model ◽  
Training Data ◽  
Gradient Boosting ◽  
Support Vector ◽  
Data Set ◽  
Extreme Gradient Boosting ◽  
Pathology Reports

PURPOSE Literature on clinical note mining has highlighted the superiority of machine learning (ML) over hand-crafted rules. Nevertheless, most studies assume the availability of large training sets, which is rarely the case. For this reason, in the clinical setting, rules are still common. We suggest 2 methods to leverage the knowledge encoded in pre-existing rules to inform ML decisions and obtain high performance, even with scarce annotations. METHODS We collected 501 prostate pathology reports from 6 American hospitals. Reports were split into 2,711 core segments, annotated with 20 attributes describing the histology, grade, extension, and location of tumors. The data set was split by institutions to generate a cross-institutional evaluation setting. We assessed 4 systems, namely a rule-based approach, an ML model, and 2 hybrid systems integrating the previous methods: a Rule as Feature model and a Classifier Confidence model. Several ML algorithms were tested, including logistic regression (LR), support vector machine (SVM), and eXtreme gradient boosting (XGB). RESULTS When training on data from a single institution, LR lags behind the rules by 3.5% (F1 score: 92.2% v 95.7%). Hybrid models, instead, obtain competitive results, with Classifier Confidence outperforming the rules by +0.5% (96.2%). When a larger amount of data from multiple institutions is used, LR improves by +1.5% over the rules (97.2%), whereas hybrid systems obtain +2.2% for Rule as Feature (97.7%) and +2.6% for Classifier Confidence (98.3%). Replacing LR with SVM or XGB yielded similar performance gains. CONCLUSION We developed methods to use pre-existing handcrafted rules to inform ML algorithms. These hybrid systems obtain better performance than either rules or ML models alone, even when training data are limited.

A Kind of Network Intrusion Detection Method Using Improved Support Vector Machine Based on Ant Colony Algorithm

2012 ◽  
Vol 263-266 ◽  
pp. 2995-2998
Author(s):  
Xiaoqin Zhang ◽  
Guo Jun Jia
Keyword(s):  
Genetic Algorithm ◽  
Support Vector Machine ◽  
Feature Extraction ◽  
Ant Colony Algorithm ◽  
Small Sample ◽  
Ant Colony ◽  
Support Vector ◽  
Algorithm Selection ◽  
Data Set ◽  
Network Intrusion

Support vector machine (SVM) is suitable for the classification problem which is of small sample, nonlinear, high dimension. SVM in data preprocessing phase, often use genetic algorithm for feature extraction, although it can improve the accuracy of classification. But in feature extraction stage the weak directivity of genetic algorithm impact the time and accuracy of the classification. The ant colony algorithm is used in genetic algorithm selection stage, which is better for the data pretreatment, so as to improve the classification speed and accuracy. The experiment in the KDD99 data set shows that this method is feasible.

Sign in / Sign up

Export Citation Format

Share Document