scholarly journals Evaluation of micro rain radar-based precipitation classification algorithms to discriminate between stratiform and convective precipitation

2021 ◽  
Vol 14 (6) ◽  
pp. 4565-4574
Author(s):  
Andreas Foth ◽  
Janek Zimmer ◽  
Felix Lauermann ◽  
Heike Kalesse-Los
Keyword(s):  
Probability Density Functions ◽  
Convective Precipitation ◽  
Doppler Velocity ◽  
Classification Algorithms ◽  
Density Functions ◽  
Data Set ◽  
Artificial Neural Network Ann ◽  
Cloud Evolution ◽  
Rain Radar ◽  
Temporal Standard Deviation

Abstract. In this paper, we present two micro rain radar-based approaches to discriminate between stratiform and convective precipitation. One is based on probability density functions (PDFs) in combination with a confidence function, and the other one is an artificial neural network (ANN) classification. Both methods use the maximum radar reflectivity per profile, the maximum of the observed mean Doppler velocity per profile and the maximum of the temporal standard deviation (±15 min) of the observed mean Doppler velocity per profile from a micro rain radar (MRR). Training and testing of the algorithms were performed using a 2-year data set from the Jülich Observatory for Cloud Evolution (JOYCE). Both methods agree well, giving similar results. However, the results of the ANN are more decisive since it is also able to distinguish an inconclusive class, in turn making the stratiform and convective classes more reliable.

scholarly journals Evaluation of micro rain radar-based precipitation classification algorithms to discriminate between stratiform and convective precipitation

2020 ◽  
Author(s):  
Andreas Foth ◽  
Janek Zimmer ◽  
Felix Lauermann ◽  
Heike Kalesse
Keyword(s):  
Neural Network ◽  
Artificial Neural Network ◽  
Convective Precipitation ◽  
Doppler Velocity ◽  
Data Set ◽  
Artificial Neural ◽  
Artificial Neural Network Ann ◽  
Cloud Evolution ◽  
Rain Radar ◽  
Temporal Standard Deviation

Abstract. In this paper, we present two micro rain radar-based approaches to discriminate between stratiform and convective precipitation. One is based on probability density functions (PDFs) in combination with a confidence function and the other one is an artificial neural network (ANN) classification. Both methods use the maximum radar reflectivity per profile, the maximum of the observed mean Doppler velocity per profile and the maximum of the temporal standard deviation (±15 min) of the observed 5 mean Doppler velocity per profile from a micro rain radar (MRR). Training and testing of the algorithms were performed using a two year data set from the Jülich Observatory for Cloud Evolution (JOYCE). Both methods agree well giving similar results. However, the results of the artificial neural network are more reasonable since it is also able to distinguish into an inconclusive class, in turn making the stratiform and convective classes more reliable.

scholarly journals A Mixture of Inverse Weibull and Inverse Burr Distributions: Properties, Estimation, and Fitting

2017 ◽  
Vol 2017 ◽  
pp. 1-11
Author(s):  
A. S. Al-Moisheer ◽  
K. S. Sultan ◽  
M. A. Al-Shehri
Keyword(s):  
Mixture Model ◽  
Classical Method ◽  
Likelihood Estimation ◽  
Real Data ◽  
Probability Density Functions ◽  
Density Functions ◽  
Data Set ◽  
Burr Distributions ◽  
Lindley’S Approximation ◽  
Rate Functions

The new mixture model of the two components of the inverse Weibull and inverse Burr distributions (MIWIBD) is proposed. First, the properties of the investigated mixture model are introduced and the behaviors of the probability density functions and hazard rate functions are displayed. Then, the estimates of the five-dimensional vector of parameters by using the classical method such as the maximum likelihood estimation (MLEs) and the approximation method by using Lindley’s approximation are obtained. Finally, a real data set for the proposed mixture model is applied to illustrate the proposed mixture model.

Quantile Analysis: A Method for Characterizing Data Distributions

