• Journal of Internet Computing and Services
• /
• 제10권5호
• /
• pp.79-93
• /
• 2009

For developing the location based service which is individualized and specialized according to the characteristic of the users, the spatio-temporal pattern mining for extracting the meaningful and useful patterns among the various patterns of the mobile object on the spatio-temporal area is needed. Thus, in this paper, as the practical application toward the development of the location based service in which it is able to apply to the real life through the pattern mining from the huge historical data of mobile object, we are proposed STOMP(using Frequency of sequence and Weight) that is the new mining method for extracting the patterns with spatial and temporal constraint based on the problems of mining the optimal moving pattern which are defined in STOMP(F)[25]. Proposed method is the pattern mining method compositively using weighted value(weights) (a distance, the time, a cost, and etc) for our previous research(STOMP(F)[25]) that it uses only the pattern frequent occurrence. As to, it is the method determining the moving pattern in which the pattern frequent occurrence is above special threshold and the weight is most a little bit required among moving patterns of the object as the optimal path. And also, it can search the optimal path more accurate and faster than existing methods($A^*$, Dijkstra algorithm) or with only using pattern frequent occurrence due to less accesses to nodes by using the heuristic moving history.

• Journal of the Korean Data and Information Science Society
• /
• 제27권5호
• /
• pp.1193-1201
• /
• 2016

In epidemiology or etiology, we are often interested in identifying areas of elevated risk, so called, hot spot or cluster. Many existing clustering methods only tend to a result if there exists any clustering pattern in study area. Recently, however, lots of newly introduced clustering methods can identify the location, size, and shape of clusters and test if the clusters are statistically significant as well. In this paper, one of most commonly used clustering methods, scan statistic, and its implementation SaTScan software, which is freely available, will be introduced. To exemplify the usage of SaTScan software, we used cancer data from the SEER program of National Cancer Institute of U.S.A.We aimed to help researchers and practitioners, who are interested in spatial cluster detection, using female lung cancer mortality data of the SEER program.

• Proceedings of the Korea Information Processing Society Conference
• /
• 한국정보처리학회 2012년도 추계학술발표대회
• /
• pp.586-589
• /
• 2012

표절과 관련된 이슈가 주목받고 있는 상황에서 표절을 검출하는 방법에 대한 연구가 활발히 진행되고 있다. 일반적으로 표절구간 검출을 위해 복잡한 자연어처리와 같은 의미론적 접근방법이 아닌 비교적 단순한 어휘기반의 문자열 처리 방법을 사용한다. 대표적인 방법으로는 지문법 (Fingerprinting)과 서열정렬 (Sequence alignment) 등이 있다. 하지만 이 방법들을 이용하여 대용량 문서에 대한 표절검사를 수행하기에는 시공간적 복잡도의 문제가 발생한다. 본 논문에서는 이러한 단점을 극복하기 위해 NGS (Next Generation Sequencing)에서 사용하는 BWT (Burrows-Wheeler Transform)[1]를 이용한 탐색방법을 응용한다. 또한 부분표절구간을 검출하고 정확도를 향상시키기 위해 질의문서를 분할하여 작은 조각으로 만든 뒤, 조각들에 대한 질의탐색을 수행한다. 본 논문에서는 질의문서를 분할하는 두 가지 방법을 소개한다. 두 가지 방법은 k-mer analysis를 이용한 방법과 random-split analysis를 이용한 방법으로, 각 방법의 장단점을 실험을 통해 분석하고 실제 부분표절구간의 검출 정확도를 측정하였다.

• The KIPS Transactions:PartD
• /
• 제15D권2호
• /
• pp.179-186
• /
• 2008

The converge of location-aware devices, GIS functionalities and the increasing accuracy and availability of positioning technologies pave the way to a range of new types of location-based services. The field of spatiotemporal data mining where relationships are defined by spatial and temporal aspect of data is encountering big challenges since the increased search space of knowledge. Therefore, we aim to propose algorithms for mining spatiotemporal patterns in mobile environment in this paper. Moving patterns are generated utilizing two algorithms called All_MOP and Max_MOP. The first one mines all frequent patterns and the other discovers only maximal frequent patterns. Our proposed approach is able to reduce consuming time through comparison with DFS_MINE algorithm. In addition, our approach is applicable to location-based services such as tourist service, traffic service, and so on.

• Journal of Creative Information Culture
• /
• 제6권1호
• /
• pp.41-48
• /
• 2020

In order to represent and process spatial data, hierarchical data structures such as a quadtree or a bintree are used. Various approaches for linearly representing the bintree have been proposed. S-Tree has the advantage of compressing the storage space by expressing binary region image data as a linear binary bit stream, but the higher the resolution of the image, the longer the length of the binary bit stream, the longer the storage space and the lower the search performance. In this paper, we construct a hierarchical structure of multiple separated bintrees with a full binary tree structure and express each bintree as two linear binary bit streams to reduce the range required for image search. It improves the overall search performance by performing a simple number conversion instead of searching directly the binary bit string path. Through the performance evaluation by the worst-case space-time complexity analysis, it was analyzed that the proposed method has better search performance and space efficiency than the previous one.

• The KIPS Transactions:PartD
• /
• 제16D권1호
• /
• pp.1-10
• /
• 2009

