scholarly journals Can Automatic Classification Help to Increase Accuracy in Data Collection?

2017 ◽  
Vol 1 (3) ◽  
pp. 42-58 ◽  
Author(s):  
Frederique Lang ◽  
Diego Chavarro ◽  
Yuxian Liu
Keyword(s):  
Data Collection ◽  
Linear Models ◽  
Data Cleaning ◽  
Automatic Classification ◽  
Machine Learning Algorithms ◽  
Training Data ◽  
Training Dataset ◽  
Support Vector ◽  
Classification Algorithms ◽  
Linear Discriminant

AbstractPurposeThe authors aim at testing the performance of a set of machine learning algorithms that could improve the process of data cleaning when building datasets.Design/methodology/approachThe paper is centered on cleaning datasets gathered from publishers and online resources by the use of specific keywords. In this case, we analyzed data from the Web of Science. The accuracy of various forms of automatic classification was tested here in comparison with manual coding in order to determine their usefulness for data collection and cleaning. We assessed the performance of seven supervised classification algorithms (Support Vector Machine (SVM), Scaled Linear Discriminant Analysis, Lasso and elastic-net regularized generalized linear models, Maximum Entropy, Regression Tree, Boosting, and Random Forest) and analyzed two properties: accuracy and recall. We assessed not only each algorithm individually, but also their combinations through a voting scheme. We also tested the performance of these algorithms with different sizes of training data. When assessing the performance of different combinations, we used an indicator of coverage to account for the agreement and disagreement on classification between algorithms.FindingsWe found that the performance of the algorithms used vary with the size of the sample for training. However, for the classification exercise in this paper the best performing algorithms were SVM and Boosting. The combination of these two algorithms achieved a high agreement on coverage and was highly accurate. This combination performs well with a small training dataset (10%), which may reduce the manual work needed for classification tasks.Research limitationsThe dataset gathered has significantly more records related to the topic of interest compared to unrelated topics. This may affect the performance of some algorithms, especially in their identification of unrelated papers.Practical implicationsAlthough the classification achieved by this means is not completely accurate, the amount of manual coding needed can be greatly reduced by using classification algorithms. This can be of great help when the dataset is big. With the help of accuracy, recall, and coverage measures, it is possible to have an estimation of the error involved in this classification, which could open the possibility of incorporating the use of these algorithms in software specifically designed for data cleaning and classification.Originality/valueWe analyzed the performance of seven algorithms and whether combinations of these algorithms improve accuracy in data collection. Use of these algorithms could reduce time needed for manual data cleaning.

PSIX-15 Assessment of machine learning algorithms for prediction of Aleutian disease in American mink

2021 ◽  
Vol 99 (Supplement_3) ◽  
pp. 264-265
Author(s):  
Duy Ngoc Do ◽  
Guoyu Hu ◽  
Younes Miar
Keyword(s):  
Machine Learning ◽  
Random Forest ◽  
Linear Models ◽  
American Mink ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Training Data ◽  
Enzyme Linked Immunosorbent Assay ◽  
Linear Discriminant ◽  
Machine Learning Classification

Abstract American mink (Neovison vison) is the major source of fur for the fur industries worldwide and Aleutian disease (AD) is causing severe financial losses to the mink industry. Different methods have been used to diagnose the AD in mink, but the combination of several methods can be the most appropriate approach for the selection of AD resilient mink. Iodine agglutination test (IAT) and counterimmunoelectrophoresis (CIEP) methods are commonly employed in test-and-remove strategy; meanwhile, enzyme-linked immunosorbent assay (ELISA) and packed-cell volume (PCV) methods are complementary. However, using multiple methods are expensive; and therefore, hindering the corrected use of AD tests in selection. This research presented the assessments of the AD classification based on machine learning algorithms. The Aleutian disease was tested on 1,830 individuals using these tests in an AD positive mink farm (Canadian Centre for Fur Animal Research, NS, Canada). The accuracy of classification for CIEP was evaluated based on the sex information, and IAT, ELISA and PCV test results implemented in seven machine learning classification algorithms (Random Forest, Artificial Neural Networks, C50Tree, Naive Bayes, Generalized Linear Models, Boost, and Linear Discriminant Analysis) using the Caret package in R. The accuracy of prediction varied among the methods. Overall, the Random Forest was the best-performing algorithm for the current dataset with an accuracy of 0.89 in the training data and 0.94 in the testing data. Our work demonstrated the utility and relative ease of using machine learning algorithms to assess the CIEP information, and consequently reducing the cost of AD tests. However, further works require the inclusion of production and reproduction information in the models and extension of phenotypic collection to increase the accuracy of current methods.

