scholarly journals Assessment of Three Learning Machines for Long-Term Prediction of Wind Energy in Palestine

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Tamer Khatib ◽  
Reziq Deria ◽  
Asma Isead
Keyword(s):  
Neural Network ◽  
Support Vector Machines ◽  
Wind Energy ◽  
Random Forests ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Energy Data ◽  
Vector Machines ◽  
Input Variables

In this research, an approach for predicting wind energy in the long term has been developed. The aim of this prediction is to generate wind energy profiles for four cities in Palestine based on wind energy profile of another fifth city. Thus, wind energy data for four cities, namely, Nablus city, are used to develop the model; meanwhile, wind energy data for Hebron, Jenin, Ramallah, and Jericho cities are predicted based on that. Three machine learning algorithms are used in this research, namely, Cascade-forward neural network, random forests, and support vector machines. The developed models have two input variables which are daily average cubic wind speed and the standard deviation, while the target is daily wind energy. The R-squared values for the developed Cascade-forward neural network, random forests, and support vector machines models are found to be 0.9996, 0.9901, and 0.9991, respectively. Meanwhile, RMSE values for the developed models are found to be 41.1659 kWh, 68.4101 kWh, and 205.10 kWh, respectively.

The upside of uncertainty: Identification of lithology contact zones from airborne geophysics and satellite data using random forests and support vector machines

Geophysics ◽  
2013 ◽  
Vol 78 (3) ◽  
pp. WB113-WB126 ◽  
Author(s):  
Matthew J. Cracknell ◽  
Anya M. Reading
Keyword(s):  
Machine Learning ◽  
Support Vector Machines ◽  
Random Forests ◽  
Supervised Classification ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Geophysical Data ◽  
Support Vector ◽  
Vector Machines ◽  
Spatially Varying

Inductive machine learning algorithms attempt to recognize patterns in, and generalize from empirical data. They provide a practical means of predicting lithology, or other spatially varying physical features, from multidimensional geophysical data sets. It is for this reason machine learning approaches are increasing in popularity for geophysical data inference. A key motivation for their use is the ease with which uncertainty measures can be estimated for nonprobabilistic algorithms. We have compared and evaluated the abilities of two nonprobabilistic machine learning algorithms, random forests (RF) and support vector machines (SVM), to recognize ambiguous supervised classification predictions using uncertainty calculated from estimates of class membership probabilities. We formulated a method to establish optimal uncertainty threshold values to identify and isolate the maximum number of incorrect predictions while preserving most of the correct classifications. This is illustrated using a case example of the supervised classification of surface lithologies in a folded, structurally complex, metamorphic terrain. We found that (1) the use of optimal uncertainty thresholds significantly improves overall classification accuracy of RF predictions, but not those of SVM, by eliminating the maximum number of incorrectly classified samples while preserving the maximum number of correctly classified samples; (2) RF, unlike SVM, was able to exploit dependencies and structures contained within spatially varying input data; and (3) high RF prediction uncertainty is spatially coincident with transitions in lithology and associated contact zones, and regions of intense deformation. Uncertainty has its upside in the identification of areas of key geologic interest and has wide application across the geosciences, where transition zones are important classes in their own right. The techniques used in this study are of practical value in prioritizing subsequent geologic field activities, which, with the aid of this analysis, may be focused on key lithology contacts and problematic localities.

A compact neural network for training support vector machines

2012 ◽  
Vol 86 ◽  
pp. 193-198 ◽  
Author(s):  
Yun Yang ◽  
Qiaochu He ◽  
Xiaolin Hu
Keyword(s):  
Neural Network ◽  
Support Vector Machines ◽  
Support Vector ◽  
Training Support ◽  
Vector Machines

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 Design and implementation of an intelligent vision and sorting system

2009 ◽  
Author(s):  
◽  
Zhi Li
Keyword(s):  
Neural Network ◽  
Fuzzy Logic ◽  
Support Vector Machines ◽  
Robot Control ◽  
Support Vector ◽  
Design And Implementation ◽  
The Neural Network ◽  
Vector Machines ◽  
Control Computer ◽  
Sorting System

