• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1079-1085
• /
• 2007

This Paper Proposes a new optimization algorithm named by GBNSGA-II(Goal-pareto Based Non-dominated Sorting Genetic Algorithm-II) which uses Goal Programming to find non-dominated solutions in NSGA-II. Although the conventional NSGA is very popular to solve multiobjective optimization problem, its high computational complexity, lack of elitism and difficulty of selecting sharing parameter have been considered as problems to be overcome. To overcome these problems, NSGA-II has been introduced as the alternative for multiobjective optimization algorithm preventing aforementioned defects arising in the conventional NSGA. Together with advantageous features of NSGA-II, this paper proposes rather effective optimization algorithm formulated by purposely combining NSGA-II algorithm with GP (Goal Programming) subject to satisfying multiple objectives as possible as it can. By conducting computer simulations, the superiority of the proposed GBNSGA-II algorithm will be verified in the aspects of the effectiveness on optimization process in presence of a priori constrained goals and its fast converging capability.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.183-192
• /
• 2015

This paper proposes Personal Information Auto Detection(PIAD) System to prevent leakage of Personal informations in document and image files that can be used by mobile service provider. The proposed system is to automatically detect the images and documents that contain personal informations and shows the result to the user. The PIAD is divided into the selection step for fast and accurate retrieval images and analysis which is composed of SURF, erosion and dilation, FindContours algorithm. The result of proposed PIAD system showed more than 98% accuracy by selection and analysis steps, 267 images detection of 272 images.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2005.11a
• /
• pp.199-202
• /
• 2005

TV OSD(On Screen Display) 메뉴 자동검증 시스템에서 다국적 언어의 문자 인식은 표준패턴의 구조적 분석이 쉽지 않을 뿐만 아니라 학습패턴 집합의 규모와 특징의 수가 증가함으로 인하여 특징추출 및 인식 과정에서 방대한 계산량이 요구된다. 이에 본 연구에서는 학습 데이터에 포함되는 다량의 특징 집합으로부터 인식에 필요한 효과적인 특징을 선별함으로써 패턴 분류기의 효율성을 개선하기 위한 방법론을 고찰한다. 이를 위하여 수정된 형태의 Adaboost 기법을 제안하고 이를 적용한 실험 결과로부터 그 유용성을 고찰한다. 제안된 알고리즘은 초기의 특징 집합을 취약한 성능을 갖는 다수의 분류기(classifier)로서 고려하며, 이로부터 반복학습을 통하여 개선된 분류기를 점진적으로 선별해 나가게 된다. 학습의 원리는 주어진 학습패턴 집합에 기초하여 일종의 교사학습(supervised learning) 방식으로 이루어진다. 각 패턴에 할당된 가중치 값은 각 단계에서 산출되는 분류결과에 따라 적응적으로 수정되어 반복학습이 진행됨에 따라 점차 보완적 성능을 갖는 분류기를 선택할 수 있게 한다. 즉, 주어진 각 학습패턴에 대하여 초기에 균등한 가중치가 부여되며, 반복학습의 각 단계에서 적용되는 분류기의 출력을 분석하여 오분류된 패턴의 가중치 분포를 증가시켜 나간다. 본 연구에서는 실제 응용으로서 OSD 메뉴검증 시스템을 대상으로 제안된 이론을 적용하고 그 타당성을 평가한다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2024.01a
• /
• pp.491-492
• /
• 2024

맞벌이 가정이 증가함에 따라 영유아, 장애인, 노인 등의 사회적 약자를 낮시간 동안 보육/보호하는 데이케어 센터의 수요가 증가하고 있다. 데이케어 센터는 센터 경쟁력 확보 및 보호자 만족도 제고를 위해서 피보호자의 일상 사진을 제공하는 곳이 대부분이다. 하지만 데이케어 센터의 직원이 다수의 사람에 대한 사진을 촬영 및 선별해서 메시지를 전송하는 일은 데이케어 센터 본연의 업무를 방해할 수 있다. 따라서 본 논문에서는 사진 선별을 업무 부담을 완화시키는데 도움을 줄 수 있는 얼굴 특징 기반 사진 자동분류하는 시스템을 개발한다. 제안한 방법에서는 얼굴 특징 추출 기법과 클러스터링 알고리즘인 DBSCAN을 이용하여 얼굴기준 사진 분류시스템을 설계하엿다. 특히, OpenCV와 face recognition 라이브러리를 이용하여 카메라로 촬영된 사진 속의 얼굴 객체를 인식하고 얼굴사진을 저정한 후 얼굴의 특징을 추출한다.

