scientific article; zbMATH DE number 6860814
From MaRDI portal
Publication:4637032
zbMath1435.68252arXiv1505.04406MaRDI QIDQ4637032
Matthias Broecheler, Lise Getoor, Stephen H. Bach, Bert Huang
Publication date: 17 April 2018
Full work available at URL: https://arxiv.org/abs/1505.04406
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Random fields; image analysis (62M40) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Logic in artificial intelligence (68T27) Probabilistic graphical models (62H22)
Related Items (10)
MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations ⋮ On the Relation Between Loss Functions and T-Norms ⋮ A probabilistic approximate logic for neuro-symbolic learning and reasoning ⋮ Soft quantification in statistical relational learning ⋮ Expressive power of entity-linking frameworks ⋮ From statistical relational to neurosymbolic artificial intelligence: a survey ⋮ Statistical Relational Learning with Soft Quantifiers ⋮ A comparison of statistical relational learning and graph neural networks for aggregate graph queries ⋮ Unnamed Item ⋮ A taxonomy of weight learning methods for statistical relational learning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Clausal discovery
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- Some simplified NP-complete graph problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Approximating MAPs for belief networks is NP-hard and other theorems
- Finding MAPs for belief networks is NP-hard
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Search-based structured prediction
- Cutting-plane training of structural SVMs
- Fast learning of relational kernels
- Guided local search for solving SAT and weighted MAX-SAT problems
- Lifted graphical models: a survey
- A logical approach to efficient Max-SAT solving
- Algebraic model counting
- Markov logic networks
- Improved Approximation Algorithms for MAX SAT
- An Efficient Learning Procedure for Deep Boltzmann Machines
- The PITA system: Tabling and answer subsumption for reasoning under uncertainty
- Reducing the Dimensionality of Data with Neural Networks
- Approximation algorithms for classification problems with pairwise relationships
- Using Linear Programming to Decode Binary Linear Codes
- Markov Logic: An Interface Layer for Artificial Intelligence
- Graphical Models, Exponential Families, and Variational Inference
- Inductive Logic Programming: Theory and methods
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- 10.1162/jmlr.2003.3.4-5.679
- 10.1162/153244303322753698
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem
- Exploiting the Power of mip Solvers in maxsat
This page was built for publication:
