• Journal of The Korean Association of Information Education
• /
• v.21 no.3
• /
• pp.297-307
• /
• 2017

The purpose of this study is to propose algorithm classification system for algorithm education for Elementary and Secondary Students. We defines the components of the algorithm and expresses the algorithm classification system by the analysis synthesis method. The contents of the study are as follows. First, we conducted a theoretical search on the classification purpose and classification. Second, the contents and limitations of the classification system for the proposed algorithm contents were examined. In addition, we examined the contents and selection criteria of algorithms used in algorithm education research. Third, the algorithm components were redefined using the core idea and crosscutting concept proposed by the NRC. And the crosscutting concept of algorithm is subdivided into algorithm data structure and algorithm design strategy, and its contents are presented using analytic synthesis classification scheme. Finally, the validity of the proposed contents was verified by the review of the expert group. It is expected that the study on the algorithm classification system will provide many implications for the contents selection and training method in the algorithm education.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2001.08a
• /
• pp.173-176
• /
• 2001

이 연구는 계층적 분류체계를 기반으로 자동분류를 수행할 HiCat 알고리즘을 제안한다. HiCat 알고리즘은 DDC 지식베이스의 주제어와 기계학습을 거친 정보를 동시에 이용하고, 각 계층별로 주제적합성가중치를 구해 최종 주제범주를 결정한다. 이 알고리즘이 최적의 성능을 보이는 조건을 알아보고, 일반 분류기와의 성능 비교를 통해 HiCat 알고리즘을 평가해 보았다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.367-370
• /
• 2019

본 논문은 구매이력 데이터에서 상품간의 분류 체계를 고려하여 시퀀스 간의 유사도를 계산하는 새로운 방법을 제안한다. 시퀀스란 두 항목간의 순서가 존재하는 데이터를 의미한다. 항목 간의 선후관계가 중요한 시퀀스 데이터에서는 두 시퀀스 간의 유사도를 정확히 정의하는 것이 중요하다. 본 논문에서는 대표적인 시퀀스 유사도 측정 알고리즘인 편집 거리 알고리즘을 활용하여 구매이력 데이터에서 시퀀스 간의 유사도를 정의한다. 상품은 상품의 특성에 따라 항목 분류 체계에서 여러 범주로 분류된다. 이 경우 기존의 편집 거리 알고리즘에서 문자의 일치유무에 따라 단순히 0 또는 1을 부여하는 것은 부정확하다. 따라서 본 논문은 편집 거리 알고리즘의 수정 연산 중 대체 연산 비용 계산 시 항목 분류 트리를 사용하여 연산 비용이 0 에서 1 사이의 값을 가지도록 세분화하였다. 실험 결과 제안 방법은 대체 연산 비용 계산 시 두 문자가 다르면 단순히 1 을 부여하는 기존의 편집 거리 알고리즘에 비해 시퀀스 간의 유사도를 더 정확하게 계산함을 확인하였다.

• The Journal of Society for e-Business Studies
• /
• v.12 no.3
• /
• pp.193-210
• /
• 2007

In order for a classification system to be useful in every day business environments, it has to reflect peculiar characteristics of enterprises and organizations. By automating the generation process of classification, the overall operation of classification system becomes effective and efficient. However, in order for it to be really useful, human input and interventions are needed from the very beginning phase of the classification generation. This paper proposes an user-guided classification generation algorithm, in which the user inputs a specific level of the classification that she/he wants. Also we propose and implement manipulation operators to tailor the initial classification into the shape that user wants.

• The KIPS Transactions:PartD
• /
• v.14D no.5
• /
• pp.491-500
• /
• 2007

In order to classify and manage on-line trading goods, the product classification scheme must be maintained. In most systems for handling product information, the classification scheme is managed manually by experts, which in general incurs a lot of time and cost. Effective management of classification system becomes more important as rapid development of industry expedites diversity and convergence of goods and services. There have been many researches on developing classification scheme, and continuing in this line of research, this paper proposes a new method for automatic generation of product classification scheme. Our main idea starts from the concept that a product is a set of attributes, and we propose a novel algorithm for automatically creating hierarchical classification scheme by utilizing inclusive relationships between products. We then prove the effectiveness of proposed algorithm by conducting an experiment.

