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.

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

2018 ◽  
Author(s):  
Shengbing Ren ◽  
Wanying Zhang ◽  
Hafiz Shahbaz Munir ◽  
Lei Xia
Keyword(s):  
Prediction Method ◽  
Poor Performance ◽  
Performance Model ◽  
Cluster Center ◽  
Defect Prediction ◽  
Software Defect ◽  
Density Based Clustering ◽  
Important Means ◽  
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 using feature attributes to represent samples, which can not 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 first 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 form the dissimilarity space, and 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 KNN algorithm is used to label those samples. Finally, we use TrAdaBoost method to establish the prediction model.  The experimental results show that our approach has better performance than other traditional CPDP methods.

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 k-Nearest Neighbor Learning with Graph Neural Networks

Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 830
Author(s):  
Seokho Kang
Keyword(s):  
Neural Network ◽  
Nearest Neighbor ◽  
Learning Algorithm ◽  
Weighting Function ◽  
High Sensitivity ◽  
Training Data ◽  
K Nearest Neighbor ◽  
Main Challenge ◽  
Benchmark Datasets ◽  
Graph Neural Networks

k-nearest neighbor (kNN) is a widely used learning algorithm for supervised learning tasks. In practice, the main challenge when using kNN is its high sensitivity to its hyperparameter setting, including the number of nearest neighbors k, the distance function, and the weighting function. To improve the robustness to hyperparameters, this study presents a novel kNN learning method based on a graph neural network, named kNNGNN. Given training data, the method learns a task-specific kNN rule in an end-to-end fashion by means of a graph neural network that takes the kNN graph of an instance to predict the label of the instance. The distance and weighting functions are implicitly embedded within the graph neural network. For a query instance, the prediction is obtained by performing a kNN search from the training data to create a kNN graph and passing it through the graph neural network. The effectiveness of the proposed method is demonstrated using various benchmark datasets for classification and regression tasks.

scholarly journals Android Malware Detection using Machine Learning

2020 ◽  
Vol 8 (2S12) ◽  
pp. 65-70
Keyword(s):  
Machine Learning ◽  
Nearest Neighbor ◽  
Machine Learning Algorithms ◽  
Training Data ◽  
Machine Learning Techniques ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
User Interest ◽  
Android Malware ◽  
Android Malware Detection

Machine Learning is empowering many aspects of day-to-day lives from filtering the content on social networks to suggestions of products that we may be looking for. This technology focuses on taking objects as image input to find new observations or show items based on user interest. The major discussion here is the Machine Learning techniques where we use supervised learning where the computer learns by the input data/training data and predict result based on experience. We also discuss the machine learning algorithms: Naïve Bayes Classifier, K-Nearest Neighbor, Random Forest, Decision Tress, Boosted Trees, Support Vector Machine, and use these classifiers on a dataset Malgenome and Drebin which are the Android Malware Dataset. Android is an operating system that is gaining popularity these days and with a rise in demand of these devices the rise in Android Malware. The traditional techniques methods which were used to detect malware was unable to detect unknown applications. We have run this dataset on different machine learning classifiers and have recorded the results. The experiment result provides a comparative analysis that is based on performance, accuracy, and cost.

An Incremental Isomap Method for Hyperspectral Dimensionality Reduction and Classification

2021 ◽  
Vol 87 (6) ◽  
pp. 445-455
Author(s):  
Yi Ma ◽  
Zezhong Zheng ◽  
Yutang Ma ◽  
Mingcang Zhu ◽  
Ran Huang ◽  
...  
Keyword(s):  
Manifold Learning ◽  
Nearest Neighbor ◽  
Hyperspectral Image ◽  
Hyperspectral Data ◽  
Training Data ◽  
Support Vector ◽  
Data Sets ◽  
K Nearest Neighbor ◽  
Data Set ◽  
Data Points

Many manifold learning algorithms conduct an eigen vector analysis on a data-similarity matrix with a size of N×N, where N is the number of data points. Thus, the memory complexity of the analysis is no less than O(N2). We pres- ent in this article an incremental manifold learning approach to handle large hyperspectral data sets for land use identification. In our method, the number of dimensions for the high-dimensional hyperspectral-image data set is obtained with the training data set. A local curvature varia- tion algorithm is utilized to sample a subset of data points as landmarks. Then a manifold skeleton is identified based on the landmarks. Our method is validated on three AVIRIS hyperspectral data sets, outperforming the comparison algorithms with a k–nearest-neighbor classifier and achieving the second best performance with support vector machine.

A Framework for Homogeneous Cross-Project Defect Prediction

2021 ◽  
Vol 9 (1) ◽  
pp. 52-68
Author(s):  
Lipika Goel ◽  
Mayank Sharma ◽  
Sunil Kumar Khatri ◽  
D. Damodaran
Keyword(s):  
Class Imbalance ◽  
The Other ◽  
Training Data ◽  
Defect Prediction ◽  
Rank Test ◽  
Ensemble Model ◽  
Class Imbalance Problem ◽  
Imbalance Problem ◽  
Proposed Model ◽  
Cross Project

