메뉴 건너뛰기




Volumn 7818 LNAI, Issue PART 1, 2013, Pages 225-236

Fast graph stream classification using discriminative clique hashing

Author keywords

Cliques; Graph classification; Graph streams; Hashing

Indexed keywords

CLASSIFICATION ACCURACY; CLIQUES; DATA MINING APPLICATIONS; GRAPH CLASSIFICATION; GRAPH STREAMS; HASHING; RULE-BASED CLASSIFIER; STATE-OF-THE-ART METHODS;

EID: 84893585514     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-37453-1_19     Document Type: Conference Paper
Times cited : (23)

References (18)
  • 2
    • 1942516986 scopus 로고    scopus 로고
    • Marginalized kernels between labeled graphs
    • Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: ICML, pp. 321-328 (2003)
    • (2003) ICML , pp. 321-328
    • Kashima, H.1    Tsuda, K.2    Inokuchi, A.3
  • 3
    • 34548585627 scopus 로고    scopus 로고
    • Shortest-path kernels on graphs
    • Borgwardt, K.M., Kriegel, H.P.: Shortest-path kernels on graphs. In: ICDM, pp. 74-81 (2005)
    • (2005) ICDM , pp. 74-81
    • Borgwardt, K.M.1    Kriegel, H.P.2
  • 4
    • 60949112299 scopus 로고    scopus 로고
    • Graph kernels based on tree patterns for molecules
    • Mahé, P., Vert, J.P.: Graph kernels based on tree patterns for molecules. Machine Learning 75(1), 3-35 (2009)
    • (2009) Machine Learning , vol.75 , Issue.1 , pp. 3-35
    • Mahé, P.1    Vert, J.P.2
  • 5
    • 77957984823 scopus 로고    scopus 로고
    • Fast subtree kernels on graphs
    • Shervashidze, N., Borgwardt, K.: Fast subtree kernels on graphs. In: NIPS, pp. 1660-1668 (2009)
    • (2009) NIPS , pp. 1660-1668
    • Shervashidze, N.1    Borgwardt, K.2
  • 7
    • 79957876446 scopus 로고    scopus 로고
    • On clustering graph streams
    • Aggarwal, C.C., Zhao, Y., Yu, P.S.: On clustering graph streams. In: SDM, pp. 478-489 (2010)
    • (2010) SDM , pp. 478-489
    • Aggarwal, C.C.1    Zhao, Y.2    Yu, P.S.3
  • 8
    • 80052677277 scopus 로고    scopus 로고
    • On dense pattern mining in graph streams
    • Aggarwal, C.C., Li, Y., Yu, P.S., Jin, R.: On dense pattern mining in graph streams. In: PVLDB, pp. 975-984 (2010)
    • (2010) PVLDB , pp. 975-984
    • Aggarwal, C.C.1    Li, Y.2    Yu, P.S.3    Jin, R.4
  • 9
    • 84874028089 scopus 로고    scopus 로고
    • On classification of graph streams
    • Aggarwal, C.C.: On classification of graph streams. In: SDM, pp. 652-663 (2011)
    • (2011) SDM , pp. 652-663
    • Aggarwal, C.C.1
  • 10
    • 77952415079 scopus 로고    scopus 로고
    • Mining concept-drifting data streams using ensemble classifiers
    • Wang, H., Fan, W., Yu, P.S., Han, J.: Mining concept-drifting data streams using ensemble classifiers. In: KDD, pp. 226-235 (2003)
    • (2003) KDD , pp. 226-235
    • Wang, H.1    Fan, W.2    Yu, P.S.3    Han, J.4
  • 11
    • 84874076138 scopus 로고    scopus 로고
    • Nested subtree hash kernels for large-scale graph classification over streams
    • Li, B., Zhu, X., Chi, L., Zhang, C.: Nested subtree hash kernels for large-scale graph classification over streams. In: ICDM, pp. 399-408 (2012)
    • (2012) ICDM , pp. 399-408
    • Li, B.1    Zhu, X.2    Chi, L.3    Zhang, C.4
  • 13
    • 77951165897 scopus 로고    scopus 로고
    • A linear-time graph kernel
    • Hido, S., Kashima, H.: A linear-time graph kernel. In: ICDM, pp. 179-188 (2009)
    • (2009) ICDM , pp. 179-188
    • Hido, S.1    Kashima, H.2
  • 14
    • 78149333073 scopus 로고    scopus 로고
    • gSpan: Graph-based substructure pattern mining
    • Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: ICDM, pp. 721-724 (2002)
    • (2002) ICDM , pp. 721-724
    • Yan, X.1    Han, J.2
  • 15
    • 0034592938 scopus 로고    scopus 로고
    • Mining high speed data streams
    • Domingos, P., Hulten, G.: Mining high speed data streams. In: KDD, pp. 71-80 (2000)
    • (2000) KDD , pp. 71-80
    • Domingos, P.1    Hulten, G.2
  • 16
    • 0035788947 scopus 로고    scopus 로고
    • A streaming ensemble algorithm (SEA) for large-scale classification
    • Street, W.N., Kim, Y.: A streaming ensemble algorithm (SEA) for large-scale classification. In: KDD, pp. 377-382 (2001)
    • (2001) KDD , pp. 377-382
    • Street, W.N.1    Kim, Y.2
  • 18
    • 84976668743 scopus 로고
    • Algorithm 457: Finding all cliques of an undirected graph
    • Bron, C., Kerbosch, J.: Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM 16(9), 575-577 (1973)
    • (1973) Communications of the ACM , vol.16 , Issue.9 , pp. 575-577
    • Bron, C.1    Kerbosch, J.2


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