• Proceedings of the Korea Water Resources Association Conference
• /
• 2012.05a
• /
• pp.198-198
• /
• 2012

본 연구에서는 서울지방의 최근 10년간 우기시 강우자료를 이용하여 시공간패턴에 따른 강수의 변화를 분석하였다. 이를 위하여 GIS 기법, 강우사상 구분법 및 공간의 상관성 분석 등을 적용하였다. 본 연구의 대상지역인 서울은 북위 $37^{\circ}$34', 동경 $126^{\circ}$59' 부근에 위치하며 남북방향으로 30.3 km, 동서방향으로 36.8km에 걸쳐 있으며 그 면적은 약 $605.41km^2$이다. 또 서울 중앙에서는 한강이 동쪽에서 서쪽으로 흐르며 서울을 강북과 강남으로 양분하고 있으며, 서울을 관통하고 있는 한강으로 수많은 지천이 합류하고 있다. 이러한 지리적 특성들로 인하여 서울 지역의 기후는 매우 복잡한 양상을 나타내고 있다. 과거에는 서울지역에 강우관측소의 수가 매우 적어 이러한 현상을 분석하는데 한계가 있었으나 최근에 자동기상관측소(AWS)들의 확충으로 인하여 자료의 양이 넓어졌다. 본 연구에서는 이러한 자료들을 사용하여 강수의 시공간 패턴을 분석하고자 한다. 이를 위하여 강수의 사상을 구분하기 위한 방법인 IETD법(Inter Event Time Definition)을 적용하였으며, 요인분석 및 군집분석을 이용하여 서울의 강수 지역 구분 및 패턴 분석을 실시하였다. 이러한 분석을 통하여 최종적으로 최근 10년간 서울지방의 강수의 시공간 패턴을 제시하고자 하였다.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.49-63
• /
• 2009

The performance of spatio-temporal moving pattern mining depends on how to analyze and process the huge set of spatio-temporal data due to the nature of it. The several method was presented in order to solve the problems in which existing spatio-temporal moving pattern mining methods[1-10] have, such as increasing execution time and required memory size during the pattern mining, but they did not solve properly yet. Thus, we proposed the STMP/MST method[11] as a preceding research in order to extract effectively sequential and/or periodical frequent occurrence moving patterns from the huge set of spatio-temporal moving data. The proposed method reduces patterns mining execution time, using the moving sequence tree based on hash tree. And also, to minimize the required memory space, it generalizes detailed historical data including spatio-temporal attributes into the real world scopes of space and time by using spatio-temporal concept hierarchy. In this paper, in order to verify the effectiveness of the STMP/MST method, we compared and analyzed performance with existing spatio-temporal moving pattern mining methods based on the quantity of mining data and minimum support factor.

• The KIPS Transactions:PartD
• /
• v.16D no.2
• /
• pp.237-248
• /
• 2009

Recently, based on dynamic location or mobility of moving object, many researches on pattern mining methods actively progress to extract more available patterns from various moving patterns for development of location based services. The performance of moving pattern mining depend on how analyze and process the huge set of spatio-temporal data. Some of traditional spatio-temporal pattern mining methods[1-6,8-11]have proposed to solve these problem, but they did not solve properly to reduce mining execution time and minimize required memory space. Therefore, in this paper, we propose new spatio-temporal pattern mining method which extract the sequential and periodic frequent moving patterns efficiently from the huge set of spatio-temporal moving data. The proposed method reduces mining execution time of $83%{\sim}93%$ rate on frequent moving patterns mining using the moving sequence tree which generated from historical data of moving objects based on hash tree. And also, for minimizing the required memory space, it generalize the detained historical data including spatio-temporal attributes into the real world scope of space and time using spatio-temporal concept hierarchy.

• The Korean Journal of Applied Statistics
• /
• v.19 no.3
• /
• pp.599-617
• /
• 2006

Recently many LBS(Location Based Service) systems are issued in mobile computing systems. Spatial-Temporal Moving Sequence Pattern Mining is a new mining method that mines user moving patterns from user moving path histories in a sensor network environment. The frequent pattern mining is related to the items which customers buy. But on the other hand, our mining method concerns users' moving sequence paths. In this paper, we consider the sequence of moving paths so we handle the repetition of moving paths. Also, we consider the duration that user spends on the location. We proposed new Apriori_msp based on the Apriori algorithm and evaluated its performance results.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.83-86
• /
• 2010

