Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

James D. Park

dblp:68/3277 · DBLP profile ↗
← Back
8ranked-venue papers
8as first author
0since 2021 · last 2004
0009-0008-0443-1250ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 8 · 8 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Probabilistic and Bayesian machine learning · 84% Knowledge representation and reasoning · 16%
Theoretical computer science
2 papers
Logic in computer science · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
bayesian network
0.122004
A differential semantics for jointree algorithms · Artif. Intell. 2004
A Differential Semantics for Jointree Algorithms · NIPS 2002
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › bayesian network
jointree algorithms
0.122004
A differential semantics for jointree algorithms · Artif. Intell. 2004
A Differential Semantics for Jointree Algorithms · NIPS 2002
Logic in computer science
semantics
0.012004
A differential semantics for jointree algorithms · Artif. Intell. 2004
Knowledge, reasoning and agents › Knowledge representation and reasoning
causal reasoning
0.012003
Causes and Explanations Revisited · IJCAI 2003
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.012002
A Differential Semantics for Jointree Algorithms · NIPS 2002
Logic in computer science › algebraic logic
algebraic semantics
0.012002
A Differential Semantics for Jointree Algorithms · NIPS 2002
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
bayesian network inference
0.012002
A Differential Semantics for Jointree Algorithms · NIPS 2002

Methods — techniques the papers use, named apart from their topics

multilinear functions · 0.1differential semantics · 0.1
YearPublicationVenuePosition
2004 A differential semantics for jointree algorithms
James D. Park, Adnan Darwiche
Artif. Intell.1
2004 Complexity Results and Approximation Strategies for MAP Explanations
abstract
MAP is the problem of finding a most probable instantiation of a set of variables given evidence. MAP has always been perceived to be significantly harder than the related problems of computing the probability of a variable instantiation Pr, or the problem of computing the most probable explanation (MPE). This paper investigates the complexity of MAP in Bayesian networks. Specifically, we show that MAP is complete for NP^PP and provide further negative complexity results for algorithms based on variable elimination. We also show that MAP remains hard even when MPE and Pr become easy. For example, we show that MAP is NP-complete when the networks are restricted to polytrees, and even then can not be effectively approximated. Given the difficulty of computing MAP exactly, and the difficulty of approximating MAP while providing useful guarantees on the resulting approximation, we investigate best effort approximations. We introduce a generic MAP approximation framework. We provide two instantiations of the framework; one for networks which are amenable to exact inference Pr, and one for networks for which even exact inference is too hard. This allows MAP approximation on networks that are too complex to even exactly solve the easier problems, Pr and MPE. Experimental results indicate that using these approximation algorithms provides much better solutions than standard techniques, and provide accurate MAP estimates in many cases.
James D. Park, Adnan Darwiche
J. Artif. Intell. Res.1
2003 Morphing the Hugin and Shenoy-Shafer Architectures
James D. Park, Adnan Darwiche
ECSQARU1
2003 Causes and Explanations Revisited
James D. Park
IJCAI1
2003 Solving MAP Exactly using Systematic Search
James D. Park, Adnan Darwiche
UAI1
2002 A Differential Semantics for Jointree Algorithms
abstract
A new approach to inference in belief networks has been recently proposed, which is based on an algebraic representation of belief networks using multi{linear functions. According to this approach, the key computational question is that of representing multi{linear functions compactly, since inference reduces to a simple process of ev aluating and difierentiating such functions. W e show here that mainstream inference algorithms based on jointrees are a special case of this approach in a v ery precise sense. W e use this result to prov e new properties of jointree algorithms, and then discuss some of its practical and theoretical implications.
James D. Park, Adnan Darwiche
NIPS1
2002 MAP Complexity Results and Approximation Methods
James D. Park
UAI1
2001 Approximating MAP using Local Search
James D. Park, Adnan Darwiche
UAI1