Generalized ordering-search for learning directed probabilistic logical models
DOI10.1007/S10994-007-5033-7zbMATH Open1470.68161OpenAlexW4252698353WikidataQ58012277 ScholiaQ58012277MaRDI QIDQ1009243FDOQ1009243
Authors: Jan Ramon, Tom Croonenborghs, Daan Fierens, Hendrik Blockeel, Maurice Bruynooghe
Publication date: 31 March 2009
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-007-5033-7
Recommendations
- Learning Directed Probabilistic Logical Models Using Ordering-Search
- Learning directed probabilistic logical models: Ordering-search versus structure-search
- scientific article; zbMATH DE number 1849167
- Closed-form solutions in learning probabilistic logic programs by exact score maximization
- Structure learning of probabilistic logic programs by searching the clause space
Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Genetics and epigenetics (92D10) Logic in artificial intelligence (68T27)
Cites Work
Cited In (6)
- Learning Directed Probabilistic Logical Models Using Ordering-Search
- Learning directed probabilistic logical models: Ordering-search versus structure-search
- Ordered hypothesis machines
- Learning ground GP-logic theories by leveraging Bayesian network learnng techniques
- Learning directed relational models with recursive dependencies
- A dichotomic search algorithm for mining and learning in domain-specific logics
This page was built for publication: Generalized ordering-search for learning directed probabilistic logical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009243)