1988 ◽  
Vol 42 (8) ◽  
pp. 1512-1520 ◽  
Author(s):  
Robert A. Lodder ◽  
Gary M. Hieftje
Keyword(s):  
Probability Density ◽  
Statistical Methods ◽  
Probability Density Functions ◽  
Density Functions ◽  
Single Test ◽  
Test Statistic ◽  
Data Set ◽  
Normal Probability Plot ◽  
Probability Plot ◽  
Normal Probability

Analyzing distributions of data represents a common problem in chemistry. Quantile-quantile (QQ) plots provide a useful way to attack this problem. These graphs are often used in the form of the normal probability plot, to determine whether the residuals from a fitting process are randomly distributed and therefore whether an assumed model fits the data at hand. By comparing the integrals of two probability density functions in a single plot, QQ plotting methods are able to capture the location, scale, and skew of a data set. This procedure provides more information to the analyst than do classical statistical methods that rely on a single test statistic for distribution comparisons.

scholarly journals An R Code for Implementing Non-hierarchical Algorithm for Clustering of Probability Density Functions

2018 ◽  
Vol 2 (3) ◽  
pp. 174
Author(s):  
Diem Ngoc Tran ◽  
Tom Vinant ◽  
Théo Marc Colombani ◽  
Diem Ho-Kieu
Keyword(s):  
Probability Density ◽  
Clustering Algorithm ◽  
Simulated Data ◽  
Probability Density Functions ◽  
Computational Time ◽  
Density Functions ◽  
Data Set ◽  
Hierarchical Algorithm ◽  
Creative Commons ◽  
Clustering Quality

This paper aims to present a code for implementation of non-hierarchical algorithm to cluster probability density functions in one dimension for the first time in R environment. The structure of code consists of 2 primary steps: executing the main clustering algorithm and evaluating the clustering quality. The code is validated on one simulated data set and two applications. The numerical results obtained are highly compatible with that on MATLAB software regarding computational time. Notably, the code mainly serves for educational purpose and desires to extend the availability of algorithm in several environments so as having multiple choices for whom interested in clustering.  This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

scholarly journals 5 Performance Analysis of Machine Learning Classifiers for Brain Tumor MR Images

2018 ◽  
Vol 1 (1) ◽  
pp. 6 ◽  
Author(s):  
Lubna Farhi ◽  
Razia Zia ◽  
Zain Anwar Ali
Keyword(s):  
Machine Learning ◽  
Support Vector ◽  
Classification Algorithms ◽  
Mr Images ◽  
Data Set ◽  
Machine Learning Classification ◽  
Machine Learning Classifiers ◽  
Brain Mr Images ◽  
Artificial Neural Network Ann

Brain cancer has remained one of the key causes ofdeaths in people of all ages. One way to survival amongst patientsis to correctly diagnose cancer in its early stages. Recentlymachine learning has become a very important tool in medicalimage classification. Our approach is to examine and comparevarious machine learning classification algorithms that help inbrain tumor classification of Magnetic Resonance (MR) images.We have compared Artificial Neural Network (ANN), K-nearestNeighbor (KNN), Decision Tree (DT), Support Vector Machine(SVM) and Naïve Bayes (NB) classifiers to determine theaccuracy of each classifier and find the best amongst them forclassification of cancerous and noncancerous brain MR images.We have used 86 MR images and extracted a large number offeatures for each image. Since the equal number of images, havebeen used thus there is no suspicion of results being biased. Forour data set the most accurate results were provided by ANN. Itwas found that ANN provides better results for medium to largedatabase of Brain MR Images.

A Class Association Rule Based Classifier Using Probability Density Functions for Intrusion Detection Systems

2015 ◽  
Vol 19 (4) ◽  
pp. 555-566 ◽  
Author(s):  
Shingo Mabu ◽  
◽  
Wenjing Li ◽  
Kotaro Hirasawa ◽  
Keyword(s):  
Intrusion Detection ◽  
Computer Security ◽  
Probability Density ◽  
Association Rule ◽  
Joint Probability ◽  
Probability Density Functions ◽  
Classification Algorithms ◽  
Density Functions ◽  
Network Intrusion ◽  
Class Association Rule

