메뉴 건너뛰기




Volumn , Issue , 2007, Pages 322-331

Local probabilistic models for link prediction

Author keywords

[No Author keywords available]

Indexed keywords

CO-AUTHORSHIP; CO-OCCURRENCE; INTERNATIONAL CONFERENCES; LARGE GRAPHS; LINK PREDICTION; PROBABILISTIC GRAPHICAL MODELS; PROBABILISTIC MODELLING; PROBABILITY MEASURES; REAL DATASETS; SEMANTIC FEATURES; SEMANTIC SIMILARITY; SOCIAL NETWORK ANALYSIS; SOCIAL NETWORKS;

EID: 49749117074     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2007.108     Document Type: Conference Paper
Times cited : (298)

References (20)
  • 1
    • 10944272139 scopus 로고    scopus 로고
    • Friends and neighbors on the web
    • L. A. Adamic and E. Adar. Friends and neighbors on the web. Social Networks, 25(3):211-230, 2003.
    • (2003) Social Networks , vol.25 , Issue.3 , pp. 211-230
    • Adamic, L.A.1    Adar, E.2
  • 3
    • 0038483826 scopus 로고    scopus 로고
    • Emergence of scaling in random networks.
    • A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. .Science, 286:509-512, 1999.
    • (1999) Science , vol.286 , pp. 509-512
    • Barabasi, A.-L.1    Albert, R.2
  • 10
    • 49749098687 scopus 로고    scopus 로고
    • A parameterized probabilistic model of network evolution for supervised link prediction
    • H. Kashima and N. Abe. A parameterized probabilistic model of network evolution for supervised link prediction. In ICDM, pages 340-349, 2006.
    • (2006) ICDM , pp. 340-349
    • Kashima, H.1    Abe, N.2
  • 13
    • 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, 2001.
    • (2001) Physical Review Letters E
    • Newman, M.E.J.1
  • 14
    • 34247527717 scopus 로고    scopus 로고
    • Prediction and ranking algorithms for event-based network data
    • J. O'Madadhain, J. Hutchins, and P. Smyth. Prediction and ranking algorithms for event-based network data. SIGKDD Explor Newsl., 7(2):23-30, 2005.
    • (2005) SIGKDD Explor Newsl , vol.7 , Issue.2 , pp. 23-30
    • O'Madadhain, J.1    Hutchins, J.2    Smyth, P.3
  • 15
    • 0242496221 scopus 로고    scopus 로고
    • Beyond independence: Probabilistic models for query approximation on binary transaction data
    • November
    • D. Pavlov, H. Mannila, and P. Smyth. Beyond independence: probabilistic models for query approximation on binary transaction data. IEEE Transactions on Knowledge and Data Engineering, 15(6): 1409-1421, November 2003.
    • (2003) IEEE Transactions on Knowledge and Data Engineering , vol.15 , Issue.6 , pp. 1409-1421
    • Pavlov, D.1    Mannila, H.2    Smyth, P.3
  • 17
    • 84957885501 scopus 로고    scopus 로고
    • The case for anomalous link discovery
    • 41-17
    • M. J. Rattigan and D. Jensen. The case for anomalous link discovery. SIGKDD Explor. Newsl., 7(2):41-17, 2005.
    • (2005) SIGKDD Explor. Newsl , vol.7 , Issue.2
    • Rattigan, M.J.1    Jensen, D.2


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