scholarly journals Demand Prediction of Emergency Supplies under Fuzzy and Missing Partial Data

2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
Ming Zhang ◽  
Hanlin Wu ◽  
Zhifeng Qiu ◽  
Yifan Zhang ◽  
Boquan Li
Keyword(s):  
Prediction Model ◽  
Prediction Accuracy ◽  
Nearest Neighbor ◽  
Uncertain Information ◽  
K Nearest Neighbor ◽  
Emergency Rescue ◽  
Demand Prediction ◽  
Partial Data ◽  
Grey Relation ◽  
Fuzzy Interval

An accurate demand prediction of emergency supplies according to disaster information and historical data is an important research subject in emergency rescue. This study aims at improving supplies demand prediction accuracy under partial data fuzziness and missing. The main contributions of this study are summarized as follows. (1) In view that it is difficult for the turning point of the whitenization weight function to determine fuzzy data, two computational formulas solving “core” of fuzzy interval grey numbers were proposed, and the obtained “core” replaced primary fuzzy information so as to reach the goal of transforming uncertain information into certain information. (2) For partial data missing, the improved grey k-nearest neighbor (GKNN) algorithm was put forward based on grey relation degree and K-nearest neighbor (KNN) algorithm. Weights were introduced in the filling and logic test conditions were added after filling so that filling results were of higher truthfulness and accuracy. (3) The preprocessed data are input into the improved algorithm based on the genetic algorithm and BP neural networks (GABP) to obtain the demand prediction model. Finally the calculation presents that the prediction accuracy and its stability are improved at the five-group comparative tests of calculated examples of actual disasters. The experiments indicated that the supplies demand prediction model under data fuzziness and missing proposed in this study was of higher prediction accuracy.

scholarly journals An Enhanced K-Nearest Neighbor Predictive Model through Metaheuristic Optimization

2020 ◽  
Vol 10 (4) ◽  
pp. 280-292
Author(s):  
Allemar Jhone P. Delima
Keyword(s):  
Genetic Algorithm ◽  
Prediction Model ◽  
Prediction Accuracy ◽  
Nearest Neighbor ◽  
Prediction Models ◽  
Faculty Evaluation ◽  
The Novel ◽  
Improved Genetic Algorithm ◽  
K Nearest Neighbor ◽  
Negative Effects

The k-nearest neighbor (KNN) algorithm is vulnerable to noise, which is rooted in the dataset and has negative effects on its accuracy. Hence, various researchers employ variable minimization techniques before predicting the KNN in the quest so as to improve its predictive capability. The genetic algorithm (GA) is the most widely used metaheuristics for such purpose; however, the GA suffers a problem that its mating scheme is bounded on its crossover operator. Thus, the use of the novel inversed bi-segmented average crossover (IBAX) is observed. In the present work, the crossover improved genetic algorithm (CIGAL) is instrumental in the enhancement of KNN’s prediction accuracy. The use of the unmodified genetic algorithm has removed 13 variables, while the CIGAL then further removes 20 variables from the 30 total variables in the faculty evaluation dataset. Consequently, the integration of the CIGAL to the KNN (CIGAL-KNN) prediction model improves the KNN prediction accuracy to 95.53%. In contrast to the model of having the unmodified genetic algorithm (GA-KNN), the use of the lone KNN algorithmand the prediction accuracy is only at 89.94% and 87.15%, respectively. To validate the accuracy of the models, the use of the 10-folds cross-validation technique reveals 93.13%, 89.27%, and 87.77% prediction accuracy of the CIGAL-KNN, GA-KNN, and KNN prediction models, respectively. As the result, the CIGAL carried out an optimized GA performance and increased the accuracy of the KNN algorithm as a prediction model.

scholarly journals K-Nearest Neighbor Intervals Based AP Clustering Algorithm for Large Incomplete Data

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Cheng Lu ◽  
Shiji Song ◽  
Cheng Wu
Keyword(s):  
Clustering Analysis ◽  
Incomplete Data ◽  
Clustering Algorithm ◽  
Nearest Neighbor ◽  
Interval Data ◽  
Similarity Function ◽  
K Nearest Neighbor ◽  
Partial Data ◽  
Missing Attributes ◽  
Ap Clustering

