메뉴 건너뛰기




Volumn , Issue , 2011, Pages 320-329

Learning Markov Logic Networks via functional gradient boosting

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK DATA; EXPERIMENTAL EVALUATION; FUNCTIONAL APPROXIMATION PROBLEMS; FUNCTIONAL GRADIENT; HARD PROBLEMS; MARKOV LOGIC NETWORKS; STATE-OF-THE-ART METHODS; STATISTICAL RELATIONAL LEARNING; TREE-BASED; TWO-STEP APPROACH;

EID: 84857184874     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2011.87     Document Type: Conference Paper
Times cited : (91)

References (29)
  • 2
    • 0041779094 scopus 로고    scopus 로고
    • Learning probabilistic relational models
    • S. Dzeroski and N. Lavrac, Eds
    • L. Getoor, N. Friedman, D. Koller, and A. Pfeffer, "Learning probabilistic relational models," Relational Data Mining, S. Dzeroski and N. Lavrac, Eds., pp. 307-338, 2001.
    • (2001) Relational Data Mining , pp. 307-338
    • Getoor, L.1    Friedman, N.2    Koller, D.3    Pfeffer, A.4
  • 4
    • 2942660501 scopus 로고    scopus 로고
    • Relational Bayesian networks
    • M. Jaeger, "Relational Bayesian networks," in UAI, 1997.
    • (1997) UAI
    • Jaeger, M.1
  • 6
    • 1942418618 scopus 로고    scopus 로고
    • Discriminative probabilistic models for relational data
    • B. Taskar, P. Abeel, and D. Koller, "Discriminative probabilistic models for relational data," in UAI, 2002.
    • (2002) UAI
    • Taskar, B.1    Abeel, P.2    Koller, D.3
  • 7
    • 4444281941 scopus 로고    scopus 로고
    • Parameter learning of logic programs for symbolic-statistical modeling
    • T. Sato and Y. Kameya, "Parameter learning of logic programs for symbolic-statistical modeling," JAIR, pp. 391-454, 2001.
    • (2001) JAIR , pp. 391-454
    • Sato, T.1    Kameya, Y.2
  • 8
    • 0027702434 scopus 로고
    • Probabilistic Horn abduction and Bayesian networks
    • D. Poole, "Probabilistic Horn abduction and Bayesian networks," AIJ, pp. 81-129, 1993.
    • (1993) AIJ , pp. 81-129
    • Poole, D.1
  • 9
    • 85051974903 scopus 로고    scopus 로고
    • Structure learning of Markov logic networks through iterated local search
    • M. Biba, S. Ferilli, and F. Esposito, "Structure learning of Markov logic networks through iterated local search," in ECAI, 2008.
    • (2008) ECAI
    • Biba, M.1    Ferilli, S.2    Esposito, F.3
  • 10
    • 34547988135 scopus 로고    scopus 로고
    • Bottom-up learning of Markov logic network structure
    • L. Mihalkova and R. Mooney, "Bottom-up learning of Markov logic network structure," in ICML, 2007, pp. 625-632.
    • (2007) ICML , pp. 625-632
    • Mihalkova, L.1    Mooney, R.2
  • 11
    • 71149102017 scopus 로고    scopus 로고
    • Learning Markov logic network structure via hypergraph lifting
    • S. Kok and P. Domingos, "Learning Markov logic network structure via hypergraph lifting," in ICML, 2009.
    • (2009) ICML
    • Kok, S.1    Domingos, P.2
  • 12
    • 77956519107 scopus 로고    scopus 로고
    • Learning Markov logic networks using structural motifs
    • - - , "Learning Markov logic networks using structural motifs," in ICML, 2010.
    • (2010) ICML
    • Kok, S.1    Domingos, P.2
  • 13
    • 0035470889 scopus 로고    scopus 로고
    • Greedy function approximation: A gradient boosting machine
    • J. Friedman, "Greedy function approximation: A gradient boosting machine," Annals of Statistics, vol. 29, 2001.
    • (2001) Annals of Statistics , vol.29
    • Friedman, J.1
  • 14
    • 84889753643 scopus 로고    scopus 로고
    • Gradient-based boosting for statistical relational learning: The Relational Dependency Network case
    • To appear
    • S. Natarajan, T. Khot, K. Kersting, B. Gutmann, and J. Shavlik, "Gradient-based boosting for statistical relational learning: The Relational Dependency Network case," MLJ, To appear.
    • MLJ
    • Natarajan, S.1    Khot, T.2    Kersting, K.3    Gutmann, B.4    Shavlik, J.5
  • 15
    • 84855674138 scopus 로고    scopus 로고
    • TildeCRF: Conditional random fields for logical sequences
    • B. Gutmann and K. Kersting, "TildeCRF: Conditional random fields for logical sequences," in ECML, 2006.
    • (2006) ECML
    • Gutmann, B.1    Kersting, K.2
  • 16
    • 56449088242 scopus 로고    scopus 로고
    • Non-parametric policy gradients: A unified treatment of propositional and relational domains
    • K. Kersting and K. Driessens, "Non-parametric policy gradients: A unified treatment of propositional and relational domains," in ICML, 2008.
    • (2008) ICML
    • Kersting, K.1    Driessens, K.2
  • 17
    • 67049169348 scopus 로고    scopus 로고
    • Boosting relational sequence alignments
    • A. Karwath, K. Kersting, and N. Landwehr, "Boosting relational sequence alignments," in ICDM, 2008.
    • (2008) ICDM
    • Karwath, A.1    Kersting, K.2    Landwehr, N.3
  • 18
    • 56349084627 scopus 로고    scopus 로고
    • Gradient tree boosting for training conditional random fields
    • T. Dietterich, A. Ashenfelter, and Y. Bulatov, "Gradient tree boosting for training conditional random fields," JMLR, pp. 2113-2139, 2008.
    • (2008) JMLR , pp. 2113-2139
    • Dietterich, T.1    Ashenfelter, A.2    Bulatov, Y.3
  • 19
    • 77958567180 scopus 로고    scopus 로고
    • Speeding up inference in Markov logic networks by preprocessing to reduce the size of the resulting grounded network
    • J. Shavlik and S. Natarajan, "Speeding up inference in Markov logic networks by preprocessing to reduce the size of the resulting grounded network," in IJCAI, 2009.
    • (2009) IJCAI
    • Shavlik, J.1    Natarajan, S.2
  • 20
    • 0032069371 scopus 로고    scopus 로고
    • Top-down induction of firstorder logical decision trees
    • H. Blockeel and L. D. Raedt, "Top-down induction of firstorder logical decision trees," Artificial Intelligence, vol. 101, pp. 285-297, 1998.
    • (1998) Artificial Intelligence , vol.101 , pp. 285-297
    • Blockeel, H.1    Raedt, L.D.2
  • 22
    • 33749249600 scopus 로고    scopus 로고
    • The relationship between Precision-Recall and ROC curves
    • J. Davis and M. Goadrich, "The relationship between Precision-Recall and ROC curves," in ICML, 2006.
    • (2006) ICML
    • Davis, J.1    Goadrich, M.2
  • 24
    • 77952372966 scopus 로고    scopus 로고
    • Adaptive duplicate detection using learnable string similarity measures
    • M. Bilenko and R. Mooney, "Adaptive duplicate detection using learnable string similarity measures," in KDD, 2003.
    • (2003) KDD
    • Bilenko, M.1    Mooney, R.2
  • 25
    • 36348979272 scopus 로고    scopus 로고
    • Joint inference in information extraction
    • H. Poon and P. Domingos, "Joint inference in information extraction," in AAAI, 2007, pp. 913-918.
    • (2007) AAAI , pp. 913-918
    • Poon, H.1    Domingos, P.2
  • 26
    • 84878044770 scopus 로고    scopus 로고
    • Entity resolution with Markov logic
    • P. Singla and P. Domingos, "Entity resolution with Markov logic," in ICDM, 2006, pp. 572-582.
    • (2006) ICDM , pp. 572-582
    • Singla, P.1    Domingos, P.2
  • 28
    • 57749181750 scopus 로고    scopus 로고
    • Lifted first-order belief propagation
    • P. Singla and P. Domingos, "Lifted first-order belief propagation," in AAAI, 2008, pp. 1094-1099.
    • (2008) AAAI , pp. 1094-1099
    • Singla, P.1    Domingos, P.2
  • 29
    • 79951739472 scopus 로고    scopus 로고
    • Learning Markov network structure with decision trees
    • D. Lowd and J. Davis, "Learning Markov network structure with decision trees," in ICDM, 2010.
    • (2010) ICDM
    • Lowd, D.1    Davis, J.2


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