This research focuses on the design and implementation of an intelligent machine vision and sorting system that can be used to sort objects in an industrial environment. Machine vision systems used for sorting are either geometry driven or are based on the textural components of an object’s image. The vision system proposed in this research is based on the textural analysis of pixel content and uses an artificial neural network to perform the recognition task. The neural network has been chosen over other methods such as fuzzy logic and support vector machines because of its relative simplicity. A Bluetooth communication link facilitates the communication between the main computer housing the intelligent recognition system and the remote robot control computer located in a plant environment. Digital images of the workpiece are first compressed before the feature vectors are extracted using principal component analysis. The compressed data containing the feature vectors is transmitted via the Bluetooth channel to the remote control computer for recognition by the neural network. The network performs the recognition function and transmits a control signal to the robot control computer which guides the robot arm to place the object in an allocated position. The performance of the proposed intelligent vision and sorting system is tested under different conditions and the most attractive aspect of the design is its simplicity. The ability of the system to remain relatively immune to noise, its capacity to generalize and its fault tolerance when faced with missing data made the neural network an attractive option over fuzzy logic and support vector machines.

scholarly journals Classification of Incidental Carcinoma of the Prostate Using Learning Vector Quantization and Support Vector Machines

2004 ◽  
Vol 26 (1-2) ◽  
pp. 45-55
Author(s):  
Torsten Mattfeldt ◽  
Danilo Trijic ◽  
Hans‐Werner Gottfried ◽  
Hans A. Kestler
Keyword(s):  
Support Vector Machines ◽  
Gleason Score ◽  
Vector Quantization ◽  
Volume Fraction ◽  
Learning Vector Quantization ◽  
Support Vector ◽  
Stepwise Logistic Regression ◽  
P53 Overexpression ◽  
Vector Machines ◽  
Input Variables

The subclassification of incidental prostatic carcinoma into the categories T1a and T1b is of major prognostic and therapeutic relevance. In this paper an attempt was made to find out which properties mainly predispose to these two tumor categories, and whether it is possible to predict the category from a battery of clinical and histopathological variables using newer methods of multivariate data analysis. The incidental prostatic carcinomas of the decade 1990–99 diagnosed at our department were reexamined. Besides acquisition of routine clinical and pathological data, the tumours were scored by immunohistochemistry for proliferative activity and p53‐overexpression. Tumour vascularization (angiogenesis) and epithelial texture were investigated by quantitative stereology. Learning vector quantization (LVQ) and support vector machines (SVM) were used for the purpose of prediction of tumour category from a set of 10 input variables (age, Gleason score, preoperative PSA value, immunohistochemical scores for proliferation and p53‐overexpression, 3 stereological parameters of angiogenesis, 2 stereological parameters of epithelial texture). In a stepwise logistic regression analysis with the tumour categories T1a and T1b as dependent variables, only the Gleason score and the volume fraction of epithelial cells proved to be significant as independent predictor variables of the tumour category. Using LVQ and SVM with the information from all 10 input variables, more than 80 of the cases could be correctly predicted as T1a or T1b category with specificity, sensitivity, negative and positive predictive value from 74–92%. Using only the two significant input variables Gleason score and epithelial volume fraction, the accuracy of prediction was not worse. Thus, descriptive and quantitative texture parameters of tumour cells are of major importance for the extent of propagation in the prostate gland in incidental prostatic adenocarcinomas. Classical statistical tools and neuronal approaches led to consistent conclusions.

Detecting COVID-19 from Audio Recording of Coughs Using Random Forests and Support Vector Machines

2021 ◽  
Author(s):  
Isabella Södergren ◽  
Maryam Pahlavan Nodeh ◽  
Prakash Chandra Chhipa ◽  
Konstantina Nikolaidou ◽  
György Kovács
Keyword(s):  
Support Vector Machines ◽  
Random Forests ◽  
Support Vector ◽  
Audio Recording ◽  
Vector Machines

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