메뉴 건너뛰기




Volumn , Issue , 2012, Pages 1019-1028

Vertex collocation profiles: Subgraph counting for link analysis and prediction

Author keywords

Graph theory; Link analysis; Link prediction; Network analysis

Indexed keywords

COMPLETE INFORMATION; DOMAIN EXPERTS; FORMATION MECHANISM; GROWTH MECHANISMS; LARGE NETWORKS; LINK ANALYSIS; LINK PREDICTION; LOCAL STRUCTURE; SUBGRAPHS; VERTEX PAIRS;

EID: 84860852495     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2187836.2187973     Document Type: Conference Paper
Times cited : (65)

References (22)
  • 1
    • 10944272139 scopus 로고    scopus 로고
    • Friends and neighbors on the web
    • L. Adamic and E. Adar. Friends and neighbors on the web. Social Networks, 25:211-230, 2001.
    • (2001) Social Networks , vol.25 , pp. 211-230
    • Adamic, L.1    Adar, E.2
  • 3
    • 0030211964 scopus 로고    scopus 로고
    • Bagging predictors
    • L. Breiman. Bagging predictors. Machine Learning, 24(2):123-140, 1996.
    • (1996) Machine Learning , vol.24 , Issue.2 , pp. 123-140
    • Breiman, L.1
  • 4
    • 0035478854 scopus 로고    scopus 로고
    • Random forests
    • L. Breiman. Random forests. Machine Learning, 45(1):5-32, 2001.
    • (2001) Machine Learning , vol.45 , Issue.1 , pp. 5-32
    • Breiman, L.1
  • 8
    • 69549133517 scopus 로고    scopus 로고
    • Measuring classifier performance: A coherent alternative to the area under the ROC curve
    • D. Hand. Measuring classifier performance: a coherent alternative to the area under the ROC curve. Machine Learning, 77(1):103-123, 2009.
    • (2009) Machine Learning , vol.77 , Issue.1 , pp. 103-123
    • Hand, D.1
  • 9
    • 0032139235 scopus 로고    scopus 로고
    • The random subspace method for constructing decision forests
    • T. K. Ho. The random subspace method for constructing decision forests. IEEE Trans. on Pattern Analysis and Machine Intelligence, 20(8):832-844, 1998.
    • (1998) IEEE Trans. on Pattern Analysis and Machine Intelligence , vol.20 , Issue.8 , pp. 832-844
    • Ho, T.K.1
  • 10
    • 65249157560 scopus 로고
    • The divergence and Bhattacharyya distance measures in signal selection
    • T. Kailath. The divergence and Bhattacharyya distance measures in signal selection. IEEE Trans. on Communications Technology, 15(1):52-60, 1967.
    • (1967) IEEE Trans. on Communications Technology , vol.15 , Issue.1 , pp. 52-60
    • Kailath, T.1
  • 11
    • 0002827622 scopus 로고
    • A new status index derived from sociometric analysis
    • L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18(1):39-43, 1953.
    • (1953) Psychometrika , vol.18 , Issue.1 , pp. 39-43
    • Katz, L.1
  • 18
    • 0035420724 scopus 로고    scopus 로고
    • Clustering and preferential attachment in growing networks
    • M. E. J. Newman. Clustering and preferential attachment in growing networks. Physical Review Letters E, 64, 2001.
    • (2001) Physical Review Letters E , vol.64
    • Newman, M.E.J.1
  • 19
    • 33846672214 scopus 로고    scopus 로고
    • Biological network comparison using graphlet degree distribution
    • N. Pržulj. Biological network comparison using graphlet degree distribution. Bioinformatics, 23(2):177-183, 2007.
    • (2007) Bioinformatics , vol.23 , Issue.2 , pp. 177-183
    • Pržulj, N.1
  • 20
    • 83555173271 scopus 로고    scopus 로고
    • Predictors of short-term decay of cell phone contacts in a large-scale communication network
    • T. Raeder, O. Lizardo, D. Hachen, and N. V. Chawla. Predictors of short-term decay of cell phone contacts in a large-scale communication network. Social Networks, 33(4):245-257, 2011.
    • (2011) Social Networks , vol.33 , Issue.4 , pp. 245-257
    • Raeder, T.1    Lizardo, O.2    Hachen, D.3    Chawla, N.V.4


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