scholarly journals A novel artificial intelligence-based approach for identification of deoxynucleotide aptamers

2021 ◽  
Vol 17 (8) ◽  
pp. e1009247
Author(s):  
Frances L. Heredia ◽  
Abiel Roche-Lima ◽  
Elsie I. Parés-Matos
Keyword(s):  
Artificial Intelligence ◽  
Machine Learning ◽  
Support Vector Machines ◽  
Dna Binding ◽  
Dna Sequences ◽  
Support Vector ◽  
Sequence Information ◽  
Dna Aptamers ◽  
Vector Machines ◽  
Selection Of

The selection of a DNA aptamer through the Systematic Evolution of Ligands by EXponential enrichment (SELEX) method involves multiple binding steps, in which a target and a library of randomized DNA sequences are mixed for selection of a single, nucleotide-specific molecule. Usually, 10 to 20 steps are required for SELEX to be completed. Throughout this process it is necessary to discriminate between true DNA aptamers and unspecified DNA-binding sequences. Thus, a novel machine learning-based approach was developed to support and simplify the early steps of the SELEX process, to help discriminate binding between DNA aptamers from those unspecified targets of DNA-binding sequences. An Artificial Intelligence (AI) approach to identify aptamers were implemented based on Natural Language Processing (NLP) and Machine Learning (ML). NLP method (CountVectorizer) was used to extract information from the nucleotide sequences. Four ML algorithms (Logistic Regression, Decision Tree, Gaussian Naïve Bayes, Support Vector Machines) were trained using data from the NLP method along with sequence information. The best performing model was Support Vector Machines because it had the best ability to discriminate between positive and negative classes. In our model, an Accuracy (A) of 0.995, the fraction of samples that the model correctly classified, and an Area Under the Receiving Operating Curve (AUROC) of 0.998, the degree by which a model is capable of distinguishing between classes, were observed. The developed AI approach is useful to identify potential DNA aptamers to reduce the amount of rounds in a SELEX selection. This new approach could be applied in the design of DNA libraries and result in a more efficient and faster process for DNA aptamers to be chosen during SELEX.

scholarly journals Accuracy test in identifying the splice site type of DNA sequences by using probabilistic neural networks and support vector machines

2014 ◽  
Vol 1 (1) ◽  
Author(s):  
Djati Kerami
Keyword(s):  
Machine Learning ◽  
Neural Networks ◽  
Support Vector Machines ◽  
Splice Site ◽  
Dna Sequences ◽  
Support Vector ◽  
Probabilistic Neural Networks ◽  
Application Problem ◽  
Vector Machines ◽  
Accuracy Level

It has been known that Probabilistic Neural Networks as machine learning is very fast in it’s computation time and give a better accuracy comparing to another type of neural networks, on solving a real-world application problem. In the recent years, Support Vector Machines has become a popular model over other machine learning. It can be analyzed theoretically and can achieve a good performance at same time. This paper will describe the use of those machines learning to solve pattern recognition problems with a preliminary case study in detecting the type of splice site on the DNA sequences, particularity on the accuracy level. The results obtained show that Support Vector Machines have a good accuracy level about 95 % comparing to Probabilistic Neural Networks with 92 % approximately.

scholarly journals A Hybrid Barnacles Mating Optimizer Algorithm With Support Vector Machines for Gene Selection of Microarray Cancer Classification

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 64895-64905
Author(s):  
Essam H. Houssein ◽  
Diaa Salama Abdelminaam ◽  
Hager N. Hassan ◽  
Mustafa M. Al-Sayed ◽  
Emad Nabil
Keyword(s):  
Support Vector Machines ◽  
Gene Selection ◽  
Cancer Classification ◽  
Support Vector ◽  
Vector Machines ◽  
Selection Of

scholarly journals Research on Parallel Support Vector Machine Based on Spark Big Data Platform

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Yao Huimin
Keyword(s):  
Machine Learning ◽  
Support Vector Machine ◽  
Big Data ◽  
Support Vector Machines ◽  
Cross Validation ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Lambda Architecture ◽  
Vector Machines ◽  
Data Platform

