• Reference Citation Analysis
  • v
  • v
  • Find an Article
Find an Article PDF (4594882)   Today's Articles (4739)   Subscriber (49329)
For: De Raedt L, Kersting K, Kimmig A, Revoredo K, Toivonen H. Compressing probabilistic Prolog programs. Mach Learn 2007. [DOI: 10.1007/s10994-007-5030-x] [Citation(s) in RCA: 7] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [What about the content of this article? (0)] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/22/2022]
Number Cited by Other Article(s)
1
Latour AL, Babaki B, Fokkinga D, Anastacio M, Hoos HH, Nijssen S. Exact Stochastic Constraint Optimisation with Applications in Network Analysis. ARTIF INTELL 2021. [DOI: 10.1016/j.artint.2021.103650] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/26/2022]
2
Bandit-based Monte-Carlo structure learning of probabilistic logic programs. Mach Learn 2015. [DOI: 10.1007/s10994-015-5510-3] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/23/2022]
3
Riguzzi F, Bellodi E, Zese R. A History of Probabilistic Inductive Logic Programming. Front Robot AI 2014. [DOI: 10.3389/frobt.2014.00006] [Citation(s) in RCA: 9] [Impact Index Per Article: 0.9] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/13/2022]  Open
4
Finding reliable subgraphs from large probabilistic graphs. Data Min Knowl Discov 2008. [DOI: 10.1007/s10618-008-0106-1] [Citation(s) in RCA: 23] [Impact Index Per Article: 1.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/21/2022]
PrevPage 1 of 1 1Next
© 2004-2024 Baishideng Publishing Group Inc. All rights reserved. 7041 Koll Center Parkway, Suite 160, Pleasanton, CA 94566, USA