메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1247-1249

Monkey: Approximate graph mining based on spanning trees

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOINFORMATICS; COMPUTER NETWORKS; DATABASE SYSTEMS; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING;

EID: 34548728521     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.368984     Document Type: Conference Paper
Times cited : (17)

References (11)
  • 1
    • 0347473809 scopus 로고    scopus 로고
    • J. Bader, A. Chaudhuri, J. Rothberg, andJ. Chant. Gaining confidence in high-throughput protein. interaction networks, Nature Biotechnology, 22(1):78-85, 2004.
    • J. Bader, A. Chaudhuri, J. Rothberg, andJ. Chant. Gaining confidence in high-throughput protein. interaction networks, Nature Biotechnology, 22(1):78-85, 2004.
  • 2
    • 34548800414 scopus 로고    scopus 로고
    • Discovering frequent substructures from hierarchical semi-structured data
    • G. Cong, L. Yi, B. Liu and K. Wang. Discovering frequent substructures from hierarchical semi-structured data, Proc of SDM, 2002.
    • (2002) Proc of SDM
    • Cong, G.1    Yi, L.2    Liu, B.3    Wang, K.4
  • 3
    • 34548810377 scopus 로고    scopus 로고
    • L.B.Holder, DJ.Cook, and S. Djoko. Substructure discovery in the subdue system, In Proc AAAI, 1994.
    • L.B.Holder, DJ.Cook, and S. Djoko. Substructure discovery in the subdue system, In Proc AAAI, 1994.
  • 4
    • 78149328300 scopus 로고    scopus 로고
    • J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraphs in the presence of isomorphism. In Proc. of ICDM, 2003.
    • J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraphs in the presence of isomorphism. In Proc. of ICDM, 2003.
  • 5
    • 12244294770 scopus 로고    scopus 로고
    • J. Huan, W. Wang, and J. Prins, and J. Yang. SPIN: mining maximal frequent subgraphs from graph databases, Proc. of KDD, 2004.
    • J. Huan, W. Wang, and J. Prins, and J. Yang. SPIN: mining maximal frequent subgraphs from graph databases, Proc. of KDD, 2004.
  • 6
    • 34548771873 scopus 로고    scopus 로고
    • An aprioribased algorithm for mining frequent substructures from graph data
    • A. Inokuchi, T. Washio, and H. Motoda. An aprioribased algorithm for mining frequent substructures from graph data, Proceedings of PDKK, 2000.
    • (2000) Proceedings of PDKK
    • Inokuchi, A.1    Washio, T.2    Motoda, H.3
  • 7
    • 14844305006 scopus 로고    scopus 로고
    • An efficient algorithm for detecting frequent subgraphs in bioloical networks
    • M. Koyuturk, A. Grama, and W.Szpankowski. An efficient algorithm for detecting frequent subgraphs in bioloical networks, Bionformatics, 20:200-207, 2004.
    • (2004) Bionformatics , vol.20 , pp. 200-207
    • Koyuturk, M.1    Grama, A.2    Szpankowski, W.3
  • 9
    • 12244294066 scopus 로고    scopus 로고
    • A quickstart in frequent structure mining can make a difference
    • S. Nijssen and J. Kok. A quickstart in frequent structure mining can make a difference Proc of KDD, 2004.
    • (2004) Proc of KDD
    • Nijssen, S.1    Kok, J.2
  • 10
    • 77952334885 scopus 로고    scopus 로고
    • CloseGraph: Mining Closed Frequent Graph Patterns
    • X. Yan and J. Han, CloseGraph: Mining Closed Frequent Graph Patterns, Proc.of SIGKDD, 2003.
    • (2003) Proc.of SIGKDD
    • Yan, X.1    Han, J.2
  • 11
    • 78149333073 scopus 로고    scopus 로고
    • X. Yan and J. Han. gSpan: graph-based substructure pattern mining, Proc. of ICDM, 2002.
    • X. Yan and J. Han. gSpan: graph-based substructure pattern mining, Proc. of ICDM, 2002.


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