• Title/Summary/Keyword: Temporal pattern

Search Result 715, Processing Time 0.03 seconds

Optimal Moving Pattern Mining using Frequency of Sequence and Weights (시퀀스 빈발도와 가중치를 이용한 최적 이동 패턴 탐사)

  • Lee, Yon-Sik;Park, Sung-Sook
    • Journal of Internet Computing and Services
    • /
    • v.10 no.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.

  • PDF

Discovering Temporal Relation Rules from Temporal Interval Data (시간간격을 고려한 시간관계 규칙 탐사 기법)

  • Lee, Yong-Joon;Seo, Sung-Bo;Ryu, Keun-Ho;Kim, Hye-Kyu
    • Journal of KIISE:Databases
    • /
    • v.28 no.3
    • /
    • pp.301-314
    • /
    • 2001
  • Data mining refers to a set of techniques for discovering implicit and useful knowledge from large database. Many studies on data mining have been pursued and some of them have involved issues of temporal data mining for discovering knowledge from temporal database, such as sequential pattern, similar time sequence, cyclic and temporal association rules, etc. However, all of the works treat problems for discovering temporal pattern from data which are stamped with time points and do not consider problems for discovering knowledge from temporal interval data. For example, there are many examples of temporal interval data that it can discover useful knowledge from. These include patient histories, purchaser histories, web log, and so on. Allen introduces relationships between intervals and operators for reasoning about relations between intervals. We present a new data mining technique that can discover temporal relation rules in temporal interval data by using the Allen's theory. In this paper, we present two new algorithms for discovering algorithm for generating temporal relation rules, discovers rules from temporal interval data. This technique can discover more useful knowledge in compared with conventional data mining techniques.

  • PDF

Mining Spatio-Temporal Patterns in Trajectory Data

  • Kang, Ju-Young;Yong, Hwan-Seung
    • Journal of Information Processing Systems
    • /
    • v.6 no.4
    • /
    • pp.521-536
    • /
    • 2010
  • Spatio-temporal patterns extracted from historical trajectories of moving objects reveal important knowledge about movement behavior for high quality LBS services. Existing approaches transform trajectories into sequences of location symbols and derive frequent subsequences by applying conventional sequential pattern mining algorithms. However, spatio-temporal correlations may be lost due to the inappropriate approximations of spatial and temporal properties. In this paper, we address the problem of mining spatio-temporal patterns from trajectory data. The inefficient description of temporal information decreases the mining efficiency and the interpretability of the patterns. We provide a formal statement of efficient representation of spatio-temporal movements and propose a new approach to discover spatio-temporal patterns in trajectory data. The proposed method first finds meaningful spatio-temporal regions and extracts frequent spatio-temporal patterns based on a prefix-projection approach from the sequences of these regions. We experimentally analyze that the proposed method improves mining performance and derives more intuitive patterns.

Estimation of Winter Wheat Sown Area Using Temporal Characteristics of NDVI

  • Uchida, S.
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.231-233
    • /
    • 2003
  • Agricultural land use generally shows specific temporal characteristics of NDVI obtained from satellite data. In terms of winter wheat, a higher value compared with other land use types in May and a considerably low value in June could be discriminative features of temporal change of NDVI. In this study, the author examined methods for estimating winter wheat sown area in sub-pixel level of coarse resolution satellite data using temporal characteristics of NDVI. Application of the methods to the major grain production area in China exhibited properly a spatial distribution pattern of winter wheat sown area.

  • PDF

Change Detection of Land-cover from Multi-temporal KOMPSAT-1 EOC Imageries

  • Ha, Sung-Ryong;Ahn, Byung-Woon;Park, Sang-Young
    • Korean Journal of Remote Sensing
    • /
    • v.18 no.1
    • /
    • pp.13-23
    • /
    • 2002
  • A radiometric correction method is developed to apply multi-temporal KOMPSAT-1 EOC satellite images for the detection of land-cover changes b\ulcorner recognizing changes in reflection pattern. Radiometric correction was carried out to eliminate the atmospheric effects that could interfere with the image properly of the satellite data acquired at different multi-times. Four invariant features of water, sand, paved road, and roofs of building are selected and a linear regression relationship among the control set images is used as a correction scheme. It is found that the utilization of panchromatic multi-temporal imagery requires the radiometric scene standardization process to correct radiometric errors that include atmospheric effects and digital image processing errors. Land-cover with specific change pattern such as paddy field is extracted by seasonal change recognition process.