본 논문에서는 시공간 데이터 스트림에서 관심 이벤트를 검출할 수 있고 복잡한 공간 패턴을 감지할 수 있는 시공간 복합 이벤트 처리 시스템을 제안한다. 제안 시스템은 이동 객체 및 정적 객체에서 발생하는 시공간 데이터 스트림에서 스트림 발생시각, 위치 정보와 같은 시공간 정보를 데이터베이스와의 조인을 통해 얻은 관련 속성 정보를 활용하여 이벤트를 검출할 수 있다. 또한, 시공간 정보가 포함된 복잡한 패턴을 처리하기 위해 공간 패턴 연산자를 사용하여 시공간 복합 이벤트를 처리할 수 있다.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1103-1114
• /
• 2003

Currently, one of the most critical issues in developing the service support system for various spatio-temporal applications is the discoverying of meaningful knowledge from the large volume of moving object data. This sort of knowledge refers to the spatiotemporal moving pattern. To discovery such knowledge, various relationships between moving objects such as temporal, spatial and spatiotemporal topological relationships needs to be considered in knowledge discovery. In this paper, we proposed an efficient method, MPMine, for discoverying spatiotemporal moving patterns. The method not only has considered both temporal constraint and spatial constrain but also performs the spatial generalization using a spatial topological operation, contain(). Different from the previous temporal pattern methods, the proposed method is able to save the search space by using the location summarization and generalization of the moving object data. Therefore, Efficient discoverying of the useful moving patterns is possible.

• 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 the Korean Institute of Intelligent Systems
• /
• v.19 no.1
• /
• pp.54-61
• /
• 2009

This paper presents a new electromyogram (EMG) pattern recognition method based on the Hierarchical Temporal Memory (HTM) algorithm which is originally devised for image pattern recognition. In the modified HTM algorithm, a simplified two-level structure with spatial pooler, temporal pooler, and supervised mapper is proposed for efficient learning and classification of the EMG signals. To enhance the recognition performance, the category information is utilized not only in the supervised mapper but also in the temporal pooler. The experimental results show that the ten kinds of hand motion are successfully recognized.

• Journal of Korean Society of Transportation
• /
• v.32 no.5
• /
• pp.522-530
• /
• 2014

Spatio-temporal congestion evolution pattern can be reproduced using the VDS(Vehicle Detection System) historic speed dataset in the TMC(Traffic Management Center)s. Such dataset provides a pool of spatio-temporally experienced traffic conditions. Traffic flow pattern is known as spatio-temporally recurred, and even non-recurrent congestion caused by incidents has patterns according to the incident conditions. These imply that the information should be useful for traffic prediction and traffic management. Traffic flow predictions are generally performed using black-box approaches such as neural network, genetic algorithm, and etc. Black-box approaches are not designed to provide an explanation of their modeling and reasoning process and not to estimate the benefits and the risks of the implementation of such a solution. TMCs are reluctant to employ the black-box approaches even though there are numerous valuable articles. This research proposes a more readily understandable and intuitively appealing data-driven approach and developes an algorithm for identifying congestion patterns for recurrent and non-recurrent congestion management and information provision.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2008.06a
• /
• pp.477-484
• /
• 2008

연쇄 살인과 같은 강력 범죄의 심각성이 사회적 이슈가 되면서 이에 대한 효과적인 과학 수사의 필요성이 증가되고 있다. 특히, 연쇄 범죄 데이타에 대한 공간 분석을 통해 범죄자의 거점 위치를 예측하는 지리적 프로파일링과 미래에 발생될 범행 장소의 위치, 즉 기존 범행에 이어 일어날 다음 범행 위치 예측에 관한 연구가 활발하다. 그러나, 이와 관련된 기존 연구는 물리적인 거리에 대한 통계적 기법을 적용하거나 단순한 공간적 분석만을 적용하므로 낮은 예측 정확도를 보이는 문제점이 있다. 본 논문에서는 이러한 문제를 해결하고 보다 효과적인 연쇄 범죄 수사를 지원하는 방법으로써 연쇄 범죄 발생에 대한 공간적 시간적 분포 특성에 따른 시공간 패턴을 기반으로 다양한 시공간 분석을 적용하는 거점 위치 예측 기법과 다음 범행 위치 예측 기법을 제안한다. 제안 기법은 중심축을 따라 나타나는 선형 분포의 연쇄 범죄에서도 정확도 높은 예측이 가능하고, 다수의 서로 다른 군집들에 대해 각 군집내 범행에 대한 지역적 예측과 대상 영역의 모든 범행에 대한 전역적 예측이 가능하다. 또한 방향 패턴을 활용하여 다음 범행 위치 예측 정확도도 개선하였다.