scholarly journals Cumulant Features based Classification of Brain MR Images using ANN and LS-SVM Algorithm

2019 ◽  
Vol 8 (11) ◽  
pp. 4008-4012
Keyword(s):  
Brain Tumour ◽  
Automatic Classification ◽  
Machine Learning Algorithms ◽  
Least Square ◽  
Support Vector ◽  
Discrete Wavelet ◽  
Mr Images ◽  
Mr Image ◽  
Linear Discriminant

Automatic classification of magnetic resonance (MR) brain images using machine learning algorithms has a significant role in clinical diagnosis of brain tumour. The higher order spectra cumulant features are powerful and competent tool for automatic classification. The study proposed an effective cumulant-based features to predict the severity of brain tumour. The study at first stage implicates the one-level classification of 2-D discrete wavelet transform (DWT) of taken brain MR image. The cumulants of every sub-bands are then determined to calculate the primary feature vector. Linear discriminant analysis is adopted to extract the discriminative features derived from the primary ones. A three layer feed-forward artificial neural network (ANN) and least square based support vector machine (LS-SVM) algorithms are considered to compute that the brain MR image is either belongs to normal or to one of seven other diseases (eight-class scenario). Furthermore, in one more classification problem, the input MR image is categorized as normal or abnormal (two-class scenario). The correct classification rate (CCR) of LS-SVM is superior than the ANN algorithm thereby the proposed study with LS-SVM attains higher accuracy rate in both classification scenarios of MR images.

scholarly journals A Comparative Study of Classification Techniques for P300 Speller

2020 ◽  
Vol 9 (7S) ◽  
pp. 102-106
Keyword(s):  
Machine Learning ◽  
Event Related Potential ◽  
Machine Learning Algorithms ◽  
Machine Learning Techniques ◽  
Computer Interface ◽  
Support Vector ◽  
Classification Algorithms ◽  
Linear Discriminant ◽  
P300 Speller ◽  
Learning Techniques

P300 speller in Brain Computer Interface (BCI) allows locked-in or completely paralyzed patients to communicate with humans. To achieve the performance of characterization and increase accuracy, machine learning techniques are used. The study is about an event related potential (ERP) P300 signal detection and classification using various machine learning algorithms. Linear Discriminant Analysis (LDA) and Support Vector Machine (SVM) are used to classify P300 and Non-P300 signal from Electroencephalography (EEG) signal. The performance of the system is evaluated based on f1-score using BCI competition III dataset II. In our system, we used LDA and SVM classification algorithms. Both the classifiers gave 91.0% classification accuracy.

Automatic Classification of Biological Targets in a Tidal Channel Using a Multibeam Sonar

2020 ◽  
Vol 37 (8) ◽  
pp. 1437-1455 ◽  
Author(s):  
Emma Cotter ◽  
Brian Polagye
Keyword(s):  
Real Time ◽  
Automatic Classification ◽  
Machine Learning Algorithms ◽  
Training Data ◽  
Hill Climbing ◽  
Support Vector ◽  
Tidal Channel ◽  
Multibeam Sonar ◽  
Biological Targets

AbstractMultibeam sonars are widely used for environmental monitoring of fauna at marine renewable energy sites. However, they can rapidly accrue vast volumes of data, which poses a challenge for data processing. Here, using data from a deployment in a tidal channel with peak currents of 1–2 m s−1, we demonstrate the data-reduction benefits of real-time automatic classification of targets detected and tracked in multibeam sonar data. First, we evaluate classification capabilities for three machine learning algorithms: random forests, support vector machines, and k-nearest neighbors. For each algorithm, a hill-climbing search optimizes a set of hand-engineered attributes that describe tracked targets. The random forest algorithm is found to be most effective—in postprocessing, discriminating between biological and nonbiological targets with a recall rate of 0.97 and a precision of 0.60. In addition, 89% of biological targets are correctly classified as either seals, diving birds, fish schools, or small targets. Model dependence on the volume of training data is evaluated. Second, a real-time implementation of the model is shown to distinguish between biological targets and nonbiological targets with nearly the same performance as in postprocessing. From this, we make general recommendations for implementing real-time classification of biological targets in multibeam sonar data and the transferability of trained models.

