• Journal of Korean Society for Geospatial Information Science
• /
• v.18 no.4
• /
• pp.61-69
• /
• 2010

The collapse of a slope or cut embankment brings much damage to life and property. Accordingly, it is very important to analyze the spatial distribution by calculating the landslide susceptibility in the estimation of the risk of landslide occurrence. The heuristic, statistic, deterministic, and probabilistic methods have been introduced to make landslide susceptibility maps. In many cases, however, the reliability is low due to insufficient field data, and the qualitative experience and knowledge of experts could not be combined with the quantitative mechanical?analysis model in the existing methods. In this paper, new modeling method for a probabilistic landslide susceptibility analysis combined Bayesian Network with ontology model about experts' knowledge and spatial data was proposed. The ontology model, which was made using the reasoning engine, was automatically converted into the Bayesian Network structure. Through conditional probabilistic reasoning using the created Bayesian Network, landslide susceptibility with uncertainty was analyzed, and the results were described in maps, using GIS. The developed Bayesian Network was then applied to the test-site to verify its effect, and the result corresponded to the landslide traces boundary at 86.5% accuracy. We expect that general users will be able to make a landslide susceptibility analysis over a wide area without experts' help.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.2
• /
• pp.443-451
• /
• 2000

Until now, there have been various kinds of science information databsae which databased the science technology information, but they do not satisfy the aspiration of the users. Therefore, in the position of the users, it suggests the technology information space as a now paradigm, which supplement the function of science information DB. ICPIS which inputs described papers with keywords, offers the itemized summary of these contents, the visual indication and comparison of similar thesis, and it also supplises the abundant summary information, survey information, more than ten volumes of info communication thesis with starting the casual relation extraction for the users, playing a significant role in ICPIS is called KP, and it is package of domain knowledge that unifies the extraction and structure narration of the technology information. ICPIS extracts the technology information among the thesis that are deserved by the natural language treatment in the itemized KP keywords described, and form the prescribed summary structure in KP.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.39-52
• /
• 2006

With the recent the use of spatio-temporal data mining which can extract various knowledge such as movement patterns of moving objects in history data of moving object gets increasing. However, the existing movement pattern extraction methods create lots of candidate movement patterns when the minimum support is low. Therefore, in this paper, we suggest the STMPE(Spatio-Temporal Movement Pattern Extraction) algorithm in order to efficiently extract movement patterns of moving objects from the large capacity of spatio-temporal data. The STMPE algorithm generalizes spatio-temporal and minimizes the use of memory. Because it produces and keeps short-term movement patterns, the frequency of database scan can be minimized. The STMPE algorithm shows more excellent performance than other movement pattern extraction algorithms with time information when the minimum support decreases, the number of moving objects increases, and the number of time division increases.

• Journal of Internet Computing and Services
• /
• v.21 no.3
• /
• pp.123-131
• /
• 2020

Along with the rapid development of artificial intelligence technology, natural language processing, which deals with human language, is also actively studied. In particular, BERT, a language model recently proposed by Google, has been performing well in many areas of natural language processing by providing pre-trained model using a large number of corpus. Although BERT supports multilingual model, we should use the pre-trained model using large amounts of Korean corpus because there are limitations when we apply the original pre-trained BERT model directly to Korean. Also, text contains not only vocabulary, grammar, but contextual meanings such as the relation between the front and the rear, and situation. In the existing natural language processing field, research has been conducted mainly on vocabulary or grammatical meaning. Accurate identification of contextual information embedded in text plays an important role in understanding context. Knowledge graphs, which are linked using the relationship of words, have the advantage of being able to learn context easily from computer. In this paper, we propose a system to extract Korean contextual information using pre-trained BERT model with Korean language corpus and knowledge graph. We build models that can extract person, relationship, emotion, space, and time information that is important in the text and validate the proposed system through experiments.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1289-1296
• /
• 1997

To build up a knowledge-based system in an Artifical Inerligence System, selecting an appropriate set of rules is one of the key provlems. In this paper, we discuss a new method for exteacting fuzzy rules diredtly from fuzzy membdrchip function dat for pattern classifcation. The fuzzy rules with variable fuzzy recions are defined by sharing fuzzy space in fuzzy grid.Tehse rules are extracted form memberchop function. Them, optimal input vari-ables for the rules are determined using the number of extracted rules as a criterion. The method is compared with neural networks using Ishibuchi. Finally, in order to demonstrate the cffectiveness of the present method, simulation results are shown.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.11a
• /
• pp.413-416
• /
• 2006

