Extraction of Frequent Tree Patterns without Subtrees Maintenance
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Paik, J.[Paik, J.] | - |
dc.contributor.author | Choi, W.[Choi, W.] | - |
dc.contributor.author | Lee, E.[Lee, E.] | - |
dc.contributor.author | Kim, U.M.[Kim, U.M.] | - |
dc.date.accessioned | 2021-08-07T17:53:07Z | - |
dc.date.available | 2021-08-07T17:53:07Z | - |
dc.date.created | 2017-01-12 | - |
dc.date.issued | 2008 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/82438 | - |
dc.description.abstract | The inherent flexibility in both structure and semantics let tree capture most kinds of data, model a wide variety of data sources, and produce an enormous number of information. The ability to extract valuable knowledge from them becomes increasingly important and desirable, however, existing tree mining algorithms suffer from several serious pitfalls in finding frequent patterns from massive tree datasets, because most of them have used apriori property for candidate generation and frequency counting. Some of the major problems are due to (1) modeling data as hierarchical tree structure, (2) computationally high cost of the candidate maintenance, (3) repetitious input dataset scans, and (4) the high memory dependency. Therefore, a more efficient and practical approach for tree data is required. In this paper, we systematically develop the pattern growth method instead of the apriori method, for mining maximal frequent tree patterns which are special frequent patterns of a set of trees. The proposed method not only gets rid of the process for infrequent subtrees pruning, but also totally eliminates the problem of generating candidate subtrees. Hence, it significantly improves the whole mining process. © 2008 IEEE. | - |
dc.subject | Apriori | - |
dc.subject | Candidate generation | - |
dc.subject | Data sets | - |
dc.subject | Data source | - |
dc.subject | Frequency counting | - |
dc.subject | Frequent patterns | - |
dc.subject | Frequent tree pattern | - |
dc.subject | Hierarchical tree | - |
dc.subject | High costs | - |
dc.subject | Inherent flexibility | - |
dc.subject | Mining process | - |
dc.subject | Modeling data | - |
dc.subject | Pattern growth | - |
dc.subject | Subtrees | - |
dc.subject | Tree data | - |
dc.subject | Tree mining | - |
dc.subject | Maintenance | - |
dc.subject | Mining | - |
dc.subject | Data mining | - |
dc.title | Extraction of Frequent Tree Patterns without Subtrees Maintenance | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Paik, J.[Paik, J.] | - |
dc.contributor.affiliatedAuthor | Choi, W.[Choi, W.] | - |
dc.contributor.affiliatedAuthor | Lee, E.[Lee, E.] | - |
dc.contributor.affiliatedAuthor | Kim, U.M.[Kim, U.M.] | - |
dc.identifier.doi | 10.1109/FGCNS.2008.70 | - |
dc.identifier.scopusid | 2-s2.0-67650308242 | - |
dc.identifier.bibliographicCitation | Proceedings of the 2008 2nd International Conference on Future Generation Communication and Networking, FGCN 2008, v.2, pp.54 - 59 | - |
dc.relation.isPartOf | Proceedings of the 2008 2nd International Conference on Future Generation Communication and Networking, FGCN 2008 | - |
dc.citation.title | Proceedings of the 2008 2nd International Conference on Future Generation Communication and Networking, FGCN 2008 | - |
dc.citation.volume | 2 | - |
dc.citation.startPage | 54 | - |
dc.citation.endPage | 59 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 3 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(03063) 25-2, SUNGKYUNKWAN-RO, JONGNO-GU, SEOUL, KOREAsamsunglib@skku.edu
COPYRIGHT © 2021 SUNGKYUNKWAN 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.