One of major purposes of a RFID system is to track moving objects using tags attached to the objects. Because a tagged object has both location and time information expressed as the location of the reader, we can index the trajectory of the object like existing spatiotemporal objects. More efficient tracking may be possible if a spatiotemporal trajectory can be formed of a tag, but there has not been much research on tag trajectory indexes. A characteristic that distinguishes tags from existing spatiotemporal objects is that a tag creates a separate trajectory in each reader by entering and then leaving the reader. As a result, there is a trajectory interruption interval between readers, in which the tag cannot be located, and this makes it difficult to track the tag. In addition, the point tags that only enter and don't leave readers do not create trajectories, so cannot be tracked. To solve this problem, we propose a tag trajectory index called TR-tree (tag trajectory R-tree in RFID system) that can track a tag by combining separate trajectories among readers into one trajectory. The results show that TR-tree, which overcomes the trajectory interruption superior performance than TPIR-tree and R-tree.

• Journal of the Korea Computer Graphics Society
• /
• 제9권3호
• /
• pp.23-29
• /
• 2003

There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of the previous block. If we can obtain useful and enough information from the motion vector of the same coordinate block of the previous frame, the total number of search points used to find the motion vector of the current block may be reduced significantly. In this paper, we propose the block-matching motion estimation using an adaptive initial search point by the predicted motion information from the same block of the previous frame. And the first search point of the proposed algorithm is moved an initial point on the location of being possibility and the searching process after moving the first search point is processed according to the fast search pattern. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved UP to the 1.05dB as depend on the image sequences and improved about 0.33~0.37dB on an average. Search times are reduced about 29~97% than the other fast search algorithms. Simulation results also show that the performance of the proposed scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS(Full Search) algorithm.

• Korean Journal of Cognitive Science
• /
• 제33권2호
• /
• pp.109-133
• /
• 2022

Episodic memory consists of a core event and the associated contexts. Although the role of the hippocampus and its neighboring regions in contextual representations during encoding has become increasingly evident, it remains unclear how these regions handle various context-specific information other than spatio-temporal contexts. Using high-resolution functional MRI, we explored the patterns of the medial temporal lobe (MTL) and cortical regions' involvement during the encoding of various types of contextual information (i.e., journalism principle 5W1H): "Who did it?," "Why did it happen?," "What happened?," "When did it happen?," "Where did it happen?," and "How did it happen?" Participants answered six different contextual questions while looking at simple experimental events consisting of two faces with one object on the screen. The MTL was divided to sub-regions by hierarchical clustering from resting-state data. General linear model analyses revealed a stronger activation of MTL sub-regions, the prefrontal lobe (PFC), and the inferior parietal lobule (IPL) during social (Who), behavioral (How), and intentional (Why) contextual processing when compared with spatio-temporal (Where/When) contextual processing. To further investigate the functional networks involved in contextual encoding dissociation, a multivariate pattern analysis was conducted with features selected as the task-based connectivity links between the hippocampal subfields and PFC/IPL. Each social, behavioral, and intentional contextual processing was individually and successfully classified from spatio-temporal contextual processing, respectively. Thus, specific contexts in episodic memory, namely social, behavior, and intention, involve distinct functional connectivity patterns that are distinct from those for spatio-temporal contextual memory.

• 한국경영정보학회:학술대회논문집
• /
• 한국경영정보학회 2007년도 International Conference
• /
• pp.603-607
• /
• 2007

GPS 수신기의 지속적인 가격 하락과 GPS 기반의 다양한 위치기반서비스 개발로 인하여 개인 휴대용 GPS 수신기의 보급이 확대되고 있다. 이동객체의 위치 및 시간 정보를 포함하고 있는 GPS 데이터를 분석하면 이전에는 불가능했던 이동패턴을 파악하고 이해하는 것이 가능해진다. 이동객체 데이터의 저장과 분석에 관한 연구들이 진행되고 있지만, 이동객체의 속성에 따른 다차원적 이동패턴 분석에 관한 연구는 찾아보기 힘들다. 본 연구는 개인 휴대용 GPS 수신기를 통해 수집된 이동 데이터와 이동객체의 속성 데이터를 통합하여 이동객체의 시공간적 특성을 다차원적으로 분석할 수 있는 데이터마트를 구현하고 시각적으로 표현하였다. 이러한 과정을 통해 GPS 데이터를 이용한 이동패턴 분석의 유용성과 문제점을 탐색적으로 살펴보았다.

• Journal of the Korean association of regional geographers
• /
• 제18권4호
• /
• pp.414-432
• /
• 2012

Land price is a kind of text to read urban spatial structure. The purpose of this paper is to inquire into the characteristics of Daegu's urban structure and its change in time through exploring spatio-temporal variations of land price with a detailed spatial and temporal resolution. To achieve this, land value surfaces were represented using the officially assessed land price every other year from 1995 to 2011. Through mapping and exploring spatio-temporal patterns and fluctuation rates of land price for this period, changes in urban structure, the effects of local decision makings such as Greenbelt adjustment, housing site development, and gentrification, and the effects of business fluctuations or policies at global or national scales could be caught. In addition, the trends for suburbanization and multi-centric urban form could be examined from the results of a negative exponential model explaining the effect of distance from an urban center on spatial variation of land price. These results demonstrate that urban analysis using land price mirroring spatial decision making at various scales could deepen understanding for internal structure and change of a city and provide useful information for establishing regional and urban development policies and evaluating their effects.