English  |  正體中文  |  简体中文  |  Items with full text/Total items : 28611/40649
Visitors : 650421      Online Users : 56
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/39303

Title: On-line association rules mining with dynamic support
Authors: Hsuan-Shih Lee
Contributors: 國立臺灣海洋大學:航運管理學系
Date: 2006
Issue Date: 2016-12-01T08:31:12Z
Publisher: Lecture Notes in Computer Science/LANI
Abstract: Abstract:In this paper, we use maximal itemsets to represent itemsets in a database. We show that the set of supreme covers, which are the maximal itemsets whose proper subsets are not maximal itemsets, induces an equivalence relation on the set itemsets. Based on maximal itemsets, we propose a large itemset generation algorithm with dynamic support, which runs in time O(M′2N+M′logM), where N is the maximum number of items in a maximal itemset, M′ is the number of the maximal itemsets with minimum support greater than the required support, and M is the number of the maximal itemsets.
Relation: 4252, pp.896-901
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/39303
Appears in Collections:[航運管理學系] 期刊論文

Files in This Item:

File Description SizeFormat
chp%3A10.1007%2F11893004_114.pdf313KbAdobe PDF9View/Open


All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback