期刊文献+
共找到6,747篇文章
< 1 2 250 >
每页显示 20 50 100
Prediction of Solar Irradiation Using Quantum Support Vector Machine Learning Algorithm
1
作者 Makhamisa Senekane Benedict Molibeli Taele 《Smart Grid and Renewable Energy》 2016年第12期293-301,共9页
Classical machine learning, which is at the intersection of artificial intelligence and statistics, investigates and formulates algorithms which can be used to discover patterns in the given data and also make some fo... Classical machine learning, which is at the intersection of artificial intelligence and statistics, investigates and formulates algorithms which can be used to discover patterns in the given data and also make some forecasts based on the given data. Classical machine learning has its quantum part, which is known as quantum machine learning (QML). QML, which is a field of quantum computing, uses some of the quantum mechanical principles and concepts which include superposition, entanglement and quantum adiabatic theorem to assess the data and make some forecasts based on the data. At the present moment, research in QML has taken two main approaches. The first approach involves implementing the computationally expensive subroutines of classical machine learning algorithms on a quantum computer. The second approach concerns using classical machine learning algorithms on a quantum information, to speed up performance of the algorithms. The work presented in this manuscript proposes a quantum support vector algorithm that can be used to forecast solar irradiation. The novelty of this work is in using quantum mechanical principles for application in machine learning. Python programming language was used to simulate the performance of the proposed algorithm on a classical computer. Simulation results that were obtained show the usefulness of this algorithm for predicting solar irradiation. 展开更多
关键词 QUANTUM Quantum machine learning machine learning support vector machine Quantum support vector machine ENERGY Solar Irradiation
在线阅读 下载PDF
Constructing a prediction model for delayed wound healing after gastric cancer radical surgery based on three machine learning algorithms
2
作者 Yan An Yin-Gui Sun +3 位作者 Shuo Feng Yun-Sheng Wang Yuan-Yuan Chen Jun Jiang 《World Journal of Gastrointestinal Oncology》 2025年第10期269-279,共11页
BACKGROUND Delayed wound healing is a common clinical complication following gastric cancer radical surgery,adversely affecting patient prognosis.With advances in artificial intelligence,machine learning offers a prom... BACKGROUND Delayed wound healing is a common clinical complication following gastric cancer radical surgery,adversely affecting patient prognosis.With advances in artificial intelligence,machine learning offers a promising approach for developing predictive models that can identify high-risk patients and support early clinical intervention.AIM To construct machine learning-based risk prediction models for delayed wound healing after gastric cancer surgery to support clinical decision-making.METHODS We reviewed a total of 514 patients who underwent gastric cancer radical surgery under general anesthesia from January 1,2014 to December 30,2023.Seventy percent of the dataset was selected as the training set and 30%as the validation set.Decision trees,support vector machines,and logistic regression were used to construct a risk prediction model.The performance of the model was evaluated using accuracy,recall,precision,F1 index,and area under the receiver operating characteristic curve and decision curve.RESULTS This study included five variables:Sex,elderly,duration of abdominal drainage,preoperative white blood cell(WBC)count,and absolute value of neutrophils.These variables were selected based on their clinical relevance and statistical significance in predicting delayed wound healing.The results showed that the decision tree model outperformed the logistic regression and support vector machine models in both the training and validation sets.Specifically,the decision tree model achieved higher accuracy,F1 index,recall,and area under the curve(AUC)values.The support vector machine model also demonstrated better performance than logistic regression,with higher accuracy,recall,and F1 index,but a slightly lower AUC.The key variables of sex,elderly,duration of abdominal drainage,preoperative WBC count,and absolute value of neutrophils were found to be strong predictors of delayed wound healing.Patients with longer duration of abdominal drainage had a significantly higher risk of delayed wound healing,with a risk ratio of 1.579 compared to those with shorter duration of abdominal drainage.Similarly,preoperative WBC count,sex,elderly,and absolute value of neutrophils were associated with a higher risk of delayed wound healing,highlighting the importance of these variables in the model.CONCLUSION The model is able to identify high-risk patients based on sex,elderly,duration of abdominal drainage,preoperative WBC count,and absolute value of neutrophils can provide valuable insights for clinical decision-making. 展开更多
关键词 machine learning Logistic regression support vector machine Decision tree Delayed healing Prediction model Gastric cancer
暂未订购
Clastic facies classification using machine learning-based algorithms: A case study from Rawat Basin, Sudan
3
作者 Anas Mohamed Abaker Babai Olugbenga Ajayi Ehinola +1 位作者 Omer.I.M.Fadul Abul Gebbayin Mohammed Abdalla Elsharif Ibrahim 《Energy Geoscience》 2025年第1期7-23,共17页
Machine learning techniques and a dataset of five wells from the Rawat oilfield in Sudan containing 93,925 samples per feature(seven well logs and one facies log) were used to classify four facies. Data preprocessing ... Machine learning techniques and a dataset of five wells from the Rawat oilfield in Sudan containing 93,925 samples per feature(seven well logs and one facies log) were used to classify four facies. Data preprocessing and preparation involve two processes: data cleaning and feature scaling. Several machine learning algorithms, including Linear Regression(LR), Decision Tree(DT), Support Vector Machine(SVM),Random Forest(RF), and Gradient Boosting(GB) for classification, were tested using different iterations and various combinations of features and parameters. The support vector radial kernel training model achieved an accuracy of 72.49% without grid search and 64.02% with grid search, while the blind-well test scores were 71.01% and 69.67%, respectively. The Decision Tree(DT) Hyperparameter Optimization model showed an accuracy of 64.15% for training and 67.45% for testing. In comparison, the Decision Tree coupled with grid search yielded better results, with a training score of 69.91% and a testing score of67.89%. The model's validation was carried out using the blind well validation approach, which achieved an accuracy of 69.81%. Three algorithms were used to generate the gradient-boosting model. During training, the Gradient Boosting classifier achieved an accuracy score of 71.57%, and during testing, it achieved 69.89%. The Grid Search model achieved a higher accuracy score of 72.14% during testing. The Extreme Gradient Boosting model had the lowest accuracy score, with only 66.13% for training and66.12% for testing. For validation, the Gradient Boosting(GB) classifier model achieved an accuracy score of 75.41% on the blind well test, while the Gradient Boosting with Grid Search achieved an accuracy score of 71.36%. The Enhanced Random Forest and Random Forest with Bagging algorithms were the most effective, with validation accuracies of 78.30% and 79.18%, respectively. However, the Random Forest and Random Forest with Grid Search models displayed significant variance between their training and testing scores, indicating the potential for overfitting. Random Forest(RF) and Gradient Boosting(GB) are highly effective for facies classification because they handle complex relationships and provide high predictive accuracy. The choice between the two depends on specific project requirements, including interpretability, computational resources, and data nature. 展开更多
关键词 machine learning Facies classification Gradient Boosting(GB) support vector Classifier(SVC) Random Forest(RF) Decision Tree(DT)
在线阅读 下载PDF
Forecasting Flowering and Maturity Times of Barley Using Six Machine Learning Algorithms 被引量:1
4
作者 Mingyuan Cheng Mingchu Zhang 《Journal of Agricultural Science and Technology(B)》 2019年第6期373-391,共19页
Interior Alaska has a short growing season of 110 d.The knowledge of timings of crop flowering and maturity will provide the information for the agricultural decision making.In this study,six machine learning algorith... Interior Alaska has a short growing season of 110 d.The knowledge of timings of crop flowering and maturity will provide the information for the agricultural decision making.In this study,six machine learning algorithms,namely Linear Discriminant Analysis(LDA),Support Vector Machines(SVMs),k-nearest neighbor(kNN),Naïve Bayes(NB),Recursive Partitioning and Regression Trees(RPART),and Random Forest(RF),were selected to forecast the timings of barley flowering and maturity based on the Alaska Crop Datasets and climate data from 1991 to 2016 in Fairbanks,Alaska.Among 32 models fit to forecast flowering time,two from LDA,12 from SVMs,four from NB,three from RF outperformed models from other algorithms with the highest accuracy.Models from kNN performed worst to forecast flowering time.Among 32 models fit to forecast maturity time,two models from LDA outperformed the models from other algorithms.Models from kNN and RPART performed worst to forecast maturity time.Models from machine learning methods also provided a variable importance explanation.In this study,four out of six algorithms gave the same variable importance order.Sowing date was the most important variable to forecast flowering but less important variable to forecast maturity.The daily maximum temperature may be more important than daily minimum temperature to fit flowering models while daily minimum temperature may be more important than daily maximum temperature to fit maturity models.The results indicate that models from machine learning provide a promising technique in forecasting the timings of flowering and maturity of barley. 展开更多
关键词 machine learning flowering and maturity Linear Discriminant Analysis support vector machines k-nearest neighbor Naïve Bayes recursive partitioning regression trees Random Forest
在线阅读 下载PDF
Machine Learning Algorithms and Their Application to Ore Reserve Estimation of Sparse and Imprecise Data 被引量:2
5
作者 Sridhar Dutta Sukumar Bandopadhyay +1 位作者 Rajive Ganguli Debasmita Misra 《Journal of Intelligent Learning Systems and Applications》 2010年第2期86-96,共11页
Traditional geostatistical estimation techniques have been used predominantly by the mining industry for ore reserve estimation. Determination of mineral reserve has posed considerable challenge to mining engineers du... Traditional geostatistical estimation techniques have been used predominantly by the mining industry for ore reserve estimation. Determination of mineral reserve has posed considerable challenge to mining engineers due to the geological complexities of ore body formation. Extensive research over the years has resulted in the development of several state-of-the-art methods for predictive spatial mapping, which could be used for ore reserve estimation;and recent advances in the use of machine learning algorithms (MLA) have provided a new approach for solving the prob-lem of ore reserve estimation. The focus of the present study was on the use of two MLA for estimating ore reserve: namely, neural networks (NN) and support vector machines (SVM). Application of MLA and the various issues involved with using them for reserve estimation have been elaborated with the help of a complex drill-hole dataset that exhibits the typical properties of sparseness and impreciseness that might be associated with a mining dataset. To investigate the accuracy and applicability of MLA for ore reserve estimation, the generalization ability of NN and SVM was compared with the geostatistical ordinary kriging (OK) method. 展开更多
关键词 machine learning algorithmS Neural Networks support vector machine GENETIC algorithmS Supervised
暂未订购
Comparison of Different Machine Learning Algorithms for the Prediction of Coronary Artery Disease
6
作者 Imran Chowdhury Dipto Tanzila Islam +1 位作者 H M Mostafizur Rahman Md Ashiqur Rahman 《Journal of Data Analysis and Information Processing》 2020年第2期41-68,共28页
Coronary Artery Disease (CAD) is the leading cause of mortality worldwide. It is a complex heart disease that is associated with numerous risk factors and a variety of Symptoms. During the past decade, Coronary Artery... Coronary Artery Disease (CAD) is the leading cause of mortality worldwide. It is a complex heart disease that is associated with numerous risk factors and a variety of Symptoms. During the past decade, Coronary Artery Disease (CAD) has undergone a remarkable evolution. The purpose of this research is to build a prototype system using different Machine Learning Algorithms (models) and compare their performance to identify a suitable model. This paper explores three most commonly used Machine Learning Algorithms named as Logistic Regression, Support Vector Machine and Artificial Neural Network. To conduct this research, a clinical dataset has been used. To evaluate the performance, different evaluation methods have been used such as Confusion Matrix, Stratified K-fold Cross Validation, Accuracy, AUC and ROC. To validate the results, the accuracy and AUC scores have been validated using the K-Fold Cross-validation technique. The dataset contains class imbalance, so the SMOTE Algorithm has been used to balance the dataset and the performance analysis has been carried out on both sets of data. The results show that accuracy scores of all the models have been increased while training the balanced dataset. Overall, Artificial Neural Network has the highest accuracy whereas Logistic Regression has the least accurate among the trained Algorithms. 展开更多
关键词 CORONARY ARTERY Disease machine learning LOGISTIC Regression support vector machine Artificial Neural Network
暂未订购
Predicting Credit Card Transaction Fraud Using Machine Learning Algorithms
7
作者 Jiaxin Gao Zirui Zhou +2 位作者 Jiangshan Ai Bingxin Xia Stephen Coggeshall 《Journal of Intelligent Learning Systems and Applications》 2019年第3期33-63,共31页
Credit card fraud is a wide-ranging issue for financial institutions, involving theft and fraud committed using a payment card. In this paper, we explore the application of linear and nonlinear statistical modeling an... Credit card fraud is a wide-ranging issue for financial institutions, involving theft and fraud committed using a payment card. In this paper, we explore the application of linear and nonlinear statistical modeling and machine learning models on real credit card transaction data. The models built are supervised fraud models that attempt to identify which transactions are most likely fraudulent. We discuss the processes of data exploration, data cleaning, variable creation, feature selection, model algorithms, and results. Five different supervised models are explored and compared including logistic regression, neural networks, random forest, boosted tree and support vector machines. The boosted tree model shows the best fraud detection result (FDR = 49.83%) for this particular data set. The resulting model can be utilized in a credit card fraud detection system. A similar model development process can be performed in related business domains such as insurance and telecommunications, to avoid or detect fraudulent activity. 展开更多
关键词 CREDIT CARD FRAUD machine learning algorithms LOGISTIC Regression Neural Networks Random FOREST Boosted Tree support vector machineS
在线阅读 下载PDF
Analysing Effectiveness of Sentiments in Social Media Data Using Machine Learning Techniques
8
作者 Thambusamy Velmurugan Mohandas Archana Ajith Singh Nongmaithem 《Journal of Computer and Communications》 2025年第1期136-151,共16页
Every second, a large volume of useful data is created in social media about the various kind of online purchases and in another forms of reviews. Particularly, purchased products review data is enormously growing in ... Every second, a large volume of useful data is created in social media about the various kind of online purchases and in another forms of reviews. Particularly, purchased products review data is enormously growing in different database repositories every day. Most of the review data are useful to new customers for theier further purchases as well as existing companies to view customers feedback about various products. Data Mining and Machine Leaning techniques are familiar to analyse such kind of data to visualise and know the potential use of the purchased items through online. The customers are making quality of products through their sentiments about the purchased items from different online companies. In this research work, it is analysed sentiments of Headphone review data, which is collected from online repositories. For the analysis of Headphone review data, some of the Machine Learning techniques like Support Vector Machines, Naive Bayes, Decision Trees and Random Forest Algorithms and a Hybrid method are applied to find the quality via the customers’ sentiments. The accuracy and performance of the taken algorithms are also analysed based on the three types of sentiments such as positive, negative and neutral. 展开更多
关键词 support vector machine Random Forest algorithm Naive Bayes algorithm machine learning Techniques Decision Tree algorithm
在线阅读 下载PDF
Feature Extraction of Stored-grain Insects Based on Ant Colony Optimization and Support Vector Machine Algorithm 被引量:1
9
作者 胡玉霞 张红涛 +1 位作者 罗康 张恒源 《Agricultural Science & Technology》 CAS 2012年第2期457-459,共3页
[Objective] The aim was to study the feature extraction of stored-grain insects based on ant colony optimization and support vector machine algorithm, and to explore the feasibility of the feature extraction of stored... [Objective] The aim was to study the feature extraction of stored-grain insects based on ant colony optimization and support vector machine algorithm, and to explore the feasibility of the feature extraction of stored-grain insects. [Method] Through the analysis of feature extraction in the image recognition of the stored-grain insects, the recognition accuracy of the cross-validation training model in support vector machine (SVM) algorithm was taken as an important factor of the evaluation principle of feature extraction of stored-grain insects. The ant colony optimization (ACO) algorithm was applied to the automatic feature extraction of stored-grain insects. [Result] The algorithm extracted the optimal feature subspace of seven features from the 17 morphological features, including area and perimeter. The ninety image samples of the stored-grain insects were automatically recognized by the optimized SVM classifier, and the recognition accuracy was over 95%. [Conclusion] The experiment shows that the application of ant colony optimization to the feature extraction of grain insects is practical and feasible. 展开更多
关键词 Stored-grain insects Ant colony optimization algorithm support vector machine Feature extraction RECOGNITION
在线阅读 下载PDF
Incremental support vector machine algorithm based on multi-kernel learning 被引量:7
10
作者 Zhiyu Li Junfeng Zhang Shousong Hu 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2011年第4期702-706,共5页
A new incremental support vector machine (SVM) algorithm is proposed which is based on multiple kernel learning. Through introducing multiple kernel learning into the SVM incremental learning, large scale data set l... A new incremental support vector machine (SVM) algorithm is proposed which is based on multiple kernel learning. Through introducing multiple kernel learning into the SVM incremental learning, large scale data set learning problem can be solved effectively. Furthermore, different punishments are adopted in allusion to the training subset and the acquired support vectors, which may help to improve the performance of SVM. Simulation results indicate that the proposed algorithm can not only solve the model selection problem in SVM incremental learning, but also improve the classification or prediction precision. 展开更多
关键词 support vector machine (SVM) incremental learning multiple kernel learning (MKL).
在线阅读 下载PDF
A Hierarchical Clustering and Fixed-Layer Local Learning Based Support Vector Machine Algorithm for Large Scale Classification Problems 被引量:1
11
作者 吴广潮 肖法镇 +4 位作者 奚建清 杨晓伟 何丽芳 吕浩然 刘小兰 《Journal of Donghua University(English Edition)》 EI CAS 2012年第1期46-50,共5页
It is a challenging topic to develop an efficient algorithm for large scale classification problems in many applications of machine learning. In this paper, a hierarchical clustering and fixed- layer local learning (... It is a challenging topic to develop an efficient algorithm for large scale classification problems in many applications of machine learning. In this paper, a hierarchical clustering and fixed- layer local learning (HCFLL) based support vector machine(SVM) algorithm is proposed to deal with this problem. Firstly, HCFLL hierarchically dusters a given dataset into a modified clustering feature tree based on the ideas of unsupervised clustering and supervised clustering. Then it locally trains SVM on each labeled subtree at a fixed-layer of the tree. The experimental results show that compared with the existing popular algorithms such as core vector machine and decision.tree support vector machine, HCFLL can significantly improve the training and testing speeds with comparable testing accuracy. 展开更多
关键词 hierarchical clustering local learning large scale classification support vector rnachine( SVM
在线阅读 下载PDF
Fuzzy least squares support vector machine soft measurement model based on adaptive mutative scale chaos immune algorithm 被引量:8
12
作者 王涛生 左红艳 《Journal of Central South University》 SCIE EI CAS 2014年第2期593-599,共7页
In order to enhance measuring precision of the real complex electromechanical system,complex industrial system and complex ecological & management system with characteristics of multi-variable,non-liner,strong cou... In order to enhance measuring precision of the real complex electromechanical system,complex industrial system and complex ecological & management system with characteristics of multi-variable,non-liner,strong coupling and large time-delay,in terms of the fuzzy character of this real complex system,a fuzzy least squares support vector machine(FLS-SVM) soft measurement model was established and its parameters were optimized by using adaptive mutative scale chaos immune algorithm.The simulation results reveal that fuzzy least squares support vector machines soft measurement model is of better approximation accuracy and robustness.And application results show that the relative errors of the soft measurement model are less than 3.34%. 展开更多
关键词 CHAOS immune algorithm FUZZY support vector machine
在线阅读 下载PDF
Stability prediction of hard rock pillar using support vector machine optimized by three metaheuristic algorithms 被引量:9
13
作者 Chuanqi Li Jian Zhou +1 位作者 Kun Du Daniel Dias 《International Journal of Mining Science and Technology》 SCIE EI CAS CSCD 2023年第8期1019-1036,共18页
Hard rock pillar is one of the important structures in engineering design and excavation in underground mines.Accurate and convenient prediction of pillar stability is of great significance for underground space safet... Hard rock pillar is one of the important structures in engineering design and excavation in underground mines.Accurate and convenient prediction of pillar stability is of great significance for underground space safety.This paper aims to develop hybrid support vector machine(SVM)models improved by three metaheuristic algorithms known as grey wolf optimizer(GWO),whale optimization algorithm(WOA)and sparrow search algorithm(SSA)for predicting the hard rock pillar stability.An integrated dataset containing 306 hard rock pillars was established to generate hybrid SVM models.Five parameters including pillar height,pillar width,ratio of pillar width to height,uniaxial compressive strength and pillar stress were set as input parameters.Two global indices,three local indices and the receiver operating characteristic(ROC)curve with the area under the ROC curve(AUC)were utilized to evaluate all hybrid models’performance.The results confirmed that the SSA-SVM model is the best prediction model with the highest values of all global indices and local indices.Nevertheless,the performance of the SSASVM model for predicting the unstable pillar(AUC:0.899)is not as good as those for stable(AUC:0.975)and failed pillars(AUC:0.990).To verify the effectiveness of the proposed models,5 field cases were investigated in a metal mine and other 5 cases were collected from several published works.The validation results indicated that the SSA-SVM model obtained a considerable accuracy,which means that the combination of SVM and metaheuristic algorithms is a feasible approach to predict the pillar stability. 展开更多
关键词 Underground pillar stability Hard rock support vector machine Metaheuristic algorithms
在线阅读 下载PDF
Semi-supervised least squares support vector machine algorithm:application to offshore oil reservoir 被引量:1
14
作者 罗伟平 李洪奇 石宁 《Applied Geophysics》 SCIE CSCD 2016年第2期406-415,421,共11页
At the early stages of deep-water oil exploration and development, fewer and further apart wells are drilled than in onshore oilfields. Supervised least squares support vector machine algorithms are used to predict th... At the early stages of deep-water oil exploration and development, fewer and further apart wells are drilled than in onshore oilfields. Supervised least squares support vector machine algorithms are used to predict the reservoir parameters but the prediction accuracy is low. We combined the least squares support vector machine (LSSVM) algorithm with semi-supervised learning and established a semi-supervised regression model, which we call the semi-supervised least squares support vector machine (SLSSVM) model. The iterative matrix inversion is also introduced to improve the training ability and training time of the model. We use the UCI data to test the generalization of a semi-supervised and a supervised LSSVM models. The test results suggest that the generalization performance of the LSSVM model greatly improves and with decreasing training samples the generalization performance is better. Moreover, for small-sample models, the SLSSVM method has higher precision than the semi-supervised K-nearest neighbor (SKNN) method. The new semi- supervised LSSVM algorithm was used to predict the distribution of porosity and sandstone in the Jingzhou study area. 展开更多
关键词 Semi-supervised learning least squares support vector machine seismic attributes reservoir prediction
在线阅读 下载PDF
Time series online prediction algorithm based on least squares support vector machine 被引量:8
15
作者 吴琼 刘文颖 杨以涵 《Journal of Central South University of Technology》 EI 2007年第3期442-446,共5页
Deficiencies of applying the traditional least squares support vector machine (LS-SVM) to time series online prediction were specified. According to the kernel function matrix's property and using the recursive cal... Deficiencies of applying the traditional least squares support vector machine (LS-SVM) to time series online prediction were specified. According to the kernel function matrix's property and using the recursive calculation of block matrix, a new time series online prediction algorithm based on improved LS-SVM was proposed. The historical training results were fully utilized and the computing speed of LS-SVM was enhanced. Then, the improved algorithm was applied to timc series online prediction. Based on the operational data provided by the Northwest Power Grid of China, the method was used in the transient stability prediction of electric power system. The results show that, compared with the calculation time of the traditional LS-SVM(75 1 600 ms), that of the proposed method in different time windows is 40-60 ms, proposed method is above 0.8. So the improved method is online prediction. and the prediction accuracy(normalized root mean squared error) of the better than the traditional LS-SVM and more suitable for time series online prediction. 展开更多
关键词 time series prediction machine learning support vector machine statistical learning theory
在线阅读 下载PDF
Basic Tenets of Classification Algorithms K-Nearest-Neighbor, Support Vector Machine, Random Forest and Neural Network: A Review 被引量:15
16
作者 Ernest Yeboah Boateng Joseph Otoo Daniel A. Abaye 《Journal of Data Analysis and Information Processing》 2020年第4期341-357,共17页
In this paper, sixty-eight research articles published between 2000 and 2017 as well as textbooks which employed four classification algorithms: K-Nearest-Neighbor (KNN), Support Vector Machines (SVM), Random Forest (... In this paper, sixty-eight research articles published between 2000 and 2017 as well as textbooks which employed four classification algorithms: K-Nearest-Neighbor (KNN), Support Vector Machines (SVM), Random Forest (RF) and Neural Network (NN) as the main statistical tools were reviewed. The aim was to examine and compare these nonparametric classification methods on the following attributes: robustness to training data, sensitivity to changes, data fitting, stability, ability to handle large data sizes, sensitivity to noise, time invested in parameter tuning, and accuracy. The performances, strengths and shortcomings of each of the algorithms were examined, and finally, a conclusion was arrived at on which one has higher performance. It was evident from the literature reviewed that RF is too sensitive to small changes in the training dataset and is occasionally unstable and tends to overfit in the model. KNN is easy to implement and understand but has a major drawback of becoming significantly slow as the size of the data in use grows, while the ideal value of K for the KNN classifier is difficult to set. SVM and RF are insensitive to noise or overtraining, which shows their ability in dealing with unbalanced data. Larger input datasets will lengthen classification times for NN and KNN more than for SVM and RF. Among these nonparametric classification methods, NN has the potential to become a more widely used classification algorithm, but because of their time-consuming parameter tuning procedure, high level of complexity in computational processing, the numerous types of NN architectures to choose from and the high number of algorithms used for training, most researchers recommend SVM and RF as easier and wieldy used methods which repeatedly achieve results with high accuracies and are often faster to implement. 展开更多
关键词 Classification algorithms NON-PARAMETRIC K-Nearest-Neighbor Neural Networks Random Forest support vector machines
在线阅读 下载PDF
Using Audiometric Data to Weigh and Prioritize Factors that Affect Workers’ Hearing Loss through Support Vector Machine (SVM) Algorithm 被引量:3
17
作者 Hossein ElahiShirvan MohammadReza Ghotbi-Ravandi +1 位作者 Sajad Zare Mostafa Ghazizadeh Ahsaee 《Sound & Vibration》 EI 2020年第2期99-112,共14页
Workers’exposure to excessive noise is a big universal work-related challenges.One of the major consequences of exposure to noise is permanent or transient hearing loss.The current study sought to utilize audiometric... Workers’exposure to excessive noise is a big universal work-related challenges.One of the major consequences of exposure to noise is permanent or transient hearing loss.The current study sought to utilize audiometric data to weigh and prioritize the factors affecting workers’hearing loss based using the Support Vector Machine(SVM)algorithm.This cross sectional-descriptive study was conducted in 2017 in a mining industry in southeast Iran.The participating workers(n=150)were divided into three groups of 50 based on the sound pressure level to which they were exposed(two experimental groups and one control group).Audiometric tests were carried out for all members of each group.The study generally entailed the following steps:(1)selecting predicting variables to weigh and prioritize factors affecting hearing loss;(2)conducting audiometric tests and assessing permanent hearing loss in each ear and then evaluating total hearing loss;(3)categorizing different types of hearing loss;(4)weighing and prioritizing factors that affect hearing loss based on the SVM algorithm;and(5)assessing the error rate and accuracy of the models.The collected data were fed into SPSS 18,followed by conducting linear regression and paired samples t-test.It was revealed that,in the first model(SPL<70 dBA),the frequency of 8 KHz had the greatest impact(with a weight of 33%),while noise had the smallest influence(with a weight of 5%).The accuracy of this model was 100%.In the second model(70<SPL<80 dBA),the frequency of 4 KHz had the most profound effect(with a weight of 21%),whereas the frequency of 250 Hz had the lowest impact(with a weight of 6%).The accuracy of this model was 100%too.In the third model(SPL>85 dBA),the frequency of 4 KHz had the highest impact(with a weight of 22%),while the frequency of 250 Hz had the smallest influence(with a weight of 3%).The accuracy of this model was 100%too.In the fourth model,the frequency of 4 KHz had the greatest effect(with a weight of 24%),while the frequency of 500 Hz had the smallest effect(with a weight of 4%).The accuracy of this model was found to be 94%.According to the modeling conducted using the SVM algorithm,the frequency of 4 KHz has the most profound effect on predicting changes in hearing loss.Given the high accuracy of the obtained model,this algorithm is an appropriate and powerful tool to predict and model hearing loss. 展开更多
关键词 Noise modeling hearing loss data mining support vector machine algorithm
暂未订购
Hooke and Jeeves algorithm for linear support vector machine 被引量:1
18
作者 Yeqing Liu Sanyang Liu Mingtao Gu 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2010年第1期138-141,共4页
Coordinate descent method is a unconstrained optimization technique. When it is applied to support vector machine (SVM), at each step the method updates one component of w by solving a one-variable sub-problem while... Coordinate descent method is a unconstrained optimization technique. When it is applied to support vector machine (SVM), at each step the method updates one component of w by solving a one-variable sub-problem while fixing other components. All components of w update after one iteration. Then go to next iteration. Though the method converges and converges fast in the beginning, it converges slow for final convergence. To improve the speed of final convergence of coordinate descent method, Hooke and Jeeves algorithm which adds pattern search after every iteration in coordinate descent method was applied to SVM and a global Newton algorithm was used to solve one-variable subproblems. We proved the convergence of the algorithm. Experimental results show Hooke and Jeeves' method does accelerate convergence specially for final convergence and achieves higher testing accuracy more quickly in classification. 展开更多
关键词 support vector machine CLASSIFICATION pattern search Hooke and Jeeves coordinate descent global Newton algorithm.
在线阅读 下载PDF
Nonlinear model predictive control based on support vector machine and genetic algorithm 被引量:5
19
作者 冯凯 卢建刚 陈金水 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2015年第12期2048-2052,共5页
This paper presents a nonlinear model predictive control(NMPC) approach based on support vector machine(SVM) and genetic algorithm(GA) for multiple-input multiple-output(MIMO) nonlinear systems.Individual SVM is used ... This paper presents a nonlinear model predictive control(NMPC) approach based on support vector machine(SVM) and genetic algorithm(GA) for multiple-input multiple-output(MIMO) nonlinear systems.Individual SVM is used to approximate each output of the controlled plant Then the model is used in MPC control scheme to predict the outputs of the controlled plant.The optimal control sequence is calculated using GA with elite preserve strategy.Simulation results of a typical MIMO nonlinear system show that this method has a good ability of set points tracking and disturbance rejection. 展开更多
关键词 support vector machine Genetic algorithm Nonlinear model predictive control Neural network Modeling
在线阅读 下载PDF
Automatic target recognition of moving target based on empirical mode decomposition and genetic algorithm support vector machine 被引量:4
20
作者 张军 欧建平 占荣辉 《Journal of Central South University》 SCIE EI CAS CSCD 2015年第4期1389-1396,共8页
In order to improve measurement accuracy of moving target signals, an automatic target recognition model of moving target signals was established based on empirical mode decomposition(EMD) and support vector machine(S... In order to improve measurement accuracy of moving target signals, an automatic target recognition model of moving target signals was established based on empirical mode decomposition(EMD) and support vector machine(SVM). Automatic target recognition process on the nonlinear and non-stationary of Doppler signals of military target by using automatic target recognition model can be expressed as follows. Firstly, the nonlinearity and non-stationary of Doppler signals were decomposed into a set of intrinsic mode functions(IMFs) using EMD. After the Hilbert transform of IMF, the energy ratio of each IMF to the total IMFs can be extracted as the features of military target. Then, the SVM was trained through using the energy ratio to classify the military targets, and genetic algorithm(GA) was used to optimize SVM parameters in the solution space. The experimental results show that this algorithm can achieve the recognition accuracies of 86.15%, 87.93%, and 82.28% for tank, vehicle and soldier, respectively. 展开更多
关键词 automatic target recognition(ATR) moving target empirical mode decomposition genetic algorithm support vector machine
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部