• Journal of KIISE
• /
• v.44 no.11
• /
• pp.1156-1164
• /
• 2017

Existing studies on automatic bug triage were mostly used the method of designing the prediction system based on the machine learning algorithm. Therefore, it can be said that applying a high-performance machine learning model is the core of the performance of the automatic bug triage system. In the related research, machine learning models that have high performance are mainly used, such as SVM and Naïve Bayes. In this paper, we apply Deep Learning, which has recently shown good performance in the field of machine learning, to automatic bug triage and evaluate its performance. Experimental results show that the Deep Learning based Bug Triage system achieves 48% accuracy in active developer experiments, un improvement of up to 69% over than conventional machine learning techniques.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.2
• /
• pp.143-150
• /
• 2010

Markerless augmented reality system must have the capability to recognize and match natural objects both in indoor and outdoor environment. In this paper, a novel approach is proposed for extracting features and recognizing natural objects using visual descriptors and codebooks. Since the augmented reality applications are sensitive to speed of operation and real time performance, our work mainly focused on recognition of multi-class natural objects and reduce the computing time for classification and feature extraction. SIFT(scale invariant feature transforms) and SURF(speeded up robust feature) are used to extract features from natural objects during training and testing, and their performance is compared. Then we form visual codebook from the high dimensional feature vectors using clustering algorithm and recognize the objects using naive Bayes classifier.

• International Journal of Computer Science & Network Security
• /
• v.23 no.10
• /
• pp.81-88
• /
• 2023

In the present scenario, enormous amounts of data are produced every second. These data also contain private information from sources including media platforms, the banking sector, finance, healthcare, and criminal histories. Data mining is a method for looking through and analyzing massive volumes of data to find usable information. Preserving personal data during data mining has become difficult, thus privacy-preserving data mining (PPDM) is used to do so. Data perturbation is one of the several tactics used by the PPDM data privacy protection mechanism. In Perturbation, datasets are perturbed in order to preserve personal information. Both data accuracy and data privacy are addressed by it. This paper will explore and compare several perturbation strategies that may be used to protect data privacy. For this experiment, two perturbation techniques based on random projection and principal component analysis were used. These techniques include Improved Random Projection Perturbation (IRPP) and Enhanced Principal Component Analysis based Technique (EPCAT). The Naive Bayes classification algorithm is used for data mining approaches. These methods are employed to assess the precision, run time, and accuracy of the experimental results. The best perturbation method in the Nave-Bayes classification is determined to be a random projection-based technique (IRPP) for both the cardiovascular and hypothyroid datasets.

• The KIPS Transactions:PartB
• /
• v.11B no.7 s.96
• /
• pp.849-854
• /
• 2004

This paper proposes an algorithm to enhance the execution time of kNN in the document classification. The proposed algorithm is to enhance the execution time by minimizing the computing cost of the similarity between two documents by using the list of pairs, while the conventional kNN uses the iist of pairs. The 1ist of pairs can be obtained by applying the matrix transposition to the list of pairs at the training phase of the document classification. This paper analyzed the proposed algorithm in the time complexity and compared it with the conventional kNN. And it compared the proposed algorithm with the conventional kNN by using routers-21578 data experimentally. The experimental results show that the proposed algorithm outperforms kNN about $90{\%}$ in terms of the ex-ecution time.

• Smart Structures and Systems
• /
• v.8 no.1
• /
• pp.119-137
• /
• 2011

A bio-inspired two-mode structural health monitoring (SHM) system based on the Na$\ddot{i}$ve Bayes (NB) classification method is discussed in this paper. To implement the molecular biology based Deoxyribonucleic acid (DNA) array concept in structural health monitoring, which has been demonstrated to be superior in disease detection, two types of array expression data have been proposed for the development of the SHM algorithm. For the micro-vibration mode, a two-tier auto-regression with exogenous (AR-ARX) process is used to extract the expression array from the recorded structural time history while an ARX process is applied for the analysis of the earthquake mode. The health condition of the structure is then determined using the NB classification method. In addition, the union concept in probability is used to improve the accuracy of the system. To verify the performance and reliability of the SHM algorithm, a downscaled eight-storey steel building located at the shaking table of the National Center for Research on Earthquake Engineering (NCREE) was used as the benchmark structure. The structural response from different damage levels and locations was collected and incorporated in the database to aid the structural health monitoring process. Preliminary verification has demonstrated that the structure health condition can be precisely detected by the proposed algorithm. To implement the developed SHM system in a practical application, a SHM prototype consisting of the input sensing module, the transmission module, and the SHM platform was developed. The vibration data were first measured by the deployed sensor, and subsequently the SHM mode corresponding to the desired excitation is chosen automatically to quickly evaluate the health condition of the structure. Test results from the ambient vibration and shaking table test showed that the condition and location of the benchmark structure damage can be successfully detected by the proposed SHM prototype system, and the information is instantaneously transmitted to a remote server to facilitate real-time monitoring. Implementing the bio-inspired two-mode SHM practically has been successfully demonstrated.

