• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.1
• /
• pp.57-61
• /
• 2009

To increase the efficiency of mining process and derive accurate spatio-temporal patterns, continuous values of attributes should be discretized prior to mining process. In this paper, we propose a discretization method which improves the mining efficiency by reducing the data size without losing the correlations in the data. The proposed method first s original trajectories into approximations using line simplification and then groups them into similar clusters. Our experiments show that the proposed approach improves the mining efficiency as well as extracts more intuitive patterns compared to existing discretization methods.

• Journal of Soil and Groundwater Environment
• /
• v.18 no.4
• /
• pp.40-49
• /
• 2013

In the beginning of $20^{th}$ century, the coal mining industry had an important role in Japan at which two-thirds of the coal product came from the Kitakyushu-Chikuho District (KCD). As a consequence of mining activities, land-use condition in this district showed notable changes. This paper presented a study of land-use changes in coal mining area by characterizing land-use pattern transition over the last 100 years. In order to carry out the rigorous analysis of land-use, a series of land-use maps over the last 100 years was developed using geographic information systems (GIS). The historic topographic map and another available old data were used to investigate the long-term changes of land-use associated with past mining within the GIS platform. The results showed that the utilization of a series of developed land-use maps successfully indicated the difference of land-use pattern in the KCD before and after the peak of mining activities. The general findings from land-use analysis described that forest and farm lands were lost and turned into abandoned sites in the last 100 years.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.9
• /
• pp.3524-3531
• /
• 2010

In order to supply suitable services to users in ubiquitous computing environments, it is important to consider both location and time information which is related to all object and user's activity. To do this, in this paper, we design a spatial-temporal ontology considering user context and propose a system architecture for active mining user activity and service pattern. The proposed system is a framework for active mining user activity and service pattern by considering the relation between user context and object based on trigger system.

• 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.

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

The event sequence of the same type from a set of events having time property can be summarized in one event. But if the event sequence having an interval, It is reasonable to be summarized more than one in independent sub event sequence of each other. In this paper, we suggest a method of temporal data mining that summarizes the interval events based on Allen's interval algebra and finds out interval event association rule from interval events. It provides better knowledge than others by using concept of an independent sub sequence and finding interval event association rules.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.115-117
• /
• 2004

Recently, mining far association rules in distributed database environments is a central problem in knowledge discovery area. While the data are located in different share-nothing machines, and each data site grows by time. Mining global frequent itemsets is hard and not efficient in large number of distributed sewen. In many distributed databases. time component(which is usually attached to transactions in database), contains meaningful time-related rules. In this paper, we design a new DTA(distributed temporal association) algorithm that combines temporal concepts inside distributed association rules. The algorithm confirms the time interval for applying association rules in distributed databases. The experiment results show that DTA can generate interesting correlation frequent itemsets related with time periods.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.231-242
• /
• 2007

The existing pattern mining methods[1,2,3,4,5,6,11,12,13] do not use location generalization method on the set of location history data of moving object, but even so they simply do extract only frequent patterns which have no spatio-temporal constraint in moving patterns on specific space. Therefore, it is difficult for those methods to apply to frequent pattern mining which has spatio-temporal constraint such as optimal moving or scheduling paths among the specific points. And also, those methods are required more large memory space due to using pattern tree on memory for reducing repeated scan database. Therefore, more effective pattern mining technique is required for solving these problems. In this paper, in order to develop more effective pattern mining technique, we propose new location generalization method that converts data of detailed level into meaningful spatial information for reducing the processing time for pattern mining of a massive history data set of moving object and space saving. The proposed method can lead the efficient spatial moving pattern mining of moving object using by creating moving sequences through generalizing the location attributes of moving object into 2D spatial area based on $R^*$-Tree and Area Grid Hash Table(AGHT) in preprocessing stage of pattern mining.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.5
• /
• pp.527-547
• /
• 2009

Moving object management is widely used in traffic, logistic and data mining applications in ubiquitous environments. It is required to analyze spatio-temporal data and trajectories for moving object management. In this paper, we proposed a novel index structure for spatio-temporal aggregation of trajectory in a constrained network, named aCN-RB-tree. It manages aggregation values of trajectories using a constraint network-based index and it also supports direction of trajectory. An aCN-RB-tree consists of an aR-tree in its center and an extended B-tree. In this structure, an aR-tree is similar to a Min/Max R-tree, which stores the child nodes' max aggregation value in the parent node. Also, the proposed index structure is based on a constrained network structure such as a FNR-tree, so that it can decrease the dead space of index nodes. Each leaf node of an aR-tree has an extended B-tree which can store timestamp-based aggregation values. As it considers the direction of trajectory, the extended B-tree has a structure with direction. So this kind of aCN-RB-tree index can support efficient search for trajectory and traffic zone. The aCN-RB-tree can find a moving object trajectory in a given time interval efficiently. It can support traffic management systems and mining systems in ubiquitous environments.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.11
• /
• pp.1910-1915
• /
• 2008

The load analysis for the distribution system and facilities has relied on measurement equipment. Moreover, load monitoring incurs huge costs in terms of installation and maintenance. This paper presents a new model to analyze wherein facilities load under a feeder every 15 minutes using meter reading data that can be obtained from a power consumer every 15 minute or a month even without setting up any measuring equipment. After the data warehouse is constructed by interfacing the legacy system required for the load calculation, the relationship between the distribution system and the power consumer is established. Once the load pattern is forecasted by applying clustering and classification algorithm of temporal data mining techniques for the power customer who is not involved in Automatic Meter Reading(AMR), a single-line diagram per feeder is created, and power flow calculation is executed. The calculation result is analyzed using various temporal and spatial analysis methods such as Internet Geographic Information System(GIS), single-line diagram, and Online Analytical Processing (OLAP).

• Journal of information and communication convergence engineering
• /
• v.13 no.2
• /
• pp.105-112
• /
• 2015

The estimation of missing sensor values is an important problem in sensor network applications, but the existing approaches have some limitations, such as the limitations of application scope and estimation accuracy. Therefore, in this paper, we propose a new estimation model based on a spatial-temporal correlation analysis (STCAM). STCAM can make full use of spatial and temporal correlations and can recognize whether the sensor parameters have a spatial correlation or a temporal correlation, and whether the missing sensor data are continuous. According to the recognition results, STCAM can choose one of the most suitable algorithms from among linear interpolation algorithm of temporal correlation analysis (TCA-LI), multiple regression algorithm of temporal correlation analysis (TCA-MR), spatial correlation analysis (SCA), spatial-temporal correlation analysis (STCA) to estimate the missing sensor data. STCAM was evaluated over Intel lab dataset and a traffic dataset, and the simulation experiment results show that STCAM has good estimation accuracy.