Constraint graph-based frequent pattern updating from temporal databases
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jung, Jason J. | - |
dc.date.available | 2020-03-27T07:54:04Z | - |
dc.date.issued | 2012-02 | - |
dc.identifier.issn | 0957-4174 | - |
dc.identifier.issn | 1873-6793 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/37738 | - |
dc.description.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. | - |
dc.format.extent | 5 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.title | Constraint graph-based frequent pattern updating from temporal databases | - |
dc.type | Article | - |
dc.identifier.doi | 10.1016/j.eswa.2011.09.003 | - |
dc.identifier.bibliographicCitation | EXPERT SYSTEMS WITH APPLICATIONS, v.39, no.3, pp 3169 - 3173 | - |
dc.description.isOpenAccess | N | - |
dc.identifier.wosid | 000297823300099 | - |
dc.identifier.scopusid | 2-s2.0-80255137534 | - |
dc.citation.endPage | 3173 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 3169 | - |
dc.citation.title | EXPERT SYSTEMS WITH APPLICATIONS | - |
dc.citation.volume | 39 | - |
dc.type.docType | Article | - |
dc.publisher.location | 영국 | - |
dc.subject.keywordAuthor | Frequent pattern milling | - |
dc.subject.keywordAuthor | Pattern updating | - |
dc.subject.keywordAuthor | Constraint graphs | - |
dc.subject.keywordPlus | QUERY TRANSFORMATION | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.