메뉴 건너뛰기




Volumn E95-D, Issue 11, 2012, Pages 2664-2673

Link prediction across time via cross-temporal locality preserving projections

Author keywords

Dimension reduction; Entity resolution; Link prediction; Social network analysis; Temporal data

Indexed keywords

DATA MINING; EIGENVALUES AND EIGENFUNCTIONS; LEARNING ALGORITHMS; LEARNING SYSTEMS; SOCIAL NETWORKING (ONLINE);

EID: 84868243622     PISSN: 09168532     EISSN: 17451361     Source Type: Journal    
DOI: 10.1587/transinf.E95.D.2664     Document Type: Article
Times cited : (4)

References (41)
  • 1
    • 33746689579 scopus 로고    scopus 로고
    • Link mining: A survey
    • L. Getoor and C.P. Diehl, "Link mining: A survey," SIGKDD Explorations, vol.7, no.2, pp.3-12, 2005.
    • (2005) SIGKDD Explorations , vol.7 , Issue.2 , pp. 3-12
    • Getoor, L.1    Diehl, C.P.2
  • 2
    • 36849035459 scopus 로고    scopus 로고
    • Dynamic social network analysis using latent space models
    • P. Sarkar and A.W. Moore, "Dynamic social network analysis using latent space models," SIGKDD Explorations, vol.7, no.2, pp.31-40, 2005.
    • (2005) SIGKDD Explorations , vol.7 , Issue.2 , pp. 31-40
    • Sarkar, P.1    Moore, A.W.2
  • 6
    • 67649958523 scopus 로고    scopus 로고
    • The time-series link prediction problem with applications in communication surveillance
    • Z. Huang and D.K.J. Lin, "The time-series link prediction problem with applications in communication surveillance," INFORMS J. Computing, vol.21, pp.286-303, 2009.
    • (2009) INFORMS J. Computing , vol.21 , pp. 286-303
    • Huang, Z.1    Lin, D.K.J.2
  • 9
    • 0033321440 scopus 로고    scopus 로고
    • Building hypertext links by computing semantic similarity
    • S.J. Green, "Building hypertext links by computing semantic similarity," IEEE Trans. Knowl. Data Eng., vol.11, no.5, pp.713-730, 1999.
    • (1999) IEEE Trans. Knowl. Data Eng. , vol.11 , Issue.5 , pp. 713-730
    • Green, S.J.1
  • 12
    • 0031189914 scopus 로고    scopus 로고
    • Multitask learning
    • R. Caruana, "Multitask learning," Mach. Learn., vol.28, no.1, pp.41-75, 1997.
    • (1997) Mach. Learn. , vol.28 , Issue.1 , pp. 41-75
    • Caruana, R.1
  • 17
    • 68649096448 scopus 로고    scopus 로고
    • Tensor decompositions and applications
    • T.G. Kolda and B.W. Bader, "Tensor decompositions and applications," SIAM Review, vol.51, no.3, pp.455-500, 2009.
    • (2009) SIAM Review , vol.51 , Issue.3 , pp. 455-500
    • Kolda, T.G.1    Bader, B.W.2
  • 18
    • 0013953617 scopus 로고
    • Some mathematical notes on three-mode factor analysis
    • L. Tucker, "Some mathematical notes on three-mode factor analysis," Psychometrika, vol.31, no.3, pp.279-311, 1966.
    • (1966) Psychometrika , vol.31 , Issue.3 , pp. 279-311
    • Tucker, L.1
  • 21
    • 24744435534 scopus 로고    scopus 로고
    • Kernel methods for predicting protein-protein interactions
    • A. Ben-Hur and W.S. Noble, "Kernel methods for predicting protein-protein interactions," Bioinformatics, vol.21, no.Suppl. 1, pp.i38-i46, 2005.
    • (2005) Bioinformatics , vol.21 , Issue.SUPPL. 1
    • Ben-Hur, A.1    Noble, W.S.2
  • 23
    • 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 Explorations, vol.7, no.2, pp.23-30, 2005.
    • (2005) SIGKDD Explorations , vol.7 , Issue.2 , pp. 23-30
    • O'Madadhain, J.1    Hutchins, J.2    Smyth, P.3
  • 26
    • 0032623127 scopus 로고    scopus 로고
    • A p? primer: Logit models for social networks
    • C.J. Anderson, S. Wasserman, and B. Crouch, "A p? primer: Logit models for social networks," Social Networks, vol.21, pp.37-66, 1999.
    • (1999) Social Networks , vol.21 , pp. 37-66
    • Anderson, C.J.1    Wasserman, S.2    Crouch, B.3


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