• Journal of KIISE:Software and Applications
• /
• v.33 no.12
• /
• pp.1052-1061
• /
• 2006

This paper presents a method of using virtual examples to improve the classification accuracy for data with nominal attributes. Most of the previous researches on virtual examples focused on data with numeric attributes, and they used domain-specific knowledge to generate useful virtual examples for a particularly targeted learning algorithm. Instead of using domain-specific knowledge, our method samples virtual examples from a naive Bayesian network constructed from the given training set. A sampled example is considered useful if it contributes to the increment of the network's conditional likelihood when added to the training set. A set of useful virtual examples can be collected by repeating this process of sampling followed by evaluation. Experiments have shown that the virtual examples collected this way.can help various learning algorithms to derive classifiers of improved accuracy.

• The Korean Journal of Applied Statistics
• /
• v.14 no.1
• /
• pp.91-101
• /
• 2001

It has been shown that the multiple trees predictors are more accurate in reducing test set error than a single tree predictor. There are two ways of generating multiple trees. One is to generate modified training sets by resampling the original training set, and then construct trees. It is known that arcing algorithm is efficient. The other is to perturb randomly the working split at each node from a list of best splits, which is expected to generate reasonably good trees for the original training set. We propose a new combined multiple regression trees predictor which uses the latter multiple regression tree predictor as a predictor based on a modified training set at each stage of arcing. The efficiency of those prediction methods are compared by applying to high throughput screening of chemical compounds for biological effects.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.32 no.5
• /
• pp.518-525
• /
• 2012

In this study, the feasibility of hyperspectral reflectance imaging technique was investigated for the discrimination of viable and non-viable lettuce seeds. The spectral data of hyperspectral reflectance images with the spectral range between 750 nm and 1000 nm were used to develop PLS-DA model for the classification of viable and non-viable lettuce seeds. The discrimination accuracy of the calibration set was 81.6% and that of the test set was 81.2%. The image analysis method was developed to construct the discriminant images of non-viable seeds with the developed PLS-DA model. The discrimination accuracy obtained from the resultant image were 91%, which showed the feasibility of hyperspectral reflectance imaging technique for the mass discrimination of non-viable lettuce seeds from viable ones.

• Information Systems Review
• /
• v.25 no.1
• /
• pp.47-73
• /
• 2023

Management decision-making based on artificial intelligence(AI) plays an important role in helping decision-makers. Business decision-making centered on AI is evaluated as a driving force for corporate growth. AI-based on accurate analysis techniques could support decision-makers in making high-quality decisions. This study proposes an effective decision-making method with the application of multi-label feature selection. In this regard, We present a CFS-BR (Correlation-based Feature Selection based on Binary Relevance approach) that reduces data sets in high-dimensional space. As a result of analyzing sample data and empirical data, CFS-BR can support efficient decision-making by selecting the best combination of meaningful attributes based on the Best-First algorithm. In addition, compared to the previous multi-label feature selection method, CFS-BR is useful for increasing the effectiveness of decision-making, as its accuracy is higher.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.121-126
• /
• 2009

Video poxy server which is located near clients can store the frequently requested video data in storage space in order to minimize initial latency and network traffic significantly. However, due to the limited storage space in video proxy server, an appropriate deletion algorithm is needed to remove the old video data which is not serviced for a long time. Thus, we propose an efficient video data deletion algorithm for video proxy server. The proposed deletion algorithm removes the video which has the lowest request possibility based on the user access patterns. In our algorithm, we arrange the videos which are stored in video proxy server according to the requested time sequence and then, select the video which has the oldest requested time. The selected video is partially removed in order to free up storage space in video poky server. The simulation results show that the proposed algorithm performs better than other algorithms in terms of the block hit rate and the number of block deletion.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.279-300
• /
• 2001

Data mining plays an important role in knowledge discovery process and usually various existing algorithms are selected for the specific purpose of the mining. Currently, data mining techniques are actively to the statistics, business, electronic commerce, biology, and medical area and currently numerous algorithms are being researched and developed for these applications. However, in a long run, only a few algorithms, which are well-suited to specific applications with excellent performance in large database, will survive. So it is reasonable to focus our effort on those selected algorithms in the future. This paper classifies about 30 existing algorithms into 7 categories - association rule, clustering, neural network, decision tree, genetic algorithm, memory-based reasoning, and bayesian network. First of all, this work analyzes systematic hierarchy and characteristics of algorithms and we present 14 criteria for classifying the algorithms and the results based on this criteria. Finally, we propose the best algorithms among some comparable algorithms with different features and performances. The result of this paper can be used as a guideline for data mining researches as well as field applications of data mining.