• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.4
• /
• pp.348-359
• /
• 1989

The multitree pattern recognition algorithm proposed by [1] and [2] is modified in order to improve its performance. The basic idea of the multitree pattern classification algorithm is that the binary dceision tree used to classify an unknow pattern is constructed for each feature and that at each stage, classification rule decides whether to classify the unknown pattern or to extract the feature value according to the feature ordet. So the feature ordering needed in the calssification procedure is simple and the number of features used in the classification procedure is small compared with other classification algorithms. Thus the algorithm can be easily applied to real pattern recognition problems even when the number of features and that of the classes are very large. In this paper, the wighting factor assignment scheme in the decision procedure is modified and various classification rules are proposed by means of the weighting factor. And the branch and bound method is applied to feature subset selection and feature ordering. Several experimental results show that the performance of the multitree pattern classification algorithm is improved by the proposed scheme.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.8
• /
• pp.5280-5287
• /
• 2014

This paper proposes a method in which classes are grouped as a hierarchical tree structure for the effective classification of the Raman spectra. As experimental data, the Raman spectra of 28 chemical compounds were obtained, and pre-treated with noise removal and normalization. The spectra that induced a classification error were grouped into the same class and the hierarchical structure class was composed. Each high and low class was classified using a PCA-MAP method. According to the experimental results, the classification of 100% was achieved with 2.7 features on average when the proposed method was applied. Considering that the same classification rates were achieved with 6 features using the conventional method, the proposed method was found to be much better than the conventional one in terms of the total computational complexity and practical application.

• Journal of Korea Water Resources Association
• /
• v.48 no.11
• /
• pp.945-955
• /
• 2015

The technology of the SWG (Smart Water Grid) as one of most important national projects results in significant assignment that is closely associated with systematic management and effective operation. The individual component technics are required to establish directory and classification for the purpose of effectively managing their information related to research and development (R&D). The national science technology (S&T) standard classification tree which results in the representative example has been established with an intention to manage R&D information, human resource, and budget. It has been also revised every five years and then used in the various fields related to the evaluation, administration, and prediction of the national R&D projects. In addition, the standard classification system for R&D projects has been widely used in the UNESCO (United Nations Educational, Scientific and Cultural Organization) and EU (European Union) since the Frascati Manual was established in the Organization for Economic Cooperation and Development (OECD). Therefore, it is necessary for SWG techniques to develop the standard S&T classification tree for research management and evaluation. For this, it is essential to draw the core techniques for the SWG, which are incorporated with IT (Information Technology), NT (Nano Technology), and BT (Biology Technology).

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.153-162
• /
• 2009

It is a challenging work for service operators to accurately classify different services, which runs on various wireless networks based upon numerous platforms. This works focuses on design and implementation of a classifier, which accurately classifies applications, which are captured horn WiBro Network. Notion of session is introduced for the classifier, instead of commonly used Flow to develop a classifier. Based on session information of given traffic, two classification algorithms are presented, Classification and Regression Tree and Support Vector Machine. Both algorithms are capable of classifying accurately and effectively with misclassification rate of 0.85%, and 0.94%, respectively. This work shows that classifier using CART provides ease of interpreting the result and implementation.

• 한국데이터정보과학회:학술대회논문집
• /
• 2004.10a
• /
• pp.63-75
• /
• 2004

The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. We analyze Gyeongnam social indicator survey data using decision tree techniques for environmental information. We can use these decision tree outputs for environmental preservation and improvement.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.4
• /
• pp.759-771
• /
• 2004

The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. We analyze Gyeongnam social indicator survey data using decision tree techniques for environmental information. We can use these decision tree outputs for environmental preservation and improvement.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.543-550
• /
• 2005

Demand for better services in the Internet has been increasing due to the rapid growth of the Internet, and hence next generation routers are required to perform intelligent packet classification. For a given classifier defining packet attributes or contents, packet classification is the process of identifying the highest priority rule to which a packet conforms. A notable characteristic of real classifiers is that a packet matches only a small number of distinct source-destination prefix pairs. Therefore, a lot of schemes have been proposed to filter rules based on source and destination prefix pairs. However, most of the schemes are based on sequential one-dimensional searches using trio which requires huge memory. In this paper, we proposea memory-efficient two-dimensional search scheme using source and destination prefix pairs. By constructing binary prefix tree, source prefix search and destination prefix search are simultaneously performed in a binary tree. Moreover, the proposed two-dimensional binary prefix tree does not include any empty internal nodes, and hence memory waste of previous trio-based structures is completely eliminated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5C
• /
• pp.514-522
• /
• 2003

Contrary to the previous methods, in this paper, we propose an enhanced shot change detection method using multiple features and binary decision tree. The previous methods usually used single feature and fixed threshold between consecutive frames. However, contents such as color, shape, background, and texture change simultaneously at shot change points in a video sequence. Therefore, in this paper, we detect the shot changes effectively using multiple features, which are supplementary each other, rather than using single feature. In order to classify the shot changes, we use binary classification tree. According to this classification result, we extract important features among the multiple features and obtain threshold value for each feature. We also perform the cross-validation and droop-case to verify the performance of our method. From an experimental result, it was revealed that the EI of our method performed average of 2% better than that of the conventional shot change detection methods.

• Korean Journal of Remote Sensing
• /
• v.35 no.6_2
• /
• pp.1037-1052
• /
• 2019

We had developed in preceding study a classification model for the Korean pine and Larch with an accuracy of 98 percent using Hyperion and Sentinel-2 satellite images, texture information, and geometric information as the first step for tree species mapping in the inaccessible North Korea. Considering a share of major tree species in North Korea, the classification model needs to be expanded as it has a large share of Oak(29.5%), Pine (12.7%), Fir (8.2%), and as well as Larch (17.5%) and Korean pine (5.8%). In order to classify 5 major tree species, national forest type map of South Korea was used to build 11,039 training and 2,330 validation data. Sentinel-2 data was used to derive spectral information, and PlanetScope data was used to generate texture information. Geometric information was built from SRTM DEM data. As a machine learning algorithm, Random forest was used. As a result, the overall accuracy of classification was 80% with 0.80 kappa statistics. Based on the training data and the classification model constructed through this study, we will extend the application to Mt. Baekdu and North and South Goseong areas to confirm the applicability of tree species classification on the Korean Peninsula.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.56-62
• /
• 2008

This paper proposes the use of decision tree classification for the measuring pattern recognition from industrial Computed Radiography(CR) images used in nondestructive evaluation(NDE) of steel-tubes. It appears that NDE problems are naturally desired to have machine learning techniques identify patterns and their classification. The attributes of decision tree are taken from NDE test procedure. Geometric features, such as radiative angle, gradient and distance, are estimated from the analysis of input image data. These factors are used to make it easy and accurate to classify an input object to one of the pre-specified classes on decision tree. This algerian is to simplify the characterization of NDE results and to facilitate the determination of features. The experimental results verify the usefulness of proposed algorithm.