An Efficient Approach for Mining Frequent Item sets with Transaction Deletion Operation
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Vo, Bay | - |
dc.contributor.author | Le, Thien-Phuong | - |
dc.contributor.author | Hong, Tzung-Pei | - |
dc.contributor.author | Le, Bac | - |
dc.contributor.author | Jung, Jason | - |
dc.date.available | 2019-03-08T12:37:39Z | - |
dc.date.issued | 2016-09 | - |
dc.identifier.issn | 1683-3198 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/6590 | - |
dc.description.abstract | Deletion of transactions in databases is common in real-world applications. Developing an efficient and effective mining algorithm to maintain discovered information is thus quite important in data mining fields. A lot of algorithms have been proposed in recent years, and the best of them is the pre-large-tree-based algorithm. However, this algorithm only rebuilds the final pre-large tree every deleted transactions. After that, the FP-growth algorithm is applied for mining all frequent item sets. The pre-large-tree-based approach requires twice the computation time needed for a single procedure. In this paper, we present an incremental mining algorithm to solve above issues. An itemset tidset-tree structure will be used to maintain large and pre-large item sets. The proposed algorithm only processes deleted transactions for updating some nodes in this tree, and all frequent item sets are directly derived from the tree traversal process. Experimental results show that the proposed algorithm has good performance. | - |
dc.format.extent | 8 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | ZARKA PRIVATE UNIV | - |
dc.title | An Efficient Approach for Mining Frequent Item sets with Transaction Deletion Operation | - |
dc.type | Article | - |
dc.identifier.bibliographicCitation | INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, v.13, no.5, pp 595 - 602 | - |
dc.description.isOpenAccess | N | - |
dc.identifier.wosid | 000385213200016 | - |
dc.identifier.scopusid | 2-s2.0-84990051118 | - |
dc.citation.endPage | 602 | - |
dc.citation.number | 5 | - |
dc.citation.startPage | 595 | - |
dc.citation.title | INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY | - |
dc.citation.volume | 13 | - |
dc.type.docType | Article | - |
dc.publisher.location | 요르단 | - |
dc.subject.keywordAuthor | Data mining | - |
dc.subject.keywordAuthor | frequent item sets | - |
dc.subject.keywordAuthor | incremental mining | - |
dc.subject.keywordAuthor | pre-large item sets | - |
dc.subject.keywordAuthor | item set-tidset tree | - |
dc.subject.keywordPlus | PATTERN TREES | - |
dc.subject.keywordPlus | MAINTENANCE | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordPlus | TRIE | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
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.