The Affinity Propagation (AP) algorithm is an effective algorithm for clustering analysis, but it can not be directly applicable to the case of incomplete data. In view of the prevalence of missing data and the uncertainty of missing attributes, we put forward a modified AP clustering algorithm based onK-nearest neighbor intervals (KNNI) for incomplete data. Based on an Improved Partial Data Strategy, the proposed algorithm estimates the KNNI representation of missing attributes by using the attribute distribution information of the available data. The similarity function can be changed by dealing with the interval data. Then the improved AP algorithm can be applicable to the case of incomplete data. Experiments on several UCI datasets show that the proposed algorithm achieves impressive clustering results.

scholarly journals Heart disease prediction model with k-nearest neighbor algorithm

2021 ◽  
Vol 10 (3) ◽  
pp. 225
Author(s):  
Tssehay Admassu Assegie
Keyword(s):  
Heart Disease ◽  
Prediction Model ◽  
Nearest Neighbor ◽  
Predictive Performance ◽  
Data Repository ◽  
Disease Prediction ◽  
K Nearest Neighbor ◽  
Proposed Model ◽  
K Nearest Neighbor Algorithm ◽  
Learning Data

<span>In this study, the author proposed k-nearest neighbor (KNN) based heart disease prediction model. The author conducted an experiment to evaluate the performance of the proposed model. Moreover, the result of the experimental evaluation of the predictive performance of the proposed model is analyzed. To conduct the study, the author obtained heart disease data from Kaggle machine learning data repository. The dataset consists of 1025 observations of which 499 or 48.68% is heart disease negative and 526 or 51.32% is heart disease positive. Finally, the performance of KNN algorithm is analyzed on the test set. The result of performance analysis on the experimental results on the Kaggle heart disease data repository shows that the accuracy of the KNN is 91.99%</span>

scholarly journals Prediction of Flash Flood using Rainfall by MLP Classifier

2020 ◽  
Vol 9 (1) ◽  
pp. 425-429
Keyword(s):  
Prediction Model ◽  
Nearest Neighbor ◽  
Weather Forecasting ◽  
Flash Flood ◽  
Human Life ◽  
Cost Effective ◽  
Rainfall Data ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Flood Prediction

Flood are one of the unfavorable natural disasters. A flood can result in a huge loss of human lives and properties. It can also affect agricultural lands and destroy cultivated crops and trees. The flood can occur as a result of surface-runoff formed from melting snow, long-drawn-out rains, and derisory drainage of rainwater or collapse of dams. Today people have destroyed the rivers and lakes and have turned the natural water storage pools to buildings and construction lands. Flash floods can develop quickly within a few hours when compared with a regular flood. Research in prediction of flood has improved to reduce the loss of human life, property damages, and various problems related to the flood. Machine learning methods are widely used in building an efficient prediction model for weather forecasting. This advancement of the prediction system provides cost-effective solutions and better performance. In this paper, a prediction model is constructed using rainfall data to predict the occurrence of floods due to rainfall. The model predicts whether “flood may happen or not” based on the rainfall range for particular locations. Indian district rainfall data is used to build the prediction model. The dataset is trained with various algorithms like Linear Regression, K- Nearest Neighbor, Support Vector Machine, and Multilayer Perceptron. Among this, MLP algorithm performed efficiently with the highest accuracy of 97.40%. The MLP flash flood prediction model can be useful for the climate scientist to predict the flood during a heavy downpour with the highest accuracy.

Snow Detection using In-Vehicle Video Camera with Texture-Based Image Features Utilizing K-Nearest Neighbor, Support Vector Machine, and Random Forest

2019 ◽  
Vol 2673 (8) ◽  
pp. 221-232 ◽  
Author(s):  
Md Nasim Khan ◽  
Mohamed M. Ahmed
Keyword(s):  
Real Time ◽  
Prediction Accuracy ◽  
Nearest Neighbor ◽  
Detection System ◽  
Weather Conditions ◽  
Video Camera ◽  
Image Features ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Weather Information

