메뉴 건너뛰기




Volumn 78, Issue 1-2, 2010, Pages 1-33

Mining frequent closed rooted trees

Author keywords

Closure operator; Labeled trees; Tree mining; Unordered trees

Indexed keywords

ALTERNATIVE ALGORITHMS; CLOSURE OPERATORS; EFFICIENT ALGORITHM; EMPIRICAL VALIDATION; ITEMSET; LABELED TREES; LINK STRUCTURE; ORDERED TREE; ROOTED TREES; SUBTREES; TREE MINING; TREE-LIKE STRUCTURES; UNORDERED TREES;

EID: 77952430648     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-009-5123-9     Document Type: Article
Times cited : (19)

References (44)
  • 1
    • 26944489623 scopus 로고    scopus 로고
    • An output-polynomial time algorithm for mining frequent closed attribute trees
    • Arimura, H., & Uno, T. (2005). An output-polynomial time algorithm for mining frequent closed attribute trees. In ILP (pp. 1-19).
    • (2005) ILP , pp. 1-19
    • Arimura, H.1    Uno, T.2
  • 3
    • 0242360778 scopus 로고    scopus 로고
    • Discovering frequent substructures in large unordered trees
    • Asai, T., Arimura, H., Uno, T., & Nakano, S.-I. (2003). Discovering frequent substructures in large unordered trees. In Discovery science (pp. 47-61).
    • (2003) Discovery Science , pp. 47-61
    • Asai, T.1    Arimura, H.2    Uno, T.3    Nakano, S.-I.4
  • 6
    • 77049116292 scopus 로고    scopus 로고
    • On Horn axiomatizations for sequential data
    • Balcázar, J. L., & Garriga, G. C. (2005). On Horn axiomatizations for sequential data. In ICDT (pp. 215-229)
    • (2005) ICDT , pp. 215-229
    • Balcázar, J.L.1    Garriga, G.C.2
  • 7
    • 33846782841 scopus 로고    scopus 로고
    • (extended version in Theoretical Computer Science, 371, 247-264, 2007).
    • (2007) Theoretical Computer Science , vol.371 , pp. 247-264
  • 9
    • 47849126620 scopus 로고    scopus 로고
    • Subtree testing and closed tree mining through natural representations
    • Balcázar, J. L., Bifet, A., & Lozano, A. (2007). Subtree testing and closed tree mining through natural representations. In DEXA workshops (pp. 499-503).
    • (2007) DEXA Workshops , pp. 499-503
    • Balcázar, J.L.1    Bifet, A.2    Lozano, A.3
  • 11
    • 0000621555 scopus 로고
    • Constant time generation of rooted trees
    • Beyer, T., & Hedetniemi, S. M. (1980). Constant time generation of rooted trees. SIAM Journal on Computing, 9(4), 706-712.
    • (1980) SIAM Journal on Computing , vol.9 , Issue.4 , pp. 706-712
    • Beyer, T.1    Hedetniemi, S.M.2
  • 14
    • 0035009221 scopus 로고    scopus 로고
    • Modeling the branching characteristics and efficiency gains of global multicast trees
    • April 2001
    • Chalmers, R., & Almeroth, K. (2001). Modeling the branching characteristics and efficiency gains of global multicast trees. In Proceedings of the IEEE INFOCOM'2001, April 2001.
    • (2001) Proceedings of the IEEE INFOCOM'2001
    • Chalmers, R.1    Almeroth, K.2
  • 16
    • 33746034254 scopus 로고    scopus 로고
    • Mining closed and maximal frequent subtrees from databases of labeled rooted trees
    • Chi, Y., Xia, Y., Yang, Y., & Muntz, R. (2001b). Mining closed and maximal frequent subtrees from databases of labeled rooted trees. Fundamenta Informaticae, XXI, 1001-1038.
    • (2001) Fundamenta Informaticae , vol.21 , pp. 1001-1038
    • Chi, Y.1    Xia, Y.2    Yang, Y.3    Muntz, R.4
  • 18
    • 21844454174 scopus 로고    scopus 로고
    • Canonical forms for labelled trees and their applications in frequent subtree mining
    • DOI 10.1007/s10115-004-0180-7
    • Chi, Y., Yang, Y., & Muntz, R. R. (2005). Canonical forms for labelled trees and their applications in frequent subtree mining. Knowledge and Information Systems, 8(2), 203-234. (Pubitemid 40951991)
    • (2005) Knowledge and Information Systems , vol.8 , Issue.2 , pp. 203-234
    • Chi, Y.1    Yang, Y.2    Muntz, R.R.3
  • 21
    • 35048879345 scopus 로고    scopus 로고
    • Coproduct transformations on lattices of closed partial orders
    • Garriga, G. C., & Balcázar, J. L. (2004). Coproduct transformations on lattices of closed partial orders. In ICGT (pp. 336-352).
    • (2004) ICGT , pp. 336-352
    • Garriga, G.C.1    Balcázar, J.L.2
  • 28
    • 0033284591 scopus 로고    scopus 로고
    • Approximate tree matching and shape similarity
    • Liu, T.-L., & Geiger, D. (1999). Approximate tree matching and shape similarity. In ICCV (pp. 456-462).
    • (1999) ICCV , pp. 456-462
    • Liu, T.-L.1    Geiger, D.2
  • 32
    • 84972130012 scopus 로고
    • How to obtain an asymptotic expansion of a sequence from an analytic identity satisfied by its generating function
    • Plotkin, J. M., & Rosenthal, J. W. (1994). How to obtain an asymptotic expansion of a sequence from an analytic identity satisfied by its generating function. Journal of the Australian Mathematical Society (Series A), 56, 131-143.
    • (1994) Journal of the Australian Mathematical Society (Series A) , vol.56 , pp. 131-143
    • Plotkin, J.M.1    Rosenthal, J.W.2
  • 34
    • 19544369474 scopus 로고    scopus 로고
    • DRYADE: A new approach for discovering closed frequent trees in heterogeneous tree databases
    • Termier, A., Rousset, M.-C., & Sebag, M. (2004). DRYADE: a new approach for discovering closed frequent trees in heterogeneous tree databases. In ICDM (pp. 543-546).
    • (2004) ICDM , pp. 543-546
    • Termier, A.1    Rousset, M.-C.2    Sebag, M.3
  • 41
    • 4444326044 scopus 로고    scopus 로고
    • Clospan: Mining closed sequential patterns in large databases
    • Yan, X., Han, J., & Afshar, R. (2003). Clospan: mining closed sequential patterns in large databases. In SDM.
    • (2003) SDM
    • Yan, X.1    Han, J.2    Afshar, R.3
  • 44
    • 24044516553 scopus 로고    scopus 로고
    • Efficiently mining frequent embedded unordered trees
    • Zaki, M. J. (2005). Efficiently mining frequent embedded unordered trees. Fundamenta Mathematicae, 66(12), 33-52. (Pubitemid 41218091)
    • (2005) Fundamenta Informaticae , vol.66 , Issue.1-2 , pp. 33-52
    • Zaki, M.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.