Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
variable elimination
Description:
An inference method for probabilistic graphical models that computes marginal probabilities by successively summing out variables.
Related topics:
Bayesian Modeling and Causal Inference (17%),
Polynomial and algebraic computation (13%),
Constraint Satisfaction and Optimization (8%)
Wikidata ID:
wiki/Q5668307
OpenAlex ID:
keywords/variable-elimination
A Caution Regarding Rules of Thumb for Variance Inflation Factors
2007
·
Robert M. O’brien
·
Quality & Quantity
·
12,341
A New Method of Constrained Optimization and a Comparison With Other Methods
1965
·
M. J. Box
·
The Computer Journal
·
1,303
Modeling and Reasoning with Bayesian Networks
2009
·
Adnan Darwiche
·
Cambridge University Press eBooks
·
1,149
The Graph SLAM Algorithm with Applications to Large-Scale Mapping of Urban Structures
2006
·
Sebastian Thrun
, Michael Montemerlo
·
The International Journal of Robotics Research
·
710
A new implementation technique for applicative languages
1979
·
D. A. Turner
·
Software Practice and Experience
·
615
Effective Preprocessing in SAT Through Variable and Clause Elimination
2005
·
Niklas Eén
, Armin Biere
·
Lecture notes in computer science
·
610
A Decision Procedure for Bit-Vectors and Arrays
2007
·
Vijay Ganesh
, David L. Dill
·
Springer eBooks
·
604
Exploiting Causal Independence in Bayesian Network Inference
1996
·
N. L. Zhang
, D. Poole
·
Journal of Artificial Intelligence Research
·
440
PDF
First-order probabilistic inference
2003
·
David Poole
·
International Joint Conference on Artificial Intelligence
·
412
An algorithm for solving the direct kinematics of general Stewart-Gough platforms
1996
·
M.L. Husty
·
Mechanism and Machine Theory
·
411
Fourier-Motzkin elimination and its dual
1973
·
George B Dantzig
, B Curtis Eaves
·
Journal of Combinatorial Theory Series A
·
386
PDF
Algorithms for polynomials in Bernstein form
1988
·
R.T. Farouki
, V.T. Rajan
·
Computer Aided Geometric Design
·
348
Efficient CNF Encoding of Boolean Cardinality Constraints
2003
·
Olivier Bailleux
, Yacine Boufkhad
·
Lecture notes in computer science
·
307
On computing three-finger force-closure grasps of polygonal objects
1995
·
J. Ponce
, B. Faverjon
·
IEEE Transactions on Robotics and Automation
·
305
Some Formulae in Elimination
1902
·
F. S. MacAulay
·
Proceedings of the London Mathematical Society
·
274
Lifted First-Order Probabilistic Inference
2007
·
Rodrigo de Salvo Braz
, Eyal Amir
, et al.
·
The MIT Press eBooks
·
273
Analysis of mathematical programming problems prior to applying the simplex algorithm
1975
·
A. L. Brearley
, G. Mitra
, et al.
·
Mathematical Programming
·
272
Recursive conditioning
2001
·
Adnan Darwiche
·
Artificial Intelligence
·
269
PDF
Domain Decomposition Algorithms with Small Overlap
1994
·
Maksymilian Dryja
, Olof B. Widlund
·
SIAM Journal on Scientific Computing
·
266
A variable elimination method to improve the parsimony of MLR models using the successive projections algorithm
2008
·
Roberto Kawakami Harrop Galvão
, Mário César Ugulino Araújo
, et al.
·
Chemometrics and Intelligent Laboratory Systems
·
258
A further refinement of discretized Lyapunov functional method for the stability of time-delay systems
2001
·
Keqin Gu
·
International Journal of Control
·
254
Resolve and Expand
2005
·
Armin Biere
·
Lecture notes in computer science
·
250
pgmpy: Probabilistic Graphical Models using Python
2015
·
Ankur Ankan
, Abinash Panda
·
Proceedings of the Python in Science Conferences
·
246
PDF
Lifted first-order belief propagation
2008
·
Parag Singla
, Pedro Domingos
·
National Conference on Artificial Intelligence
·
219
FAQ: Questions Asked Frequently
2016
·
Mahmoud Abo Khamis
, Hung Q. Ngo
, et al.
·
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)
·
208
PDF
Show more works
View as search
Works count:
1,576
Citation count:
37,180
Year
Topic
Type