Constraint graph-based frequent pattern updating from temporal databases
- Authors
- Jung, Jason J.
- Issue Date
- Feb-2012
- Publisher
- PERGAMON-ELSEVIER SCIENCE LTD
- Keywords
- Frequent pattern milling; Pattern updating; Constraint graphs
- Citation
- EXPERT SYSTEMS WITH APPLICATIONS, v.39, no.3, pp 3169 - 3173
- Pages
- 5
- Journal Title
- EXPERT SYSTEMS WITH APPLICATIONS
- Volume
- 39
- Number
- 3
- Start Page
- 3169
- End Page
- 3173
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/37738
- DOI
- 10.1016/j.eswa.2011.09.003
- ISSN
- 0957-4174
1873-6793
- Abstract
- There have been many kinds of association rule mining (ARM) algorithms, e.g.. Apriori and FP-tree, to discover meaningful frequent patterns from a large dataset. Particularly, it is more difficult for such ARM algorithms to be applied for temporal databases which are continuously changing over time. Such algorithms are generally based on repeating time-consuming tasks, e.g., scanning databases. To deal with this problem, in this paper, we propose a constraint graph-based method for maintaining frequent patterns (FP) discovered from the temporal databases. Particularly, the constraint graph, which is represented as a set of constraint between two items, can be established by temporal persistency of the patterns. It means that some patterns can be used to build the constraint graph, when the patterns have been shown in a set of the FP. Two types of constraints can be generated by users and adaptation. Based on our scheme, we find that a large number of dataset has been efficiently reduced during mining process and the gathering information while updating. (C) 2011 Elsevier Ltd. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/37738)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.