메뉴 건너뛰기




Volumn 3801 LNAI, Issue , 2005, Pages 41-48

Mining common patterns on graphs

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; DATA MINING; LEARNING SYSTEMS; MATHEMATICAL MODELS;

EID: 33646855110     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11596448_6     Document Type: Conference Paper
Times cited : (1)

References (11)
  • 1
    • 0027652468 scopus 로고
    • Substructure discovery using minimum description length and background knowledge
    • Cook, D. J.; Holder, L. B. Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research, 1:231-255, 1994.
    • (1994) Journal of Artificial Intelligence Research , vol.1 , pp. 231-255
    • Cook, D.J.1    Holder, L.B.2
  • 2
    • 0037364958 scopus 로고    scopus 로고
    • Complete mining of frequent patterns from graphs: Mining graph data
    • Kluwer Academic Publishers
    • Inokuchi, A. Washio, T. Motoda, H. Complete Mining of Frequent Patterns from Graphs: Mining Graph Data. Machine Learning, Kluwer Academic Publishers. (2003). 321 - 354.
    • (2003) Machine Learning , pp. 321-354
    • Inokuchi, A.1    Washio, T.2    Motoda, H.3
  • 3
    • 32844471514 scopus 로고    scopus 로고
    • GSpan: Graph - Based substructure pattern mining
    • University of Illinois
    • Xifeng, Y. Jiawei H. gSpan: Graph - Based Substructure Pattern Mining. Technical Report. University of Illinois. (2002).
    • (2002) Technical Report
    • Xifeng, Y.1    Jiawei, H.2
  • 4
    • 33646833885 scopus 로고    scopus 로고
    • SEuS: Structure extraction using summaries
    • C. S. Department, University of Maryland
    • Shayan G. Sudarshan S.C. "SEuS: Structure Extraction using Summaries". Technical Report. C. S. Department, University of Maryland, (2002).
    • (2002) Technical Report
    • Shayan, G.1    Sudarshan, S.C.2
  • 5
    • 12244292385 scopus 로고    scopus 로고
    • An efficient algorithm for discovering frequent subgraphs
    • Dept. of Computing Science, University of Minnesota June
    • Kuramochi, M.; Karypis, G. An Efficient Algorithm for discovering Frequent Subgraphs. Tech. Report. Dept. of Computing Science, University of Minnesota June (2002).
    • (2002) Tech. Report
    • Kuramochi, M.1    Karypis, G.2
  • 7
    • 4243302245 scopus 로고    scopus 로고
    • Efficiently mining trees in a forest
    • Computer Science Department, Rensselaer Polytechnic Institute
    • Zaki, M. J. Efficiently Mining Trees in a Forest. Tech. Report 01-7, Computer Science Department, Rensselaer Polytechnic Institute, (2001).
    • (2001) Tech. Report , vol.1 , Issue.7
    • Zaki, M.J.1
  • 8
    • 0003677229 scopus 로고    scopus 로고
    • Springer - Verlang. Second Edition
    • Diestel, Reinhard. Graph Theory. Springer - Verlang. Second Edition (2000).
    • (2000) Graph Theory
    • Diestel, R.1


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