Snowfall negatively affects pavement and visibility conditions, making it one of the major causes of motor vehicle crashes in winter weather. Therefore, providing drivers with real-time roadway weather information during adverse weather is crucial for safe driving. Although road weather stations can provide weather information, these stations are expensive and often do not represent real-time trajectory-level weather information. The main motivation of this study was to develop an affordable in-vehicle snow detection system which can provide trajectory-level weather information in real time. The system utilized SHRP2 Naturalistic Driving Study video data and was based on machine learning techniques. To train the snow detection models, two texture-based image features including gray level co-occurrence matrix (GLCM) and local binary pattern (LBP), and three classification algorithms: support vector machine (SVM), k-nearest neighbor (K-NN), and random forest (RF) were used. The analysis was done on an image dataset consisting of three weather conditions: clear, light snow, and heavy snow. While the highest overall prediction accuracy of the models based on the GLCM features was found to be around 86%, the models considering the LBP based features provided a much higher prediction accuracy of 96%. The snow detection system proposed in this study is cost effective, does not require a lot of technical support, and only needs a single video camera. With the advances in smartphone cameras, simple mobile apps with proper data connectivity can effectively be used to detect roadway weather conditions in real time with reasonable accuracy.

scholarly journals Predicting Learning Outcomes with MOOC Clickstreams

2019 ◽  
Vol 9 (2) ◽  
pp. 104 ◽  
Author(s):  
Chen-Hsiang Yu ◽  
Jungpin Wu ◽  
An-Chi Liu
Keyword(s):  
Machine Learning ◽  
Learning Outcomes ◽  
Prediction Accuracy ◽  
Nearest Neighbor ◽  
Prediction Models ◽  
Video Data ◽  
Support Vector ◽  
Completion Rates ◽  
K Nearest Neighbor ◽  
Learning Behaviors

Massive Open Online Courses (MOOCs) have gradually become a dominant trend in education. Since 2014, the Ministry of Education in Taiwan has been promoting MOOC programs, with successful results. The ability of students to work at their own pace, however, is associated with low MOOC completion rates and has recently become a focus. The development of a mechanism to effectively improve course completion rates continues to be of great interest to both teachers and researchers. This study established a series of learning behaviors using the video clickstream records of students, through a MOOC platform, to identify seven types of cognitive participation models of learners. We subsequently built practical machine learning models by using K-nearest neighbor (KNN), support vector machines (SVM), and artificial neural network (ANN) algorithms to predict students’ learning outcomes via their learning behaviors. The ANN machine learning method had the highest prediction accuracy. Based on the prediction results, we saw a correlation between video viewing behavior and learning outcomes. This could allow teachers to help students needing extra support successfully pass the course. To further improve our method, we classified the course videos based on their content. There were three video categories: theoretical, experimental, and analytic. Different prediction models were built for each of these three video types and their combinations. We performed the accuracy verification; our experimental results showed that we could use only theoretical and experimental video data, instead of all three types of data, to generate prediction models without significant differences in prediction accuracy. In addition to data reduction in model generation, this could help teachers evaluate the effectiveness of course videos.

scholarly journals Neuromorphic Vision Based Contact-Level Classification in Robotic Grasping Applications

Sensors ◽  
2020 ◽  
Vol 20 (17) ◽  
pp. 4724
Author(s):  
Xiaoqian Huang ◽  
Rajkumar Muthusamy ◽  
Eman Hassan ◽  
Zhenwei Niu ◽  
Lakmal Seneviratne ◽  
...  
Keyword(s):  
Prediction Accuracy ◽  
Nearest Neighbor ◽  
Support Vector ◽  
Tactile Sensing ◽  
Good Prediction ◽  
K Nearest Neighbor ◽  
Good Prediction Accuracy ◽  
Grasping Force ◽  
Dynamic Time ◽  
Neuromorphic Vision

In recent years, robotic sorting is widely used in the industry, which is driven by necessity and opportunity. In this paper, a novel neuromorphic vision-based tactile sensing approach for robotic sorting application is proposed. This approach has low latency and low power consumption when compared to conventional vision-based tactile sensing techniques. Two Machine Learning (ML) methods, namely, Support Vector Machine (SVM) and Dynamic Time Warping-K Nearest Neighbor (DTW-KNN), are developed to classify material hardness, object size, and grasping force. An Event-Based Object Grasping (EBOG) experimental setup is developed to acquire datasets, where 243 experiments are produced to train the proposed classifiers. Based on predictions of the classifiers, objects can be automatically sorted. If the prediction accuracy is below a certain threshold, the gripper re-adjusts and re-grasps until reaching a proper grasp. The proposed ML method achieves good prediction accuracy, which shows the effectiveness and the applicability of the proposed approach. The experimental results show that the developed SVM model outperforms the DTW-KNN model in term of accuracy and efficiency for real time contact-level classification.

scholarly journals Differentiating Breast Tumors from Background Parenchymal Enhancement at Contrast-Enhanced Mammography: The Role of Radiomics—A Pilot Reader Study