scholarly journals Easyml: Easily Build and Evaluate Machine Learning Models

2017 ◽  
Author(s):  
Woo-Young Ahn ◽  
Paul Hendricks ◽  
Nathaniel Haines
Keyword(s):  
Machine Learning ◽  
Best Practices ◽  
Linear Models ◽  
Learning Algorithm ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Classification Algorithms ◽  
Vector Machines ◽  
Barrier To Entry

AbstractThe easyml (easy machine learning) package lowers the barrier to entry to machine learning and is ideal for undergraduate/graduate students, and practitioners who want to quickly apply machine learning algorithms to their research without having to worry about the best practices of implementing each algorithm. The package provides standardized recipes for regression and classification algorithms in R and Python and implements them in a functional, modular, and extensible framework. This package currently implements recipes for several common machine learning algorithms (e.g., penalized linear models, random forests, and support vector machines) and provides a unified interface to each one. Importantly, users can run and evaluate each machine learning algorithm with a single line of coding. Each recipe is robust, implements best practices specific to each algorithm, and generates a report with details about the model, its performance, as well as journal-quality visualizations. The package’s functional, modular, and extensible framework also allows researchers and more advanced users to easily implement new recipes for other algorithms.

scholarly journals Classification with imperfect training labels

Biometrika ◽  
2020 ◽  
Vol 107 (2) ◽  
pp. 311-330 ◽  
Author(s):  
Timothy I Cannings ◽  
Yingying Fan ◽  
Richard J Samworth
Keyword(s):  
Support Vector Machine ◽  
Discriminant Analysis ◽  
Linear Discriminant Analysis ◽  
General Setting ◽  
Excess Risk ◽  
Training Data ◽  
Training Dataset ◽  
Support Vector ◽  
Nearest Neighbour ◽  
Linear Discriminant

Summary We study the effect of imperfect training data labels on the performance of classification methods. In a general setting, where the probability that an observation in the training dataset is mislabelled may depend on both the feature vector and the true label, we bound the excess risk of an arbitrary classifier trained with imperfect labels in terms of its excess risk for predicting a noisy label. This reveals conditions under which a classifier trained with imperfect labels remains consistent for classifying uncorrupted test data points. Furthermore, under stronger conditions, we derive detailed asymptotic properties for the popular $k$-nearest neighbour, support vector machine and linear discriminant analysis classifiers. One consequence of these results is that the $k$-nearest neighbour and support vector machine classifiers are robust to imperfect training labels, in the sense that the rate of convergence of the excess risk of these classifiers remains unchanged; in fact, our theoretical and empirical results even show that in some cases, imperfect labels may improve the performance of these methods. The linear discriminant analysis classifier is shown to be typically inconsistent in the presence of label noise unless the prior probabilities of the classes are equal. Our theoretical results are supported by a simulation study.

scholarly journals Mie scattering and microparticle-based characterization of heavy metal ions and classification by statistical inference methods

2019 ◽  
Vol 6 (5) ◽  
pp. 190001 ◽  
Author(s):  
Katherine E. Klug ◽  
Christian M. Jennings ◽  
Nicholas Lytal ◽  
Lingling An ◽  
Jeong-Yeol Yoon
Keyword(s):  
Heavy Metal ◽  
Support Vector Machine ◽  
Metal Ions ◽  
Heavy Metal Ions ◽  
Mie Scattering ◽  
Training Data ◽  
Scattering Data ◽  
Support Vector ◽  
Linear Discriminant ◽  
Machine Analysis

A straightforward method for classifying heavy metal ions in water is proposed using statistical classification and clustering techniques from non-specific microparticle scattering data. A set of carboxylated polystyrene microparticles of sizes 0.91, 0.75 and 0.40 µm was mixed with the solutions of nine heavy metal ions and two control cations, and scattering measurements were collected at two angles optimized for scattering from non-aggregated and aggregated particles. Classification of these observations was conducted and compared among several machine learning techniques, including linear discriminant analysis, support vector machine analysis, K-means clustering and K-medians clustering. This study found the highest classification accuracy using the linear discriminant and support vector machine analysis, each reporting high classification rates for heavy metal ions with respect to the model. This may be attributed to moderate correlation between detection angle and particle size. These classification models provide reasonable discrimination between most ion species, with the highest distinction seen for Pb(II), Cd(II), Ni(II) and Co(II), followed by Fe(II) and Fe(III), potentially due to its known sorption with carboxyl groups. The support vector machine analysis was also applied to three different mixture solutions representing leaching from pipes and mine tailings, and showed good correlation with single-species data, specifically with Pb(II) and Ni(II). With more expansive training data and further processing, this method shows promise for low-cost and portable heavy metal identification and sensing.