• Annual Conference on Human and Language Technology
• /
• 2009.10a
• /
• pp.1-5
• /
• 2009

상하위 관계 자동 추출은 분류체계를 자동 구축하는 데 있어서 핵심적인 내용이며, 이렇게 자동으로 구축된 분류 체계는 정보 추출과 같은 여러 가지 분야에 있어서 중요하게 사용된다. 본 논문에서는 위키피디아 카테고리 구조로부터 상하위 관계를 추출하는 방식에 대하여 제안한다. 본 논문에서는 판별하고자하는 위키피디아 카테고리 구조뿐만이 아닌, 그와 관련된 다른 위키피디아 카테고리 구조까지 고려하여 카테고리 이름에 나타난 토큰들간의 수식 그래프를 구축한 후, 그래프 분석 알고리즘을 통하여 각 카테고리 구조가 상하위 관계일 가능성에 대한 점수를 매긴다. 실험 결과, 본 알고리즘은 기존의 연구로 상하위 관계임을 판별할 수 없었던 일부 카테고리 구조에 대하여 성공적으로 상하위 관계인지를 판별하였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.5
• /
• pp.545-551
• /
• 2003

Henry System which is a traditional fingerprint classification model is difficult to apply to a modem Automatic Fingerprint Identification System (AFIS). To tackle this problem, this study is to apply algorithm for an An Ensemble Fingerprint Classroom System using changes of gradient of ridge in order to improve precise joining speed of a large volume of database. The existing classification system, Henry System, is useful in a captured fingerprint image of core point and delta point using paper and ink. However, the Henry System is unapplicable in modem Automatic Fingerprint Identification System (AFIS) because of problems such as size of input sensor and way of input. This study is to suggest an Ensemble Fingerprint Classroom System which can classify 5 basic patterns of Henry System in uncaptured delta image using changes of gradient of ridge. The proposed fingerprint classification technique will make an improvement of precise joining speed by reducing data volume.

• Journal of KIISE:Software and Applications
• /
• v.37 no.6
• /
• pp.464-469
• /
• 2010

In this paper, we propose a method to extract isa/instanceOf relation from category structure. Existing researches use lexical patterns to get isa/instanceOf relation from the category structure, e.g. head word matching, to determine whether the given category link is isa/instanceOf relation or not. In this paper, we propose a new approach which analyzes other category links related to the given category link to determine whether the given category link is isa/instanceOf relation or not. The experimental result shows that our algorithm can cover many cases which the existing algorithms were not able to deal with.

• The KIPS Transactions:PartB
• /
• v.16B no.6
• /
• pp.479-488
• /
• 2009

This paper shows a reinforced construction scheme of training data for improvement of text classification by automatic search of boundary category. The documents laid on boundary area are usually misclassified as they are including multiple topics and features. which is the main factor that we focus on. In this paper, we propose an automated exploring methodology of optimal boundary category based on previous research. We consider the boundary area among target categories to new category to be required training, which are then added to the target category sementically. In experiments, we applied our method to complex documents by intentionally making errors in training process. The experimental results show that our system has high accuracy and reliability in noisy environment.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.328-330
• /
• 2004

현재 CC는 하나의 제품으로 이루어진 단일 TOE(Target of Evaluation)를 기준으로 작성된 것이며, 여러 제품으로 이루어진 시스템에 대해서는 다루고 있지 않다. 또한 국ㆍ내외적으로 정보보호제품 분류체계가 서로 달라 표준화가 이루어져야 한다. 이에 본 논문에서는 CC기반 통합제품의 산출 모델 및 평가업무량 알고리즘을 제시하고, 환경에 따른 표준화된 정보보호제품 분류체계를 제시한다.