As the number of computer systems connected to the Internet is increasing exponentially, the computer security has become a crucial problem, and many techniques for Intrusion detection have been proposed to detect network attacks efficiently. On the other hand, data mining algorithms based on Genetic Network Programming (GNP) have been proposed and applied to Intrusion detection recently. GNP is a graph-based evolutionary algorithm and can extract many important class association rules by making use of the distinguished representation ability of the graph structure. In this paper, probabilistic classification algorithms based on multi-dimensional probability distribution are proposed and combined with conventional class association rule mining of GNP, and applied to network intrusion detection for the performance evaluation. The proposed classification algorithms are based on 1) one-dimensional probability density functions and 2) a two-dimensional joint probability density function. These functions represent the distribution of normal and intrusion accesses and efficiently classify a new access data into normal, known intrusion or even unknown intrusion. The simulations using KDD99Cup database from MIT Lincoln Laboratory show some advantages of the proposed algorithms over the conventional mean and standard deviation-based method.

scholarly journals 5 Performance Analysis of Machine Learning Classifiers for Brain Tumor MR Images

2018 ◽  
Vol 8 (1) ◽  
pp. 6
Author(s):  
Lubna Farhi ◽  
Razia Zia ◽  
Zain Anwar Ali
Keyword(s):  
Machine Learning ◽  
Support Vector ◽  
Classification Algorithms ◽  
Mr Images ◽  
Data Set ◽  
Machine Learning Classification ◽  
Machine Learning Classifiers ◽  
Brain Mr Images ◽  
Artificial Neural Network Ann

Brain cancer has remained one of the key causes ofdeaths in people of all ages. One way to survival amongst patientsis to correctly diagnose cancer in its early stages. Recentlymachine learning has become a very important tool in medicalimage classification. Our approach is to examine and comparevarious machine learning classification algorithms that help inbrain tumor classification of Magnetic Resonance (MR) images.We have compared Artificial Neural Network (ANN), K-nearestNeighbor (KNN), Decision Tree (DT), Support Vector Machine(SVM) and Naïve Bayes (NB) classifiers to determine theaccuracy of each classifier and find the best amongst them forclassification of cancerous and noncancerous brain MR images.We have used 86 MR images and extracted a large number offeatures for each image. Since the equal number of images, havebeen used thus there is no suspicion of results being biased. Forour data set the most accurate results were provided by ANN. Itwas found that ANN provides better results for medium to largedatabase of Brain MR Images.

Random Forest (RF) and Artificial Neural Network (ANN) Algorithms for LULC Mapping

2020 ◽  
Vol 38 (4A) ◽  
pp. 510-514
Author(s):  
Tay H. Shihab ◽  
Amjed N. Al-Hameedawi ◽  
Ammar M. Hamza
Keyword(s):  
Neural Network ◽  
Remote Sensing ◽  
Artificial Neural Network ◽  
Random Forest ◽  
Satellite Image ◽  
Landsat 8 ◽  
Optical Remote Sensing ◽  
Data Set ◽  
Artificial Neural ◽  
Artificial Neural Network Ann

In this paper to make use of complementary potential in the mapping of LULC spatial data is acquired from LandSat 8 OLI sensor images are taken in 2019.  They have been rectified, enhanced and then classified according to Random forest (RF) and artificial neural network (ANN) methods. Optical remote sensing images have been used to get information on the status of LULC classification, and extraction details. The classification of both satellite image types is used to extract features and to analyse LULC of the study area. The results of the classification showed that the artificial neural network method outperforms the random forest method. The required image processing has been made for Optical Remote Sensing Data to be used in LULC mapping, include the geometric correction, Image Enhancements, The overall accuracy when using the ANN methods 0.91 and the kappa accuracy was found 0.89 for the training data set. While the overall accuracy and the kappa accuracy of the test dataset were found 0.89 and 0.87 respectively.

Sign in / Sign up

Export Citation Format

Share Document