scholarly journals Drill-Core Mineral Abundance Estimation Using Hyperspectral and High-Resolution Mineralogical Data

2020 ◽  
Vol 12 (7) ◽  
pp. 1218
Author(s):  
Laura Tuşa ◽  
Mahdi Khodadadzadeh ◽  
Cecilia Contreras ◽  
Kasra Rafiezadeh Shahi ◽  
Margret Fuchs ◽  
...  
Keyword(s):  
Machine Learning ◽  
High Resolution ◽  
Ore Deposits ◽  
Machine Learning Algorithms ◽  
Training Data ◽  
Support Vector ◽  
Drill Core ◽  
Data Types ◽  
Mineralogical Characterization ◽  
Core Samples

Due to the extensive drilling performed every year in exploration campaigns for the discovery and evaluation of ore deposits, drill-core mapping is becoming an essential step. While valuable mineralogical information is extracted during core logging by on-site geologists, the process is time consuming and dependent on the observer and individual background. Hyperspectral short-wave infrared (SWIR) data is used in the mining industry as a tool to complement traditional logging techniques and to provide a rapid and non-invasive analytical method for mineralogical characterization. Additionally, Scanning Electron Microscopy-based image analyses using a Mineral Liberation Analyser (SEM-MLA) provide exhaustive high-resolution mineralogical maps, but can only be performed on small areas of the drill-cores. We propose to use machine learning algorithms to combine the two data types and upscale the quantitative SEM-MLA mineralogical data to drill-core scale. This way, quasi-quantitative maps over entire drill-core samples are obtained. Our upscaling approach increases result transparency and reproducibility by employing physical-based data acquisition (hyperspectral imaging) combined with mathematical models (machine learning). The procedure is tested on 5 drill-core samples with varying training data using random forests, support vector machines and neural network regression models. The obtained mineral abundance maps are further used for the extraction of mineralogical parameters such as mineral association.

A survey on prediction of diabetes using classification algorithms

2021 ◽  
Vol 2 (104) ◽  
pp. 77-84
Author(s):  
A. Khanwalkar ◽  
R. Soni
Keyword(s):  
Machine Learning ◽  
Data Collection ◽  
Learning Algorithm ◽  
Algorithm Design ◽  
Machine Learning Algorithms ◽  
Classification Algorithms ◽  
Machine Learning Algorithm ◽  
Collection Method ◽  
Data Collection Method ◽  
Diagnostic Center

Purpose: Diabetes is a chronic disease that pays for a large proportion of the nation's healthcare expenses when people with diabetes want medical care continuously. Several complications will occur if the polymer disorder is not treated and unrecognizable. The prescribed condition leads to a diagnostic center and a doctor's intention. One of the real-world subjects essential is to find the first phase of the polytechnic. In this work, basically a survey that has been analyzed in several parameters within the poly-infected disorder diagnosis. It resembles the classification algorithms of data collection that plays an important role in the data collection method. Automation of polygenic disorder analysis, as well as another machine learning algorithm. Design/methodology/approach: This paper provides extensive surveys of different analogies which have been used for the analysis of medical data, For the purpose of early detection of polygenic disorder. This paper takes into consideration methods such as J48, CART, SVMs and KNN square, this paper also conducts a formal surveying of all the studies, and provides a conclusion at the end. Findings: This surveying has been analyzed on several parameters within the poly-infected disorder diagnosis. It resembles that the classification algorithms of data collection plays an important role in the data collection method in Automation of polygenic disorder analysis, as well as another machine learning algorithm. Practical implications: This paper will help future researchers in the field of Healthcare, specifically in the domain of diabetes, to understand differences between classification algorithms. Originality/value: This paper will help in comparing machine learning algorithms by going through results and selecting the appropriate approach based on requirements.

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.

Sign in / Sign up

Export Citation Format

Share Document