Often, the prior defect data of the same project is unavailable; researchers thought whether the defect data of the other projects can be used for prediction. This made cross project defect prediction an open research issue. In this approach, the training data often suffers from class imbalance problem. Here, the work is directed on homogeneous cross-project defect prediction. A novel ensemble model that will perform in dual fold is proposed. Firstly, it will handle the class imbalance problem of the dataset. Secondly, it will perform the prediction of the target class. For handling the imbalance problem, the training dataset is divided into data frames. Each data frame will be balanced. An ensemble model using the maximum voting of all random forest classifiers is implemented. The proposed model shows better performance in comparison to the other baseline models. Wilcoxon signed rank test is performed for validation of the proposed model.

scholarly journals Business Intelligence using the K-Nearest Neighbor Algorithm to Analyze Customer Behavior in Online Crowdfunding Systems

2020 ◽  
Vol 202 ◽  
pp. 16005
Author(s):  
Chashif Syadzali ◽  
Suryono Suryono ◽  
Jatmiko Endro Suseno
Keyword(s):  
Business Intelligence ◽  
Nearest Neighbor ◽  
Customer Behavior ◽  
Training Data ◽  
Business Strategies ◽  
Intelligence Analysis ◽  
K Nearest Neighbor ◽  
Nearest Neighbor Algorithm ◽  
K Nearest Neighbor Algorithm

Customer behavior classification can be useful to assist companies in conducting business intelligence analysis. Data mining techniques can classify customer behavior using the K-Nearest Neighbor algorithm based on the customer's life cycle consisting of prospect, responder, active and former. Data used to classify include age, gender, number of donations, donation retention and number of user visits. The calculation results from 2,114 data in the classification of each customer’s category are namely active by 1.18%, prospect by 8.99%, responder by 4.26% and former by 85.57%. System accuracy using a range of K from K = 1 to K = 20 produces that the highest accuracy is 94.3731% at a value of K = 4. The results of the training data that produce a classification of user behavior can be used as a Business Intelligence analysis that is useful for companies in determining business strategies by knowing the target of optimal market.

An Investigation of Imbalanced Ensemble Learning Methods for Cross-Project Defect Prediction

2019 ◽  
Vol 33 (12) ◽  
pp. 1959037 ◽  
Author(s):  
Shaojian Qiu ◽  
Lu Lu ◽  
Siyu Jiang ◽  
Yang Guo
Keyword(s):  
Ensemble Learning ◽  
Class Imbalance ◽  
Training Data ◽  
Defect Prediction ◽  
Class Imbalance Problem ◽  
Learning Methods ◽  
Imbalance Problem ◽  
Intelligent Software ◽  
Under Sampling ◽  
Cross Project

Machine-learning-based software defect prediction (SDP) methods are receiving great attention from the researchers of intelligent software engineering. Most existing SDP methods are performed under a within-project setting. However, there usually is little to no within-project training data to learn an available supervised prediction model for a new SDP task. Therefore, cross-project defect prediction (CPDP), which uses labeled data of source projects to learn a defect predictor for a target project, was proposed as a practical SDP solution. In real CPDP tasks, the class imbalance problem is ubiquitous and has a great impact on performance of the CPDP models. Unlike previous studies that focus on subsampling and individual methods, this study investigated 15 imbalanced learning methods for CPDP tasks, especially for assessing the effectiveness of imbalanced ensemble learning (IEL) methods. We evaluated the 15 methods by extensive experiments on 31 open-source projects derived from five datasets. Through analyzing a total of 37504 results, we found that in most cases, the IEL method that combined under-sampling and bagging approaches will be more effective than the other investigated methods.

scholarly journals Identification of Leukemia Subtypes from Microscopic Images Using Convolutional Neural Network

Diagnostics ◽  
2019 ◽  
Vol 9 (3) ◽  
pp. 104 ◽  
Author(s):  
Ahmed ◽  
Yigit ◽  
Isik ◽  
Alpkocak
Keyword(s):  
Machine Learning ◽  
Data Augmentation ◽  
Nearest Neighbor ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Training Data ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Data Set ◽  
Leukemia Data

Leukemia is a fatal cancer and has two main types: Acute and chronic. Each type has two more subtypes: Lymphoid and myeloid. Hence, in total, there are four subtypes of leukemia. This study proposes a new approach for diagnosis of all subtypes of leukemia from microscopic blood cell images using convolutional neural networks (CNN), which requires a large training data set. Therefore, we also investigated the effects of data augmentation for an increasing number of training samples synthetically. We used two publicly available leukemia data sources: ALL-IDB and ASH Image Bank. Next, we applied seven different image transformation techniques as data augmentation. We designed a CNN architecture capable of recognizing all subtypes of leukemia. Besides, we also explored other well-known machine learning algorithms such as naive Bayes, support vector machine, k-nearest neighbor, and decision tree. To evaluate our approach, we set up a set of experiments and used 5-fold cross-validation. The results we obtained from experiments showed that our CNN model performance has 88.25% and 81.74% accuracy, in leukemia versus healthy and multiclass classification of all subtypes, respectively. Finally, we also showed that the CNN model has a better performance than other wellknown machine learning algorithms.

Sign in / Sign up

Export Citation Format

Share Document