With the development of cloud computing and distributed cluster technology, the concept of big data has been expanded and extended in terms of capacity and value, and machine learning technology has also received unprecedented attention in recent years. Traditional machine learning algorithms cannot solve the problem of effective parallelization, so a parallelization support vector machine based on Spark big data platform is proposed. Firstly, the big data platform is designed with Lambda architecture, which is divided into three layers: Batch Layer, Serving Layer, and Speed Layer. Secondly, in order to improve the training efficiency of support vector machines on large-scale data, when merging two support vector machines, the “special points” other than support vectors are considered, that is, the points where the nonsupport vectors in one subset violate the training results of the other subset, and a cross-validation merging algorithm is proposed. Then, a parallelized support vector machine based on cross-validation is proposed, and the parallelization process of the support vector machine is realized on the Spark platform. Finally, experiments on different datasets verify the effectiveness and stability of the proposed method. Experimental results show that the proposed parallelized support vector machine has outstanding performance in speed-up ratio, training time, and prediction accuracy.

scholarly journals Impacts of multicollinearity on CAPT modalities: An heterogeneous machine learning framework for computer-assisted French phoneme pronunciation training

PLoS ONE ◽  
2021 ◽  
Vol 16 (10) ◽  
pp. e0257901
Author(s):  
Yanjing Bi ◽  
Chao Li ◽  
Yannick Benezeth ◽  
Fan Yang
Keyword(s):  
Machine Learning ◽  
Neural Networks ◽  
Support Vector Machines ◽  
Partial Least Square ◽  
Least Square ◽  
Support Vector ◽  
Computer Assisted ◽  
Long Distance ◽  
Relationship Analysis ◽  
Vector Machines

Phoneme pronunciations are usually considered as basic skills for learning a foreign language. Practicing the pronunciations in a computer-assisted way is helpful in a self-directed or long-distance learning environment. Recent researches indicate that machine learning is a promising method to build high-performance computer-assisted pronunciation training modalities. Many data-driven classifying models, such as support vector machines, back-propagation networks, deep neural networks and convolutional neural networks, are increasingly widely used for it. Yet, the acoustic waveforms of phoneme are essentially modulated from the base vibrations of vocal cords, and this fact somehow makes the predictors collinear, distorting the classifying models. A commonly-used solution to address this issue is to suppressing the collinearity of predictors via partial least square regressing algorithm. It allows to obtain high-quality predictor weighting results via predictor relationship analysis. However, as a linear regressor, the classifiers of this type possess very simple topology structures, constraining the universality of the regressors. For this issue, this paper presents an heterogeneous phoneme recognition framework which can further benefit the phoneme pronunciation diagnostic tasks by combining the partial least square with support vector machines. A French phoneme data set containing 4830 samples is established for the evaluation experiments. The experiments of this paper demonstrates that the new method improves the accuracy performance of the phoneme classifiers by 0.21 − 8.47% comparing to state-of-the-arts with different data training data density.

Combination with Machine Learning Algorithms for the Classification in E-Bussiness

2011 ◽  
Vol 230-232 ◽  
pp. 625-628
Author(s):  
Lei Shi ◽  
Xin Ming Ma ◽  
Xiao Hong Hu
Keyword(s):  
Machine Learning ◽  
Support Vector Machines ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Machine Learning Algorithms ◽  
Classification Model ◽  
Support Vector ◽  
Mathematical Tool ◽  
Vector Machines

E-bussiness has grown rapidly in the last decade and massive amount of data on customer purchases, browsing pattern and preferences has been generated. Classification of electronic data plays a pivotal role to mine the valuable information and thus has become one of the most important applications of E-bussiness. Support Vector Machines are popular and powerful machine learning techniques, and they offer state-of-the-art performance. Rough set theory is a formal mathematical tool to deal with incomplete or imprecise information and one of its important applications is feature selection. In this paper, rough set theory and support vector machines are combined to construct a classification model to classify the data of E-bussiness effectively.

Sign in / Sign up

Export Citation Format

Share Document