최근 위치 측위 기술의 발달 및 GPS 기술의 상용화로 인해 무선 통신 기기의 보급이 증가하면서 다양한 위치 기반 서비스 개발을 위한 노력이 활발히 진행되고 있다. 사용자들의 특성에 맞게 개인화되고 세분화된 위치 기반 서비스를 제공하기 위해서는 방대한 이동 객체의 위치 이동 데이터로부터 의미있는 지식인 유용한 패턴을 추출하기 위한 시간 패턴 탐사가 필요하다. 기존의 시간 패턴 탐사 기법들 중 일부는 이동 객체의 시간에 따른 공간 속성들의 변화를 충분히 고려하지 못하거나 또는 시공간 속성을 동시에 고려한 패턴 탐사는 가능하나 전체 이동 패턴들 중 추출하고자 하는 패턴에 반드시 포함되어야 하는 공간 정보에 대한 제약이 없어 특정 지점들 사이의 최적 이동 경로 탐색 문제나 단위기간 동안 이동 객체가 순회해야 지점들에 대한 스케줄링 경로 예측 문제 등에 적용하기 어렵다. 따라서 본 논문에서는 이동 객체의 위치 이력 데이터들에 대한 시공간 속성들을 고려하여 다양한 이동 패턴들 중 객체의 최적 이동 경로에 해당하는 패턴을 탐색하기 위한 새로운 시간 패턴 마이닝 알고리즘을 제안한다. 제안된 알고리즘은 특정한 지점들 사이를 이동한 객체의 위치 데이터들 중 객체가 가장 빈번하게 이동한 경로를 탐색하여 최적 경로를 결정하는 알고리즘으로, 공간 추상 계층의 각 계층별 영역 내 포함여부를 고려한 위치 일반화를 수행하여 보다 효과적으로 이동 패턴을 탐색할 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.367-372
• /
• 2008

최근 사용자들의 특성에 맞게 개인화되고 세분화된 위치 기반 서비스를 개발하기 위한 목적으로 이동 객체의 다양한 패턴들 중 의미있는 지식인 유용한 이동 패턴을 탐사하는 문제가 주요 이슈로 부각되고 있다. 이에 본 논문에서는 방대한 이동 객체의 이력 데이터 집합으로부터 특정 지점들 간의 최적 이동 경로나 정해진 시간내의 스케줄링 경로 탐색과 같이 복합적인 시간 및 공간 제약을 갖는 최적 이동 패턴을 탐사하는 문제에 대해 정의하고, 다양한 이동 패턴들 중 가장 빈발하게 발생하는 패턴이 최적의 비용을 소요할 것이라는 가정을 기반으로 최대 빈발 2-시퀀스를 추출하는 방법을 제안한다. 후보 시퀀스 집합으로부터 지지도 계산을 통해 추출되는 빈발 2-시퀀스들의 순차적인 조합은 패턴 탐사를 수행하는 각 패스 진행 시 후보 시퀀스 항목의 차수가 점차 감소하여 최적 이동 패턴 탐사 방법에 효과적으로 적용된다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11c
• /
• pp.1709-1712
• /
• 2002

지식 탐사 연구의 핵심이 되어온 데이터 마이닝은 축적 데이터로부터 쉽게 추출되지 않는 데이터 상호관계나 일정 패턴과 같은 유용한 내재 정보 추출을 주된 목적으로 수행된다. 그러나, 데이터 마이닝은 대용량의 데이터 처리로 인해 빈번한 메모리 공간 제약과 처리 속도 저하 등의 한계성을 드러낸다. 이를 극복하기 위해 많은 마이닝 알고리즘 개발과 기존 알고리즘 개선 방법이 제시되어 왔으나 여전히 궁극적인 해결방안은 대두되지 않고 있다. 따라서, 만약 데이터 전처리 과정을 통해 마이닝 목적에 적합한 부분 데이터집합 추출 및 가공이 선행된다면 보다 효율적인 데이터 마이닝 작업을 유도할 수 있을 것이다. 본 논문은 효과적 데이터 전처리를 위한 필수 기본 연산 기능들을 주어진 데이터집합의 트랜잭션 및 데이터 특성에 기초하여 관계형 대수 형태로 의미를 정립하고, 적용 사례에 의한 상세 설명 및 실제 구현된 온라인 데이터 전처리 시스템을 제안한다.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.7 no.1
• /
• pp.55-60
• /
• 2014

In this paper, we proposed a method for face region extraction by skin-color hue, saturation and facial feature extraction in natural images. The proposed algorithm is composed of lighting correction and face detection process. In the lighting correction step, performing correction function for a lighting change. The face detection process extracts the area of skin color by calculating Euclidian distances to the input images using as characteristic vectors color and chroma in 20 skin color sample images. Eye detection using C element in the CMY color model and mouth detection using Q element in the YIQ color model for extracted candidate areas. Face area detected based on human face knowledge for extracted candidate areas. When an experiment was conducted with 10 natural images of face as input images, the method showed a face detection rate of 100%.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.2 no.3
• /
• pp.79-86
• /
• 2009

This study proposed a method of detecting the facial area by calculating Euclidian distances among skin color elements and extracting the characteristics of the face. The proposed algorithm is composed of light calibration and face detection. The light calibration process performs calibration for the change of light. The face detection process extracts the area of skin color by calculating Euclidian distances to the input images using as characteristic vectors color and chroma in 20 skin color sample images. From the extracted facial area candidate, the eyes were detected in space C of color model CMY, and the mouth was detected in space Q of color model YIQ. From the extracted facial area candidate, the facial area was detected based on the knowledge of an ordinary face. When an experiment was conducted with 40 color images of face as input images, the method showed a face detection rate of 100%.