کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10321827 660756 2015 26 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
An N-list-based algorithm for mining frequent closed patterns
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
An N-list-based algorithm for mining frequent closed patterns
چکیده انگلیسی
Frequent closed patterns (FCPs), a condensed representation of frequent patterns, have been proposed for the mining of (minimal) non-redundant association rules to improve performance in terms of memory usage and mining time. Recently, the N-list structure has been proven to be very efficient for mining frequent patterns. This study proposes an N-list-based algorithm for mining FCPs called NAFCP. Two theorems for fast determining FCPs based on the N-list structure are proposed. The N-list structure provides a much more compact representation compared to previously proposed vertical structures, reducing the memory usage and mining time required for mining FCPs. The experimental results show that NAFCP outperforms previous algorithms in terms of runtime and memory usage in most cases.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Expert Systems with Applications - Volume 42, Issue 19, 1 November 2015, Pages 6648-6657
نویسندگان
, ,