메뉴 건너뛰기




Volumn , Issue , 2011, Pages 66-71

Friendlink: Link prediction in social networks via bounded local path traversal

Author keywords

Link Prediction; Social Networks

Indexed keywords

EXPERIMENTAL COMPARISON; FACEBOOK; GRAPH FEATURES; LINK PREDICTION; ONLINE SOCIAL NETWORKS; REAL DATA SETS; SMALL WORLDS; SOCIAL NETWORKS;

EID: 84055190764     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CASON.2011.6085920     Document Type: Conference Paper
Times cited : (31)

References (10)
  • 1
    • 20444434710 scopus 로고    scopus 로고
    • How to search a social network
    • DOI 10.1016/j.socnet.2005.01.007, PII S0378873305000109
    • L. Adamic and E. Adar. How to search a social network. Social Networks, 27(3):187-203, 2005. (Pubitemid 40829786)
    • (2005) Social Networks , vol.27 , Issue.3 , pp. 187-203
    • Adamic, L.1    Adar, E.2
  • 4
    • 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
  • 6
    • 0002687371 scopus 로고
    • The small world problem
    • S. Milgram. The small world problem. Psychology Today, 22:61-67, 1967.
    • (1967) Psychology Today , vol.22 , pp. 61-67
    • Milgram, S.1
  • 8
    • 0018000537 scopus 로고
    • ENUMERATING ALL SIMPLE PATHS IN A GRAPH.
    • F. Rubin. Enumerating all simple paths in a graph. IEEE Transactions on Circuits and Systems, 25(8):641-642, 1978. (Pubitemid 9394800)
    • (1978) IEEE Trans Circuits Syst CAS-25 , Issue.8 , pp. 641-642
    • Rubin, F.1


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