• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.649-661
• /
• 1998

If there is redeveloping into the system applying the object-oriented paradigm, productivity Improvement of software through reuse would be accomplished and maintenance cost be reduced. When a procedure-oriented system is transformed to a type applying the object-oriented paradigm, various techniques are studied to extract objects from source code automatically or semi-automatically. However, it is not easy to extract conceptuat objects when those techniques are applied, This problem entails another problem which drops the conceptual integrity of the extracted objects. In this paper, we suggest an object extraction method and tool development to resolve the problem occurring at the time when thc pr"~r"m, dcveloped through procedure-oriented is transformed to an object-oriented system. The suggested method allow to extract the desired objects using object modeling for various application domains of the real world given source code and design recovery information. During the extraction process, functionality and global variables of the source code as well as its intcrface arc rigorously analyzed. This process can enhance the conceptual integrity of the objects and make easy to construct class hierarchies.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1733-1748
• /
• 1997

In this paper, we propose the classification scheme and retrieval mechanism which can apply to many application domains in order to construct the software reuse library. Classification scheme which is the core of the accessibility in the reusability, is defined by the hierarchical structure using the agglomerative clusters. Agglomerative cluster means the group of the reuse component by the functional relationships. Functional relationships are measured by the HACM which is the representation method about software components to calculate the similarities among the classes in the particular domain. And clustering informations are added to the library structure which determines the functionality and accuracy of the retrieval system. And the system stores the classification results such as the index information with the weights, the similarity matrix, the hierarchical structure. Therefore users can retrieve the software component using the query which is the natural language. The thesis is studied to focus on the findability of software components in the reuse library. As a result, the part of the construction process of the reuse library was automated, and we can construct the object-oriented reuse library with the extendibility and relationship about the reuse components. Also the our process is visualized through the browse hierarchy of the retrieval environment, and the retrieval system is integrated to the reuse system CARS 2.1.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.12
• /
• pp.445-452
• /
• 2022

Class distribution of unbalanced data is an important part of the digital world and is a significant part of cybersecurity. Abnormal activity of unbalanced data should be found and problems solved. Although a system capable of tracking patterns in all transactions is needed, machine learning with disproportionate data, which typically has abnormal patterns, can ignore and degrade performance for minority layers, and predictive models can be inaccurately biased. In this paper, we predict target variables and improve accuracy by combining estimates using Synthetic Minority Oversampling Technique (SMOTE) and Light GBM algorithms as an approach to address unbalanced datasets. Experimental results were compared with logistic regression, decision tree, KNN, Random Forest, and XGBoost algorithms. The performance was similar in accuracy and reproduction rate, but in precision, two algorithms performed at Random Forest 80.76% and Light GBM 97.16%, and in F1-score, Random Forest 84.67% and Light GBM 91.96%. As a result of this experiment, it was confirmed that Light GBM's performance was similar without deviation or improved by up to 16% compared to five algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.249-251
• /
• 2022

In this paper, we present machine learning to control drone flight using EEG signals. We defined takeoff, forward, backward, left movement and right movement as control targets and measured EEG signals from the frontal lobe for controlling using Fp1. Fp2 Fp2 two-channel dry electrode (NeuroNicle FX2) measuring at 250Hz sampling rate. And the collected data were filtered at 6~20Hz cutoff frequency. We measured the motion image of the action associated with each control target open for 5.19 seconds. Using Matlab's classification learner for the measured EEG signal, the triple layer neural network, logistic regression kernel, nonlinear polynomial Support Vector Machine(SVM) learning was performed, logistic regression kernel was confirmed as the highest accuracy for takeoff and forward, backward, left movement and right movement of the drone in learning by class True Positive Rate(TPR).

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.3
• /
• pp.111-118
• /
• 2008

In this paper, we propose a new automatic taxonomy generation algorithm for the audio genre classification. The proposed algorithm automatically generates hierarchical taxonomy based on the estimated classification accuracy at all possible nodes. The estimation of classification accuracy in the proposed algorithm is conducted by applying the training data to classifier using k-fold cross validation. Subsequent classification accuracy is then to be tested at every node which consists of two clusters by applying one-versus-one support vector machine. In order to assess the performance of the proposed algorithm, we extracted various features which represent characteristics such as timbre, rhythm, pitch and so on. Then, we investigated classification performance using the proposed algorithm and previous flat classifiers. The classification accuracy reaches to 89 percent with proposed scheme, which is 5 to 25 percent higher than the previous flat classification methods. Using low-dimensional feature vectors, in particular, it is 10 to 25 percent higher than previous algorithms for classification experiments.

• Journal of the Institute of Convergence Signal Processing
• /
• v.24 no.4
• /
• pp.186-191
• /
• 2023

Data processing techniques play a critical role in decision-making, including handling missing and outlier data, prediction, and recommendation models. This requires a clear explanation of the validity, reliability, and accuracy of all processes and results. In addition, it is necessary to solve data problems through explainable models using decision trees, inference, etc., and proceed with model lightweight by considering various types of learning. The multi-layer mining classification method that applies the sixth principle is a method that discovers multidimensional relationships between variables and attributes that occur frequently in transactions after data preprocessing. This explains how to discover significant relationships using mining on transactions and model the data through regression analysis. It develops scalable models and logistic regression models and proposes mining techniques to generate class labels through data cleansing, relevance analysis, data transformation, and data augmentation to make explanatory decisions.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.102-116
• /
• 2006

