Updating the Built Prelarge Fast Updated Sequential Pattern Trees with Sequence Modification
نویسندگان
چکیده
Copyright © 2008, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited. Association rule mining in spatial databases and temporal databases have been studied extensively in data mining research. Most of the research studies have found interesting patterns in either spatial information or temporal information, however, few studies have handled both efficiently. Meanwhile, developments in spatio-temporal databases and spatio-temporal applications have prompted data analysts to turn their focus to spatio-temporal patterns that explore both spatial and temporal information. In this book, we have examined some issues in temporal mining and suggested some improvements to existing sequence mining and periodic pattern mining algorithms. We introduced a class of patterns for temporal databases called dense periodic patterns, and described a periodicity detection algorithm to efficiently discover short period patterns that may exist in only a limited range of the time series. We discussed an I/O-efficient algorithm for mining frequent sequences as well as incremental update. We also described a new class of patterns called progressive confident rules that capture the state change of objects that leads to a certain end state with increasing confidence. In addition, we have introduced new classes of spatio-temporal patterns and described efficient and effective algorithms for mining these spatio-temporal Chapter XII
منابع مشابه
Evaluation of Updating Methods in Building Blocks Dataset
With the increasing use of spatial data in daily life, the production of this data from diverse information sources with different precision and scales has grown widely. Generating new data requires a great deal of time and money. Therefore, one solution is to reduce costs is to update the old data at different scales using new data (produced on a similar scale). One approach to updating data i...
متن کاملThe Algorithms of Updating Sequential Patterns
Because the data being mined in the temporal database will evolve with time, many researchers have focused on the incremental mining of frequent sequences in temporal database. In this paper, we propose an algorithm called IUS, using the frequent and negative border sequences in the original database for incremental sequence mining. To deal with the case where some data need to be updated from ...
متن کاملThe Algorithms of Updating Sequetial Patterns
Because the data being mined in the temporal database will evolve with time, many researchers have focused on the incremental mining of frequent sequences in temporal database. In this paper, we propose an algorithm called IUS, using the frequent and negative border sequences in the original database for incremental sequence mining. To deal with the case where some data need to be updated from ...
متن کاملA New Incremental Updating Algorithm for Mining Sequential Patterns
This study discusses how to maintain discovered sequential patterns when some information is deleted from a sequence database. A new algorithm, called MA_D (Maintenance Algorithm when Deleting some information), is presented in order to deal with the maintenance of sequential patterns mining resulted from the updating of database and the algorithm makes full use of the information obtained from...
متن کاملMaintenance of the Prelarge Trees for Record Deletion
The frequent pattern tree (FP-tree) is an efficient data structure for association-rule mining without generation of candidate itemsets. It, however, needed to process all transactions in a batch way. In addition to record insertion, record deletion is also commonly seen in real-application. In this paper, we propose the structure of prelarge trees for efficiently handling deletion of records b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJDWM
دوره 11 شماره
صفحات -
تاریخ انتشار 2015