Abstract
Effective pattern recognition requires understanding both statistical and structural aspects of the input, but in the past these have mostly been handled separately. Markov logic is a powerful new language that seamlessy combines the two. Models in Markov logic are sets of weighted formulas in first-order logic, interpreted as templates for features of Markov random fields. Most statistical and structural models in wide use are simple special cases of Markov logic. Learning algorithms for Markov logic make use of conditional likelihood, convex optimization, and inductive logic programming. Inference algorithms combine ideas from Markov chain Monte Carlo and satisfiability testing. Markov logic has been successfully applied to problems in information extraction, robot mapping, social network modeling, and others, and is the basis of the open-source Alchemy system.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.