메뉴 건너뛰기




Volumn 5181 LNCS, Issue , 2008, Pages 684-692

DB-FSG: An SQL-Based approach for frequent subgraph mining

Author keywords

[No Author keywords available]

Indexed keywords

BI-DIRECTIONAL; COMPUTER NETWORKS; DUPLICATE ELIMINATION; EXPERIMENTAL EVALUATIONS; FREQUENT SUBGRAPH MINING; FREQUENT SUBGRAPHS; GRAPH MINING; GRAPH REPRESENTATIONS; INTERNATIONAL CONFERENCES; MAIN MEMORIES; ONE-FORM; RELATIONAL DATABASES; RELATIONAL OPERATORS; SOCIAL NETWORKS;

EID: 52949121451     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85654-2_59     Document Type: Conference Paper
Times cited : (15)

References (11)
  • 1
    • 7444254104 scopus 로고    scopus 로고
    • Database approach to graph mining
    • Dai, H, Srikant, R, Zhang, C, eds, PAKDD 2004, Springer, Heidelberg
    • Chakravarthy, S., Beera, R., Balachandran, R.: Database approach to graph mining. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 341-350. Springer, Heidelberg (2004)
    • (2004) LNCS (LNAI , vol.3056 , pp. 341-350
    • Chakravarthy, S.1    Beera, R.2    Balachandran, R.3
  • 3
    • 0037364958 scopus 로고    scopus 로고
    • Complete mining of frequent patterns from graphs: Mining graph data
    • Inokuchi, A., Washio, T., Motoda, H.: Complete mining of frequent patterns from graphs: Mining graph data. Mach. Learn. 50(3) (2003)
    • (2003) Mach. Learn , vol.50 , Issue.3
    • Inokuchi, A.1    Washio, T.2    Motoda, H.3
  • 4
    • 78149312583 scopus 로고    scopus 로고
    • Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM 2001: Proc. of the 2001 IEEE International Conference on Data Mining, Washington, DC, USA, pp. 313-320. IEEE Computer Society, Los Alarnitos (2001)
    • Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM 2001: Proc. of the 2001 IEEE International Conference on Data Mining, Washington, DC, USA, pp. 313-320. IEEE Computer Society, Los Alarnitos (2001)
  • 5
    • 35248818313 scopus 로고    scopus 로고
    • Performance evaluation and analysis of k-way join variants for association rule mining
    • James, A, Younas, M, Lings, B, eds, BNCOD 2003, Springer, Heidelberg
    • Mishra, P., Chakravarthy, S.: Performance evaluation and analysis of k-way join variants for association rule mining. In: James, A., Younas, M., Lings, B. (eds.) BNCOD 2003. LNCS, vol. 2712, pp. 95-114. Springer, Heidelberg (2003)
    • (2003) LNCS , vol.2712 , pp. 95-114
    • Mishra, P.1    Chakravarthy, S.2
  • 9
    • 0032094477 scopus 로고    scopus 로고
    • Integrating mining with relational database systems: Alternatives and implications
    • Sarawagi, S., Thomas, S., Agrawal, R.: Integrating mining with relational database systems: Alternatives and implications. In: SIGMOD Conference, pp. 343-354 (1998)
    • (1998) SIGMOD Conference , pp. 343-354
    • Sarawagi, S.1    Thomas, S.2    Agrawal, R.3
  • 10
    • 52949134724 scopus 로고    scopus 로고
    • Washio, T., Motoda, H.: State of the art of graph-based data, mining. SIGKDD Explor. Newsl. 5(1), 59-68 (2003)
    • Washio, T., Motoda, H.: State of the art of graph-based data, mining. SIGKDD Explor. Newsl. 5(1), 59-68 (2003)
  • 11
    • 78149333073 scopus 로고    scopus 로고
    • Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: ICDM 2002: Proc. of the 2002 IEEE Int. Conf. on Data Mining, pp. 721-731 (2002)
    • Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: ICDM 2002: Proc. of the 2002 IEEE Int. Conf. on Data Mining, pp. 721-731 (2002)


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