메뉴 건너뛰기




Volumn , Issue , 2008, Pages 34-42

Mining adaptively frequent closed unlabeled rooted trees in data streams

Author keywords

Closed mining; Concept drift; Data streams; Patterns; Trees

Indexed keywords

CLOSED MINING; CONCEPT DRIFT; DATA STREAMS; PATTERNS; TREES;

EID: 65449139975     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401900     Document Type: Conference Paper
Times cited : (33)

References (20)
  • 1
    • 26944489623 scopus 로고    scopus 로고
    • An output-polynomial time algorithm for mining frequent closed attribute trees
    • H. Arimura and T. Uno. An output-polynomial time algorithm for mining frequent closed attribute trees. In ILP, pages 1-19, 2005.
    • (2005) ILP , pp. 1-19
    • Arimura, H.1    Uno, T.2
  • 6
    • 33746034254 scopus 로고    scopus 로고
    • Mining closed and maximal frequent subtrees from databases of labeled rooted trees
    • Y. Chi, Y. Xia, Y. Yang, and R. Muntz. Mining closed and maximal frequent subtrees from databases of labeled rooted trees. Fundamenta Informaticae, XXL1001-1038, 2001.
    • (2001) Fundamenta Informaticae , vol.XXL1001-1038
    • Chi, Y.1    Xia, Y.2    Yang, Y.3    Muntz, R.4
  • 8
    • 34548747032 scopus 로고    scopus 로고
    • Efficient mining of frequent closed xml query pattern
    • J. Feng, Q. Qian, J. Wang, and L.-Z. Zhou. Efficient mining of frequent closed xml query pattern. J. Comput. Sci. Technol., 22(5):725-735, 2007.
    • (2007) J. Comput. Sci. Technol , vol.22 , Issue.5 , pp. 725-735
    • Feng, J.1    Qian, Q.2    Wang, J.3    Zhou, L.-Z.4
  • 9
    • 35048879345 scopus 로고    scopus 로고
    • Coproduct transformations on lattices of closed partial orders
    • G. C. Garriga and J. L. Balcázar. Coproduct transformations on lattices of closed partial orders. In ICGT, pages 336-352, 2004.
    • (2004) ICGT , pp. 336-352
    • Garriga, G.C.1    Balcázar, J.L.2
  • 10
    • 33745447086 scopus 로고    scopus 로고
    • M. C.-E. Hsieh, Y.-H. Wu, and A. L. P. Chen. Discovering frequent tree patterns over data streams. In SDM, 2006.
    • M. C.-E. Hsieh, Y.-H. Wu, and A. L. P. Chen. Discovering frequent tree patterns over data streams. In SDM, 2006.
  • 12
    • 78651531689 scopus 로고    scopus 로고
    • A survey on algorithms for mining frequent itemsets over data streams
    • Y. K. James Cheng and W. Ng. A survey on algorithms for mining frequent itemsets over data streams. Knowledge and Information Systems, 2007.
    • (2007) Knowledge and Information Systems
    • James Cheng, Y.K.1    Ng, W.2
  • 15
    • 38049139142 scopus 로고    scopus 로고
    • CLAIM: An efficient method for relaxed frequent closed itemsets mining over stream data
    • G. Song, D. Yang, B. Cui, B. Zheng, Y. Liu, and K. Xie. CLAIM: An efficient method for relaxed frequent closed itemsets mining over stream data. In DASFAA, pages 664-675, 2007.
    • (2007) DASFAA , pp. 664-675
    • Song, G.1    Yang, D.2    Cui, B.3    Zheng, B.4    Liu, Y.5    Xie, K.6
  • 16
    • 19544369474 scopus 로고    scopus 로고
    • DRYADE: A new approach for discovering closed frequent trees in heterogeneous tree databases
    • A. Termier, M.-C. Rousset, and M. Sebag. DRYADE: a new approach for discovering closed frequent trees in heterogeneous tree databases. In ICDM, pages 543-546, 2004.
    • (2004) ICDM , pp. 543-546
    • Termier, A.1    Rousset, M.-C.2    Sebag, M.3


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