کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
378803 659219 2015 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Fast updated frequent-itemset lattice for transaction deletion
ترجمه فارسی عنوان
سریع تر به نظر می رسد شبکه های اقلام متعدد برای حذف معامله
کلمات کلیدی
داده کاوی، شبکه های مکرر اقلام، حذف تراکنش
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
چکیده انگلیسی

The frequent-itemset lattice (FIL) is an effective structure for mining association rules. However, building an FIL for a modified database requires a lot of time and memory. Currently, there is no approach for updating an FIL with deleted transactions. Therefore, this paper proposes an approach for maintaining FILs for transaction deletion without rescanning the original database if the number of eliminated transactions is smaller than the threshold determined based on the pre-large and diffset concepts. A diffset-based approach is first used for fast building an FIL. Then, two proposed approaches (tidset-based and diffset-based) are used for updating the FIL with transaction deletion. The experiment was conducted to show that the diffset-based approach outperforms the tidset-based and the batch-mode approaches.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Data & Knowledge Engineering - Volumes 96–97, March–May 2015, Pages 78–89
نویسندگان
, , , ,