Mining Representative Movement Patterns through Compression

نویسندگان

  • Phan Nhat Hai
  • Dino Ienco
  • Pascal Poncelet
  • Maguelonne Teisseire
چکیده

Mining trajectories (or moving object patterns) from spatio-temporal data is an active research field. Most of the researches are devoted to extract trajectories that differ in their structure and characteristic in order to capture different object behaviors. The first issue is constituted from the fact that all these methods extract thousand of patterns resulting in a huge amount of redundant knowledge that poses limit in their usefulness. The second issue is supplied from the nature of spatio-temporal database from which different types of patterns could be extracted. This means that using only a single type of patterns is not sufficient to supply an insightful picture of the whole database. Motivating by these issues, we develop a Minimum Description Length (MDL)based approach that is able to compress spatio-temporal data combining different kinds of moving object patterns. The proposed method results in a rank of the patterns involved in the summarization of the dataset. In order to validate the quality of our approach, we conduct an empirical study on real data to compare the proposed algorithms in terms of effectiveness, running time and compressibility.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Group Movement Pattern Mining Algorithm for Data Compression

To reduce the data volume, various algorithms have been proposed for data compression and data aggregation. In object tracking applications, natural phenomena show that many creatures form large social groups and move in regular patterns. However, the previous works do not address application level semantics, such as the group relationships and movement patterns, in the location data. In this p...

متن کامل

On compressing frequent patterns q

A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness measure d (called d-cluster), and select a representative pattern for each cluster. The problem of finding a minimum set of representative patterns is shown NP-Hard. We develop two greedy methods, RPglobal and RPlocal. ...

متن کامل

Mining Compressed Frequent-Pattern Sets

A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one may generate an explosive number of output patterns, which severely restricts its usage. In this paper, we study the problem of compressing frequent-pattern sets. Typically, frequent patterns can be clustered with a ti...

متن کامل

Discovering Data Storage by Task Scheduling and Network Construction for Data Compression in Global Position System

Natural trend show number of animals forms large social groups and move in regular patterns. We formulate a moving object clustering problem that jointly identifies a group of objects and discovers their movement patterns. Data storage and transmission, task scheduling, and network construction used for that. We have proposed a clustering algorithm to find the group relationships for query and ...

متن کامل

On compressing frequent patterns

A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness measure δ (called δ-cluster), and select a representative pattern for each cluster. The problem of finding a minimum set of representative patterns is shown NP-Hard. We develop two greedy methods, RPglobal and RPlocal. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013