Electronic catalogs (or e-catalogs) hold information about the goods and services offered or requested by the participants, and consequently, form the basis of an e-commerce transaction. Catalog management is complicated by a number of factors and product classification is at the core of these issues. Classification hierarchy is used for spend analysis, custom3 regulation, and product identification. Classification is the foundation on which product databases are designed, and plays a central role in almost all aspects of management and use of product information. However, product classification has received little formal treatment in terms of underlying model, operations, and semantics. We believe that the lack of a logical model for classification Introduces a number of problems not only for the classification itself but also for the product database in general. It needs to meet diverse user views to support efficient and convenient use of product information. It needs to be changed and evolved very often without breaking consistency in the cases of introduction of new products, extinction of existing products, class reorganization, and class specialization. It also needs to be merged and mapped with other classification schemes without information loss when B2B transactions occur. For these requirements, a classification scheme should be so dynamic that it takes in them within right time and cost. The existing classification schemes widely used today such as UNSPSC and eClass, however, have a lot of limitations to meet these requirements for dynamic features of classification. In this paper, we try to understand what it means to classify products and present how best to represent classification schemes so as to capture the semantics behind the classifications and facilitate mappings between them. Product information implies a plenty of semantics such as class attributes like material, time, place, etc., and integrity constraints. In this paper, we analyze the dynamic features of product databases and the limitation of existing code based classification schemes. And describe the semantic classification model, which satisfies the requirements for dynamic features oi product databases. It provides a means to explicitly and formally express more semantics for product classes and organizes class relationships into a graph. We believe the model proposed in this paper satisfies the requirements and challenges that have been raised by previous works.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.6
• /
• pp.28-39
• /
• 2010

The study aims at offering a solution to the problems of transmission delay and data throughput decrease as the number of contending On-Board Units (OBU) increases by applying CSMA medium access control protocol based upon IEEE 802.11p. In a competition-based medium, contention probability becomes high as OBU increases. In order to improve the performance of this medium access layer, the author proposes EDCA which a adaptive adjustment of the Contention Windows (CW) considering traffic density and data type. EDCA applies fixed values of Minimum Contention Window (CWmin) and Maximum Contention Window (CWmax) for each of four kinds of Access Categories (AC) for channel-specific service differentiation. EDCA does not guarantee the channel-specific features and network state whereas it guarantees inter-AC differentiation by classifying into traffic features. Thus it is not possible to actively respond to a contention caused by network congestion occurring in a short moment in channel. As a solution, CWminAS(CWmin Adaptation Scheme) and ACATICT(Adaptive Contention window Adjustment Technique based on Individual Class Traffic) are proposed as active CW control techniques. In previous researches, the contention probabilities for each value of AC were not examined or a single channel based AC value was considered. And the channel-specific demands of IEEE 802.11p and the corresponding contention probabilities were not reflected in the studies. The study considers the collision number of a previous service section and the current network congestion proposes a dynamic control technique ACCW(Adaptive Control of Contention windows in considering the WAVE situation) for CW of the next channel.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.231-242
• /
• 2008

W3C has selected OWL as a standard for Web ontology description and a necessity of research on storage models that can store OWL ontologies effectively has been issued. Until now, relational model-based storage systems such as Jena, Sesame, and DLDB, have been developed, but there still remain several issues. Especially, they lead inefficient query processing performance. The structural problems of their low query processing performance are as follow: Jena has a simple structure which is not normalized and also stores most information in a single table. It exponentially decreases the performance because of comparison with unnecessary information for processing queries requiring join operations as well as simple search. The structures of storages(e.g., Sesame) have been completely normalized. Therefore it executes many join operations for query processing. The storages require many join operations to find simply a specific class. This paper proposes a storage model to resolve the problems that the query processing performance is decreased because of non-normalization or complete normalization of the existing storages. To achieve this goal, we analyze the problems of existing storage models as well as relations of OWL elements and query patterns. The proposed model, defined with the analysis results, provides an optimal normalized structure to minimize join operations or unnecessary information comparison. For the experiment of query processing performance, a LUBM data sets are used and query patterns are defined considering search targets and their hierarchical relations. In addition, this paper conducts experiments on correctness and completeness of query results to verify data loss of the proposed model, and the results are described. With the comparative evaluation results, our proposal showed a better performance than the existing storage models.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.113-123
• /
• 2012

Recently, various attempts have been made to apply Intelligent Transportation System under various environments and conditions. Consequently, an accurate license plate recognition regardless of vehicle location and viewing angle is required. In this paper, we propose a novel license plate recognition system which exploits a) the format of license plates to remove false candidates of license plates and to extract characters in license plates and b) the characteristics of Hangul for accurate character recognition. In order to eliminate false candidates of license plates, the proposed method first aligns the candidates of license plates horizontally, and compares the position and the shape of objects in each candidate with the prior information of license plates provided by Korean Ministry of Construction & Transportation. The prior information such as aspect ratio, background color, projection image is also used to extract characters in license plates accurately applying an improved local binarization considering luminance variation of license plates. In case of recognizing Hangul in license plates, they are initially grouped according to their shape similarity. Then a super-class method, a hierarchical analysis based on key feature points is applied to recognize Hangul accurately. The proposed method was verified with high recognition rate regardless of background image, which eventually proves that the proposed LPR system has high performance regardless of the vehicle location or viewing angle.