메뉴 건너뛰기




Volumn , Issue , 2012, Pages 505-516

A model-based approach to attributed graph clustering

Author keywords

attributed graph clustering; bayesian method; model based clustering

Indexed keywords

ATTRIBUTE INFORMATION; ATTRIBUTED GRAPHS; BAYESIAN METHODS; BAYESIAN PROBABILISTIC MODELS; COMMUNITY DETECTION; DISTANCE MEASURE; DISTANCE-BASED; GRAPH CLUSTERING; MODEL BASED APPROACH; MODEL-BASED CLUSTERING; PROBABILISTIC INFERENCE; REAL-WORLD DATASETS; REAL-WORLD GRAPHS; VARIATIONAL ALGORITHMS;

EID: 84862690118     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213836.2213894     Document Type: Conference Paper
Times cited : (332)

References (20)
  • 1
    • 79952562794 scopus 로고    scopus 로고
    • Clustering large attributed graphs: A balance between structural and attribute similarities
    • H. Cheng, Y. Zhou, and J. X. Yu. Clustering large attributed graphs: A balance between structural and attribute similarities. TKDD, 5(2):12, 2011.
    • (2011) TKDD , vol.5 , Issue.2 , pp. 12
    • Cheng, H.1    Zhou, Y.2    Yu, J.X.3
  • 5
    • 85026972772 scopus 로고    scopus 로고
    • Probabilistic latent semantic indexing
    • T. Hofmann. Probabilistic latent semantic indexing. In SIGIR, pages 50-57, 1999.
    • (1999) SIGIR , pp. 50-57
    • Hofmann, T.1
  • 6
    • 3142728485 scopus 로고    scopus 로고
    • Central clustering of attributed graphs
    • B. J. Jain and F. Wysotzki. Central clustering of attributed graphs. Machine Learning, 56(1-3):169-207, 2004.
    • (2004) Machine Learning , vol.56 , Issue.1-3 , pp. 169-207
    • Jain, B.J.1    Wysotzki, F.2
  • 7
    • 0033225865 scopus 로고    scopus 로고
    • An introduction to variational methods for graphical models
    • M. I. Jordan, Z. Ghahramani, T. Jaakkola, and L. K. Saul. An introduction to variational methods for graphical models. Machine Learning, 37(2):183-233, 1999.
    • (1999) Machine Learning , vol.37 , Issue.2 , pp. 183-233
    • Jordan, M.I.1    Ghahramani, Z.2    Jaakkola, T.3    Saul, L.K.4
  • 10
    • 42749100809 scopus 로고    scopus 로고
    • Fast algorithm for detecting community structure in networks
    • M. E. J. Newman. Fast algorithm for detecting community structure in networks. Physical Review E, 69:066133, 2004.
    • (2004) Physical Review E , vol.69 , pp. 066133
    • Newman, M.E.J.1
  • 11
    • 37649028224 scopus 로고    scopus 로고
    • Finding and evaluating community structure in networks
    • M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69:066113, 2004.
    • (2004) Physical Review E , vol.69 , pp. 066113
    • Newman, M.E.J.1    Girvan, M.2
  • 17
    • 34748827346 scopus 로고    scopus 로고
    • Fast random walk with restart and its applications
    • H. Tong, C. Faloutsos, and J.-Y. Pan. Fast random walk with restart and its applications. In ICDM, pages 613-622, 2006.
    • (2006) ICDM , pp. 613-622
    • Tong, H.1    Faloutsos, C.2    Pan, J.-Y.3
  • 18
    • 77951296086 scopus 로고    scopus 로고
    • Clustering based on random graph model embedding vertex features
    • H. Zanghi, S. Volant, and C. Ambroise. Clustering based on random graph model embedding vertex features. Pattern Recognition Letters, 31(9):830-836, 2010.
    • (2010) Pattern Recognition Letters , vol.31 , Issue.9 , pp. 830-836
    • Zanghi, H.1    Volant, S.2    Ambroise, C.3
  • 19
    • 77955045035 scopus 로고    scopus 로고
    • Graph clustering based on structural/attribute similarities
    • Y. Zhou, H. Cheng, and J. X. Yu. Graph clustering based on structural/attribute similarities. PVLDB, 2(1):718-729, 2009.
    • (2009) PVLDB , vol.2 , Issue.1 , pp. 718-729
    • Zhou, Y.1    Cheng, H.2    Yu, J.X.3
  • 20
    • 79951739260 scopus 로고    scopus 로고
    • Clustering large attributed graphs: An efficient incremental approach
    • Y. Zhou, H. Cheng, and J. X. Yu. Clustering large attributed graphs: An efficient incremental approach. In ICDM, pages 689-698, 2010.
    • (2010) ICDM , pp. 689-698
    • Zhou, Y.1    Cheng, H.2    Yu, J.X.3


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