메뉴 건너뛰기




Volumn 2, Issue January, 2014, Pages 1179-1187

Reducing the rank of relational factorization models by including observable patterns

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SCIENCE; TENSORS;

EID: 84937929114     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (92)

References (29)
  • 4
    • 77958549525 scopus 로고    scopus 로고
    • Toward an architecture for never-ending language learning
    • A. Carlson, J. Betteridge, B. Kisiel, B. Settles, Jr, and T. Mitchell. "Toward an Architecture for Never-Ending Language Learning". In: AAAI. 2010, pp. 1306-1313.
    • (2010) AAAI , pp. 1306-1313
    • Carlson, A.1    Betteridge, J.2    Kisiel, B.3    Settles, B.4    Mitchell, T.5
  • 7
    • 85162055675 scopus 로고    scopus 로고
    • Modeling homophily and stochastic equivalence in symmetric relational data
    • P. D. Hoff. "Modeling homophily and stochastic equivalence in symmetric relational data". In: Advances in Neural Information Processing Systems. Vol. 20. 2008, pp. 657-664.
    • (2008) Advances in Neural Information Processing Systems , vol.20 , pp. 657-664
    • Hoff, P.D.1
  • 10
    • 34247470526 scopus 로고    scopus 로고
    • Learning systems of concepts with an infinite relational model
    • C. Kemp, J. B. Tenenbaum, T. L. Griffiths, T. Yamada, and N. Ueda. "Learning systems of concepts with an infinite relational model". In: AAAI. Vol. 3. 2006, p. 5.
    • (2006) AAAI , vol.3 , pp. 5
    • Kemp, C.1    Tenenbaum, J.B.2    Griffiths, T.L.3    Yamada, T.4    Ueda, N.5
  • 12
    • 68649096448 scopus 로고    scopus 로고
    • Tensor decompositions and applications
    • T. G. Kolda and B. W. Bader. "Tensor Decompositions and Applications". In: SIAM Review 51.3 (2009), pp. 455-500.
    • (2009) SIAM Review , vol.51 , Issue.3 , pp. 455-500
    • Kolda, T.G.1    Bader, B.W.2
  • 15
    • 77955656002 scopus 로고    scopus 로고
    • Relational retrieval using a combination of path-constrained random walks
    • N. Lao and W. W. Cohen. "Relational retrieval using a combination of path-constrained random walks". In: Machine learning 81.1 (2010), pp. 53-67.
    • (2010) Machine Learning , vol.81 , Issue.1 , pp. 53-67
    • Lao, N.1    Cohen, W.W.2
  • 19
    • 0007202012 scopus 로고
    • A survey of clique and biclique coverings and factorizations of (0,1)-matrices
    • S. D. Monson, N. J. Pullman, and R. Rees. "A survey of clique and biclique coverings and factorizations of (0,1)-matrices". In: Bulletin of the ICA 14 (1995), pp. 17-86.
    • (1995) Bulletin of the ICA , vol.14 , pp. 17-86
    • Monson, S.D.1    Pullman, N.J.2    Rees, R.3
  • 23
    • 0001172265 scopus 로고
    • Learning logical definitions from relations
    • J. R. Quinlan. "Learning logical definitions from relations". In: Machine Learning 5 (1990), pp. 239-266.
    • (1990) Machine Learning , vol.5 , pp. 239-266
    • Quinlan, J.R.1
  • 24
    • 32044466073 scopus 로고    scopus 로고
    • Markov logic networks
    • M. Richardson and P. Domingos. "Markov logic networks". In: Machine Learning 62.1 (2006), pp. 107-136.
    • (2006) Machine Learning , vol.62 , Issue.1 , pp. 107-136
    • Richardson, M.1    Domingos, P.2


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