메뉴 건너뛰기




Volumn , Issue , 2011, Pages 642-651

Online max-margin weight learning for Markov logic networks

Author keywords

Online learning; Statistical relational learning; Structured prediction

Indexed keywords

COMPUTER CIRCUITS; DATA MINING; E-LEARNING; LARGE DATASET; MARKOV PROCESSES; PROBABILISTIC LOGICS; SPACE DIVISION MULTIPLE ACCESS;

EID: 80052396679     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972818.55     Document Type: Conference Paper
Times cited : (21)

References (42)
  • 9
    • 0000259511 scopus 로고    scopus 로고
    • Approximate statistical tests for comparing supervised classification learning algorithms
    • Dietterich, T.G.: Approximate statistical tests for comparing supervised classification learning algorithms. Neural Computation 10(7), 1895-1923 (1998)
    • (1998) Neural Computation , vol.10 , Issue.7 , pp. 1895-1923
    • Dietterich, T.G.1
  • 12
    • 0013344078 scopus 로고    scopus 로고
    • Training products of experts by minimizing contrastive divergence
    • Hinton, G.E.: Training products of experts by minimizing contrastive divergence. Neural Computation 14(8), 1771-1800 (2002)
    • (2002) Neural Computation , vol.14 , Issue.8 , pp. 1771-1800
    • Hinton, G.E.1
  • 16
    • 77951165785 scopus 로고    scopus 로고
    • Mind the duality gap: Logarithmic regret algorithms for online optimization
    • Koller, D., Schuurmans, D., Bengio, Y., Bottou, L. (eds.) Vancouver, British Columbia, Canada, December 8-11 MIT Press (2009)
    • Kakade, S.M., Shalev-Shwartz, S.: Mind the duality gap: Logarithmic regret algorithms for online optimization. In: Koller, D., Schuurmans, D., Bengio, Y., Bottou, L. (eds.) Advances in Neural Information Processing Systems 21, Vancouver, British Columbia, Canada, December 8-11, 2008. pp. 1457-1464. MIT Press (2009)
    • (2008) Advances in Neural Information Processing Systems , vol.21 , pp. 1457-1464
    • Kakade, S.M.1    Shalev-Shwartz, S.2
  • 17
    • 0041849711 scopus 로고    scopus 로고
    • A general stochastic approach to solving problems with hard and soft constraints
    • Dingzhu Gu, J.D., Pardalos, P. (eds.) American Mathematical Society
    • Kautz, H., Selman, B., Jiang, Y.: A general stochastic approach to solving problems with hard and soft constraints. In: Dingzhu Gu, J.D., Pardalos, P. (eds.) The Satisfiability Problem: Theory and Applications. pp. 573-586. American Mathematical Society (1997)
    • (1997) The Satisfiability Problem: Theory and Applications , pp. 573-586
    • Kautz, H.1    Selman, B.2    Jiang, Y.3
  • 26
    • 33645983416 scopus 로고    scopus 로고
    • The proposition bank: An annotated corpus of semantic roles
    • Palmer, M., Gildea, D., Kingsbury, P.: The Proposition Bank: An Annotated Corpus of Semantic Roles. Computational Linguistics 31(1), 71-106 (2005)
    • (2005) Computational Linguistics , vol.31 , Issue.1 , pp. 71-106
    • Palmer, M.1    Gildea, D.2    Kingsbury, P.3
  • 33
    • 84864036264 scopus 로고    scopus 로고
    • Convex repeated games and fenchel duality
    • Schölkopf, B., Platt, J., Hoffman, T. (eds.) MIT Press
    • Shalev-Shwartz, S., Singer, Y.: Convex repeated games and Fenchel duality. In: Schölkopf, B., Platt, J., Hoffman, T. (eds.) Advances in Neural Information Processing Systems 19, pp. 1265-1272. MIT Press (2007)
    • (2007) Advances in Neural Information Processing Systems , vol.19 , pp. 1265-1272
    • Shalev-Shwartz, S.1    Singer, Y.2


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