کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
396019 666103 2007 24 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
An efficient algorithm for mining frequent inter-transaction patterns
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
An efficient algorithm for mining frequent inter-transaction patterns
چکیده انگلیسی

In this paper, we propose an efficient method for mining all frequent inter-transaction patterns. The method consists of two phases. First, we devise two data structures: a dat-list, which stores the item information used to find frequent inter-transaction patterns; and an ITP-tree, which stores the discovered frequent inter-transaction patterns. In the second phase, we apply an algorithm, called ITP-Miner (Inter-Transaction Patterns Miner), to mine all frequent inter-transaction patterns. By using the ITP-tree, the algorithm requires only one database scan and can localize joining, pruning, and support counting to a small number of dat-lists. The experiment results show that the ITP-Miner algorithm outperforms the FITI (First Intra Then Inter) algorithm by one order of magnitude.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 177, Issue 17, 1 September 2007, Pages 3453–3476
نویسندگان
, ,