메뉴 건너뛰기




Volumn , Issue , 2013, Pages 793-804

Link prediction across networks by biased cross-network sampling

Author keywords

[No Author keywords available]

Indexed keywords

ATTRIBUTE INFORMATION; INFERENCE PROCESS; LEARNING MECHANISM; LINK PREDICTION; LINKAGE INFORMATION; NETWORK STRUCTURES; NODE ATTRIBUTE; TRANSFER LEARNING METHODS;

EID: 84881335106     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2013.6544875     Document Type: Conference Paper
Times cited : (39)

References (24)
  • 1
    • 84958169422 scopus 로고    scopus 로고
    • Discovering missing links in wikipedia
    • S. F. Adafre and M. Rijke, "Discovering missing links in wikipedia," in LINK-KDD, 2005.
    • (2005) LINK-KDD
    • Adafre, S.F.1    Rijke, M.2
  • 3
    • 18744397044 scopus 로고    scopus 로고
    • Statistical relational learning for document mining
    • A. Popescul, L. Ungar, S. Lawrence, and D. Pennock, "Statistical relational learning for document mining," in ICDM, 2003.
    • (2003) ICDM
    • Popescul, A.1    Ungar, L.2    Lawrence, S.3    Pennock, D.4
  • 5
    • 49749098687 scopus 로고    scopus 로고
    • A parameterized probabilistic model of evolution for supervised link prediction
    • H. Kashima and N. Abe, "A parameterized probabilistic model of evolution for supervised link prediction," in ICDM, 2006.
    • (2006) ICDM
    • Kashima, H.1    Abe, N.2
  • 6
    • 49749117074 scopus 로고    scopus 로고
    • Local probabilistic models for link prediction
    • C. Wang, V. Satuluri, and S. Parthasarathy, "Local probabilistic models for link prediction," in ICDM, 2007.
    • (2007) ICDM
    • Wang, C.1    Satuluri, V.2    Parthasarathy, S.3
  • 7
    • 85015599911 scopus 로고    scopus 로고
    • The link prediction problem for social networks
    • D. Liben-Nowell and J. Kleinberg, "The link prediction problem for social networks," in LinkKDD, 2004.
    • (2004) LinkKDD
    • Liben-Nowell, D.1    Kleinberg, J.2
  • 11
    • 10944272139 scopus 로고    scopus 로고
    • Friends and neighbors on the web
    • L. Adamic and E. Adar, "Friends and neighbors on the web," Social Networks, vol. 25, 2001.
    • (2001) Social Networks , vol.25
    • Adamic, L.1    Adar, E.2
  • 12
    • 0035420724 scopus 로고    scopus 로고
    • Clustering and preferential attachment in growing networks
    • M. E. J. Newman, "Clustering and preferential attachment in growing networks," Physical Review Letters, 2001.
    • (2001) Physical Review Letters
    • Newman, M.E.J.1
  • 14
    • 16344373871 scopus 로고    scopus 로고
    • Learning probabilistic models of relational structure
    • L. Getoor, N. Friedman, D. Koller, and B. Taskar, "Learning probabilistic models of relational structure," in ICML, 2001.
    • (2001) ICML
    • Getoor, L.1    Friedman, N.2    Koller, D.3    Taskar, B.4
  • 16
    • 74549160353 scopus 로고    scopus 로고
    • A framework for semantic link discovery over relational data
    • O. Hassanzadeh and et al, "A framework for semantic link discovery over relational data," in CIKM, 2009.
    • (2009) CIKM
    • Hassanzadeh, O.1
  • 17
    • 1942418618 scopus 로고    scopus 로고
    • Discriminative probabilistic models for relational data
    • B. Taskar, P. Abbeel, and D. Kollerk, "Discriminative probabilistic models for relational data," in UAI, 2002.
    • (2002) UAI
    • Taskar, B.1    Abbeel, P.2    Kollerk, D.3
  • 21
    • 0000120766 scopus 로고
    • Esitmating the dimension of a model
    • G. Schwartz, "Esitmating the dimension of a model," Annals of Statistics, vol. 6, pp. 461-464, 1979.
    • (1979) Annals of Statistics , vol.6 , pp. 461-464
    • Schwartz, G.1
  • 23
    • 0037403111 scopus 로고    scopus 로고
    • Mirror descent and nonlinear projected subgradient methods for convex optimization
    • May
    • A. Beck and M. Teboulle, "Mirror descent and nonlinear projected subgradient methods for convex optimization," Operations Research Letters, vol. 31, no. 3, pp. 167-175, May 2003.
    • (2003) Operations Research Letters , vol.31 , Issue.3 , pp. 167-175
    • Beck, A.1    Teboulle, M.2


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