Mining maximal frequent subtrees with lists-based pattern-growth method
- Authors
- Paik, J.[Paik, J.]; Nam, J.[ Nam, J.]; Hwang, J.[ Hwang, J.]; Kim, U.M.[Kim, U.M.]
- Issue Date
- 2008
- Citation
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.4976 LNCS, pp.93 - 98
- Indexed
- SCOPUS
- Journal Title
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- Volume
- 4976 LNCS
- Start Page
- 93
- End Page
- 98
- URI
- https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/82577
- DOI
- 10.1007/978-3-540-78849-2_11
- ISSN
- 0302-9743
- Abstract
- Mining maximal frequent subtrees remains at a preliminary state compared to the fruitful achievements in mining frequent subtrees. Thus, most of them are fundamentally complicated and this causes computational problems. In this paper, we present a conceptually simple, yet effective approach based on lists structures. The beneficial effect of the proposed approach is that it not only gets rid of the process for infrequent tree pruning, but also eliminates totally the problem of candidate subtrees generation. As far as we know, this is the first algorithm that discovers maximal frequent subtrees without any subtree generation. © 2008 Springer-Verlag Berlin Heidelberg.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Computing and Informatics > Computer Science and Engineering > 1. Journal Articles
- Information and Communication Engineering > Department of Computer Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.