Diagnostics ◽  
2021 ◽  
Vol 11 (7) ◽  
pp. 1248
Author(s):  
Ioana Boca (Bene) ◽  
Anca Ileana Ciurea ◽  
Cristiana Augusta Ciortea ◽  
Paul Andrei Ștefan ◽  
Lorena Alexandra Lisencu ◽  
...  
Keyword(s):  
Prediction Model ◽  
Clinical Decision Making ◽  
Nearest Neighbor ◽  
Clinical Decision ◽  
Breast Cancers ◽  
K Nearest Neighbor ◽  
Background Parenchymal Enhancement ◽  
Contrast Enhanced ◽  
Parenchymal Enhancement

Background: The purpose of this study was to assess the effectiveness of the radiomic analysis of contrast-enhanced spectral mammography (CESM) in discriminating between breast cancers and background parenchymal enhancement (BPE). Methods: This retrospective study included 38 patients that underwent CESM examinations for clinical purposes between January 2019–December 2020. A total of 57 malignant breast lesions and 23 CESM examinations with 31 regions of BPE were assessed through radiomic analysis using MaZda software. The parameters that demonstrated to be independent predictors for breast malignancy were exported into the B11 program and a k-nearest neighbor classifier (k-NN) was trained on the initial groups of patients and was tested using a validation group. Histopathology results obtained after surgery were considered the gold standard. Results: Radiomic analysis found WavEnLL_s_2 parameter as an independent predictor for breast malignancies with a sensitivity of 68.42% and a specificity of 83.87%. The prediction model that included CH1D6SumAverg, CN4D6Correlat, Kurtosis, Perc01, Perc10, Skewness, and WavEnLL_s_2 parameters had a sensitivity of 73.68% and a specificity of 80.65%. Higher values were obtained of WavEnLL_s_2 and the prediction model for tumors than for BPEs. The comparison between the ROC curves provided by the WaveEnLL_s_2 and the entire prediction model did not show statistically significant results (p = 0.0943). The k-NN classifier based on the parameter WavEnLL_s_2 had a sensitivity and specificity on training and validating groups of 71.93% and 45.16% vs. 60% and 44.44%, respectively. Conclusion: Radiomic analysis has the potential to differentiate CESM between malignant lesions and BPE. Further quantitative insight into parenchymal enhancement patterns should be performed to facilitate the role of BPE in personalized clinical decision-making and risk assessment.

scholarly journals PREDICTING THE LITIGATION OUTCOME OF PPP PROJECT DISPUTES BETWEEN PUBLIC AUTHORITY AND PRIVATE PARTNER USING AN ENSEMBLE MODEL

2021 ◽  
Vol 22 (2) ◽  
pp. 320-345
Author(s):  
Xiaoxiao Zheng ◽  
Yisheng Liu ◽  
Jun Jiang ◽  
Linda M. Thomas ◽  
Nan Su
Keyword(s):  
Prediction Accuracy ◽  
Nearest Neighbor ◽  
Public Authority ◽  
Gradient Boosting ◽  
Ensemble Model ◽  
Multi Layer Perceptron ◽  
K Nearest Neighbor ◽  
Private Partnership ◽  
The Government ◽  
Prediction Approach

Apart from the loss of time and money, disputes between public authority and private partner in China’s public-private partnership (PPP) projects are destroying the government’s image of PPP support and the private partner’s investment confidence. This article aims to explore the main causes for PPP disputes, present the results of disputes, and then predict the litigation outcomes. Based on 171 PPP litigation cases from China Judgements Online within 2013–2018, the research identified 17 legal factors and explained how these factors influence the litigation outcomes, which are named as “prediction approach” in this study. Nine machine learning (ML) models were trained and validated using the data from 171 cases. The ensemble model of gradient boosting decision tree (GBDT), k-nearest neighbor (KNN) and multi-layer perceptron neural network (MLP) performed best compared with other nine individual ML models, and obtained a prediction accuracy of 96.42%. This study adds meaningful insights to PPP dispute avoidance, such as high compensation of expected revenues could prevent the government from terminating the contract unilaterally. To some extent, if parties consider the case litigation outcome, they are more likely prefer a rational settlement out of court to avoid further aggravation of the dispute, and would also alleviate the pressure of litigation in China.

Sign in / Sign up

Export Citation Format

Share Document