• Journal of the Korean Society for information Management
• /
• v.24 no.1 s.63
• /
• pp.251-271
• /
• 2007

This paper studies the problem of classifying documents with labeled and unlabeled learning data, especially with regards to using document similarity features. The problem of using unlabeled data is practically important because in many information systems obtaining training labels is expensive, while large quantities of unlabeled documents are readily available. There are two steps In general semi-supervised learning algorithm. First, it trains a classifier using the available labeled documents, and classifies the unlabeled documents. Then, it trains a new classifier using all the training documents which were labeled either manually or automatically. We suggested two types of semi-supervised learning algorithm with regards to using document similarity features. The one is one step semi-supervised learning which is using unlabeled documents only to generate document similarity features. And the other is two step semi-supervised learning which is using unlabeled documents as learning examples as well as similarity features. Experimental results, obtained using support vector machines and naive Bayes classifier, show that we can get improved performance with small labeled and large unlabeled documents then the performance of supervised learning which uses labeled-only data. When considering the efficiency of a classifier system, the one step semi-supervised learning algorithm which is suggested in this study could be a good solution for improving classification performance with unlabeled documents.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.201-203
• /
• 2011

We report an experimental result of applying a data mining algorithm for analyzing the questionnaire results of high school students' views on science-technology-society (HS-VOSTS). The preliminary empirical result of Naive Bayes classifier on HS-VOSTS questionnaire from one South Korean university students indicates that data mining algorithms can be effectively applied to automated knowledge discovery from students' survey data.

• Journal of Computing Science and Engineering
• /
• v.1 no.2
• /
• pp.162-176
• /
• 2007

Machine Learning (ML) has become very popular within Data Mining (KDD) and Artificial Intelligence (AI) research and their applications. In the ML and KDD contexts, two main approaches can be used for inducing a Bayesian Network (BN) from data, namely, Conditional Independence (CI) and the Heuristic Search (HS). When a BN is induced for classification purposes (Bayesian Classifier - BC), it is possible to impose some specific constraints aiming at increasing the computational efficiency. In this paper a new CI based approach to induce BCs from data is proposed and two algorithms are presented. Such approach is based on the Markov Blanket concept in order to impose some constraints and optimize the traditional PC learning algorithm. Experiments performed with the ALARM, as well as other six UCI and three artificial domains revealed that the proposed approach tends to execute fewer comparison tests than the traditional PC. The experiments also show that the proposed algorithms produce competitive classification rates when compared with both, PC and Naive Bayes.

• International Journal of Computer Science & Network Security
• /
• v.21 no.3
• /
• pp.275-286
• /
• 2021

As a result of the vast amount of data that is geographically found in different locations. Distributed data mining (DDM) has taken a center stage in data mining. The use of mobile agents to enhance efficiency in DDM has gained the attention of industries, commerce and academia because it offers serious suggestions on how to solve inherent problems associated with DDM. In this paper, a novel DDM model has been proposed by using a mobile agent to enhance efficiency. The main idea behind the model is to use the Naive Bayes algorithm to give the mobile agent the ability to learn, compare, get and store the results on it from each server which has different datasets and we found that the accuracy increased roughly by 0.9% which is our main target.

• International journal of advanced smart convergence
• /
• v.4 no.2
• /
• pp.20-28
• /
• 2015

In this paper, we propose an effective tracking algorithm with an appearance model based on features extracted from a video frame with posture variation and camera view point adaptation by employing the non-adaptive random projections that preserve the structure of the image feature space of objects. The existing online tracking algorithms update models with features from recent video frames and the numerous issues remain to be addressed despite on the improvement in tracking. The data-dependent adaptive appearance models often encounter the drift problems because the online algorithms does not get the required amount of data for online learning. So, we propose an effective tracking algorithm with an appearance model based on features extracted from a video frame.