Dynamic Capacity Concept and its Determination for Managing Congested Flow (혼잡교통류 관리를 위한 동적 용량의 개념 및 산정방법)

  • Park, Eun-Mi
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.3 s.74
    • /
    • pp.159-166
    • /
    • 2004
  • The capacity concept presented in the Highway Capacity Manual is for steady-state traffic flow assuming that there is no restriction in downstream flowing, which is traditionally used for planning, design, and operational analyses. In the congested traffic condition, the control objective should be to keep the congested regime from growing and to recover the normal traffic condition as soon as possible. In this control case, it is important to predict the spatial-temporal pattern of congestion evolution or dissipation and to estimate the throughput reduction according to the spatial-temporal pattern. In this context, the new concept of dynamic capacity for managing congested traffic is developed in terms of spatial-temporal evolution of downstream traffic congestion and in view of the 'input' concept assuming that flow is restricted by downstream condition rather than the 'output' concept assuming that there is no restriction in downstream flowing (e.g. the mean queue discharge flow rate). This new capacity is defined as the Maximum Sustainable Throughput that is determined based on the spatial-temporal evolution pattern of downstream congestion. And the spatial-temporal evolution pattern is estimated using the Newell's simplified q-k model.

Spatiotemporal Moving Pattern Discovery using Location Generalization of Moving Objects (이동객체 위치 일반화를 이용한 시공간 이동 패턴 탐사)

  • Lee, Jun-Wook;Nam, Kwang-Woo
    • 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.

Temporal Pattern Mining of Moving Objects for Location based Services (위치 기반 서비스를 위한 이동 객체의 시간 패턴 탐사 기법)

  • Lee, Jun-Uk;Baek, Ok-Hyeon;Ryu, Geun-Ho
    • Journal of KIISE:Databases
    • /
    • v.29 no.5
    • /
    • pp.335-346
    • /
    • 2002
  • LBS(Location Based Services) provide the location-based information to its mobile users. The primary functionality of these services is to provide useful information to its users at a minimum cost of resources. The functionality can be implemented through data mining techniques. However, conventional data mining researches have not been considered spatial and temporal aspects of data simultaneously. Therefore, these techniques are inappropriate to apply on the objects of LBS, which change spatial attributes over time. In this paper, we propose a new data mining technique for identifying the temporal patterns from the series of the locations of moving objects that have both temporal and spatial dimension. We use a spatial operation of contains to generalize the location of moving point and apply time constraints between the locations of a moving object to make a valid moving sequence. Finally, the spatio-temporal technique proposed in this paper is very practical approach in not only providing more useful knowledge to LBS, but also improving the quality of the services.

Spatial-Temporal Moving Sequence Pattern Mining (시공간 이동 시퀀스 패턴 마이닝 기법)

  • Han, Seon-Young;Yong, Hwan-Seung
    • 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.

Acoustic Signal Classifier Design using Dictionary Learning (딕셔너리 러닝을 이용한 음파 신호 분류기 설계)

  • Park, Sung Min;Sah, Sung Jin;Oh, Kwang Myung;Lee, Hui Sung
    • Journal of Auto-vehicle Safety Association
    • /
    • v.8 no.1
    • /
    • pp.19-25
    • /
    • 2016
  • As new car technology is developing, temporal interaction is needed in automotive. Rhythmic pattern is one of the practical examples of temporal interaction in vehicle. To recognize rhythmic pattern and its input medium, dictionary learning is applicable algorithm. In this paper, performance and memory requirement of the learning algorithm is tested and is sufficiently good for use this acoustic sound.