메뉴 건너뛰기




Volumn 89, Issue 1, 2008, Pages 131-160

Learning ground CP-logic theories by leveraging bayesian network learning techniques

Author keywords

CP logic; Statistical relational learning

Indexed keywords

BAYESIAN NETWORKS; DISTRIBUTED PARAMETER NETWORKS; EDUCATION; INFERENCE ENGINES; INFORMATION MANAGEMENT; INTELLIGENT NETWORKS; MEDICAL APPLICATIONS; PROBABILITY; SPEECH ANALYSIS;

EID: 58149485308     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper
Times cited : (30)

References (32)
  • 2
    • 38049150636 scopus 로고    scopus 로고
    • Towards learning non-recursive LPADs by transforming them into Bayesian networks
    • Inductive Logic Programming, ILP 2006, Revised Selected Papers, Springer
    • Blocked, H., Meert, W.: Towards learning non-recursive LPADs by transforming them into Bayesian networks, Inductive Logic Programming, ILP 2006, Revised Selected Papers, LNCS 4455, Springer, 2007.
    • (2007) LNCS , vol.4455
    • Blocked, H.1    Meert, W.2
  • 3
    • 0028544625 scopus 로고
    • Introduction to the special section on knowledge-based construction of probabilistic and decision models
    • Breese, J., Goldman, R., Wellman, M.: Introduction to the special section on knowledge-based construction of probabilistic and decision models, IEEE Transactions on Systems, Man, and Cybernetics, 24(11), 1994, 1577-1579.
    • (1994) IEEE Transactions on Systems, Man, and Cybernetics , vol.24 , Issue.11 , pp. 1577-1579
    • Breese, J.1    Goldman, R.2    Wellman, M.3
  • 4
    • 84880905111 scopus 로고    scopus 로고
    • De Raedt, L., Kimmig, A., Toivonen, H.: ProbLog: A Probabilistic Prolog and its Application in Link Discovery, Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI07), 2007.
    • De Raedt, L., Kimmig, A., Toivonen, H.: ProbLog: A Probabilistic Prolog and its Application in Link Discovery, Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI07), 2007.
  • 5
    • 0002629270 scopus 로고
    • Maximum likelihood from incomplete data via the EM algorithm
    • Dempster, N., Laird, A., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm, J. R. Statist. Soc. B, 39, 1977, 185-197.
    • (1977) J. R. Statist. Soc. B , vol.39 , pp. 185-197
    • Dempster, N.1    Laird, A.2    Rubin, D.3
  • 10
    • 34547977978 scopus 로고    scopus 로고
    • Getoor, L, Taskar, B, Eds, MIT Press
    • Getoor, L., Taskar, B., Eds.: Statistical Relational Learning, MIT Press, 2007.
    • (2007) Statistical Relational Learning
  • 15
    • 33749434592 scopus 로고    scopus 로고
    • BNT Structure Learning Package: Documentation and Experiments
    • Technical report, Laboratoire PS1
    • Leray, P., Francois, O.: BNT Structure Learning Package: Documentation and Experiments, Technical report, Laboratoire PS1, 2004.
    • (2004)
    • Leray, P.1    Francois, O.2
  • 23
    • 0031187203 scopus 로고    scopus 로고
    • The independent choice logic for modelling multiple agents under uncertainty
    • Poole, D.: The independent choice logic for modelling multiple agents under uncertainty, Artificial Intelligence, 94(1-2), 1997, 7-56.
    • (1997) Artificial Intelligence , vol.94 , Issue.1-2 , pp. 7-56
    • Poole, D.1
  • 24
    • 4344599161 scopus 로고    scopus 로고
    • Exploiting contextual independence in probabilistic inference
    • Poole, D., Zhang, N.: Exploiting contextual independence in probabilistic inference, Journal of Artificial Intelligence Research, 18, 2003, 263-313.
    • (2003) Journal of Artificial Intelligence Research , vol.18 , pp. 263-313
    • Poole, D.1    Zhang, N.2
  • 26
    • 22944492698 scopus 로고    scopus 로고
    • Learning logic programs with annotated disjunctions
    • 14th Internation Conference on Inductive Logic Programming ILP04, Springer
    • Riguzzi, F.: Learning logic programs with annotated disjunctions, 14th Internation Conference on Inductive Logic Programming (ILP04), LNCS 4455, Springer, 2004.
    • (2004) LNCS , vol.4455
    • Riguzzi, F.1
  • 27
    • 37849054407 scopus 로고    scopus 로고
    • ALLPAD: Approximate learning of logic programs with annotated disjunctions
    • Riguzzi, F.: ALLPAD: Approximate learning of logic programs with annotated disjunctions, Machine Learning, 70, 2008, 207-223.
    • (2008) Machine Learning , vol.70 , pp. 207-223
    • Riguzzi, F.1
  • 29
    • 58149497264 scopus 로고    scopus 로고
    • Vennekens, J.: Algebraic and Logical Study of Constructive Processes in Knowledge Representation, Ph.D. Thesis, Department of Computer Science, K.U.Leuven, May 2007.
    • Vennekens, J.: Algebraic and Logical Study of Constructive Processes in Knowledge Representation, Ph.D. Thesis, Department of Computer Science, K.U.Leuven, May 2007.
  • 30
    • 33750046636 scopus 로고    scopus 로고
    • Representing causal information about a probabilistic process
    • Logics in Artificial Intelligence, 10th European Conference, Proceedings, Springer
    • Vennekens, J., Denecker, M., Bruynooghe, M.: Representing causal information about a probabilistic process, Logics in Artificial Intelligence, 10th European Conference, Proceedings, LNCS 4160, Springer, 2006.
    • (2006) LNCS , vol.4160
    • Vennekens, J.1    Denecker, M.2    Bruynooghe, M.3
  • 31
    • 22944457633 scopus 로고    scopus 로고
    • Logic Programs with Annotated Disjunctions
    • Technical report, KULeuven, 2004
    • Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic Programs with Annotated Disjunctions, Technical report, KULeuven, 2004.
    • Vennekens, J.1    Verbaeten, S.2    Bruynooghe, M.3


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