scholarly journals Data-Driven Prediction of Load Curtailment in Incentive-Based Demand Response System

Energies ◽  
2018 ◽  
Vol 11 (11) ◽  
pp. 2905 ◽  
Author(s):  
Jimyung Kang ◽  
Soonwoo Lee
Keyword(s):  
Energy Consumption ◽  
Demand Response ◽  
Nearest Neighbor ◽  
Service Providers ◽  
Prediction Method ◽  
Poor Performance ◽  
Data Driven ◽  
K Nearest Neighbor ◽  
Response System ◽  
Load Curtailment

Demand response, in which energy customers reduce their energy consumption at the request of service providers, is spreading as a new technology. However, the amount of load curtailment from each customer is uncertain. This is because an energy customer can freely decide to reduce his energy consumption or not in the current liberalized energy market. Because this uncertainty can cause serious problems in a demand response system, it is clear that the amount of energy reduction should be predicted and managed. In this paper, a data-driven prediction method of load curtailment is proposed, considering two difficulties in the prediction. The first problem is that the data is very sparse. Each customer receives a request for load curtailment only a few times a year. Therefore, the k-nearest neighbor method, which requires a relatively small amount of data, is mainly used in our proposed method. The second difficulty is that the characteristic of each customer is so different that a single prediction method cannot cover all the customers. A prediction method that provides remarkable prediction performance for one customer may provide a poor performance for other customers. As a result, the proposed prediction method adopts a weighted ensemble model to apply different models for different customers. The confidence of each sub-model is defined and used as a weight in the ensemble. The prediction is fully based on the electricity consumption data and the history of demand response events without demanding any other additional internal information from each customer. In the experiment, real data obtained from demand response service providers verifies that the proposed framework is suitable for the prediction of each customer’s load curtailment.

scholarly journals Dissimilarity Space Based Multi-Source Cross-Project Defect Prediction

Algorithms ◽  
2019 ◽  
Vol 12 (1) ◽  
pp. 13
Author(s):  
Shengbing Ren ◽  
Wanying Zhang ◽  
Hafiz Shahbaz Munir ◽  
Lei Xia
Keyword(s):  
Nearest Neighbor ◽  
Prediction Method ◽  
Poor Performance ◽  
Performance Model ◽  
Training Data ◽  
Cluster Center ◽  
Defect Prediction ◽  
K Nearest Neighbor ◽  
Target Set ◽  
Cross Project

Software defect prediction is an important means to guarantee software quality. Because there are no sufficient historical data within a project to train the classifier, cross-project defect prediction (CPDP) has been recognized as a fundamental approach. However, traditional defect prediction methods use feature attributes to represent samples, which cannot avoid negative transferring, may result in poor performance model in CPDP. This paper proposes a multi-source cross-project defect prediction method based on dissimilarity space (DM-CPDP). This method not only retains the original information, but also obtains the relationship with other objects. So it can enhances the discriminant ability of the sample attributes to the class label. This method firstly uses the density-based clustering method to construct the prototype set with the cluster center of samples in the target set. Then, the arc-cosine kernel is used to calculate the sample dissimilarities between the prototype set and the source domain or the target set to form the dissimilarity space. In this space, the training set is obtained with the earth mover’s distance (EMD) method. For the unlabeled samples converted from the target set, the k-Nearest Neighbor (KNN) algorithm is used to label those samples. Finally, the model is learned from training data based on TrAdaBoost method and used to predict new potential defects. The experimental results show that this approach has better performance than other traditional CPDP methods.

PREDICTION OF CORONARY ARTERY DISEASE BASED ON ENSEMBLE LEARNING APPROACHES AND CO-EXPRESSED OBSERVATIONS

2016 ◽  
Vol 16 (01) ◽  
pp. 1640010 ◽  
Author(s):  
YING-TSANG LO ◽  
HAMIDO FUJITA ◽  
TUN-WEN PAI
Keyword(s):  
Machine Learning ◽  
Coronary Artery Disease ◽  
Coronary Artery ◽  
Nearest Neighbor ◽  
Prediction Method ◽  
Medical Decision ◽  
Learning Approaches ◽  
K Nearest Neighbor ◽  
Artery Disease ◽  
Voting Mechanism

Background: Coronary artery disease (CAD) is one of the most representative cardiovascular diseases. Early and accurate prediction of CAD based on physiological measurements can reduce the risk of heart attack through medicine therapy, healthy diet, and regular physical activity. Methods:Four heart disease datasets from the UC Irvine Machine Learning Repository were combined and re-examined to remove incomplete entries, and a total of 822 cases were utilized in this study. Seven machine learning methods, including Naïve Bayes, artificial neural networks (ANNs), sequential minimal optimization (SMO), k-nearest neighbor (KNN), AdaBoost, J48, and random forest, were adopted to analyze the collected datasets for CAD prediction. By combining co-expressed observations and an ensemble voting mechanism, we designed and evaluated a new medical decision classifier for CAD prediction. The TOPSIS (Technique for Order Preference by Similarity to an Ideal Solution) algorithm was applied to determine the best prediction method for CAD diagnosis. Results: Features of systolic blood pressure, cholesterol, heart rate, and ST depression are considered to be the most significant differences between patients with and without CADs. We show that the prediction capability of seven machine learning classifiers can be enhanced by integrating combinations of observed co-expressed features. Finally, compared to the use of any single classifier, the proposed voting mechanism achieved optimal performance according to TOPSIS.

KOMPARASI ALGORITMA KLASIFIKASI PADA ANALISIS REVIEW HOTEL

2018 ◽  
Vol 14 (2) ◽  
pp. 261
Author(s):  
Lila Dini Utami
Keyword(s):  
Support Vector Machine ◽  
Nearest Neighbor ◽  
Naive Bayes ◽  
Service Providers ◽  
Naïve Bayes ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Nearest Neighbor Algorithm ◽  
K Nearest Neighbor Algorithm ◽  
Auc Value

At this time the freedom to express opinions in oral and written forms about everything is very easy. This activity can be used to make decisions by some business people. Especially by service providers, such as hotels. This will be very useful in the development of the hotel business itself. But the review data must be processed using the right algorithm. So this study was conducted to find out which algorithms are more feasible to use to get the highest accuracy. The methods used are Naïve Bayes (NB), Support Vector Machine (SVM), and k-Nearest Neighbor (k-NN). From the process that has been done, the results of Naïve Bayes accuracy are 71.50% with the AUC value is 0.500, Support Vector Machine is 72.50% with the AUC value is 0.936 and the accuracy results if using the k-Nearest Neighbor algorithm is 75.00% with the AUC value is 0.500. The use of the k-Nearest Neighbor algorithm can help in making more appropriate decisions for hotel reviews at this time.

Sign in / Sign up

Export Citation Format

Share Document