Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Markov random field theory | Statement: [Modeling image patches with a directed hierarchy of Markov random fields, buildsOn, Markov random field theory]

Target entity: Markov random field theory
Context triple: [Modeling image patches with a directed hierarchy of Markov random fields, buildsOn, Markov random field theory]

• A. Markov random fields chosen
  Markov random fields are probabilistic graphical models that represent the joint distribution of a set of random variables with local dependencies encoded by an undirected graph, widely used in areas like statistical physics, computer vision, and spatial statistics.
• B. Modeling image patches with a directed hierarchy of Markov random fields
  "Modeling image patches with a directed hierarchy of Markov random fields" is a research paper that introduces a probabilistic hierarchical model for capturing complex statistical structure in image patches using directed Markov random fields.
• C. probabilistic graphical models
  Probabilistic graphical models are a framework in machine learning and statistics that represent complex joint probability distributions using graphs to capture conditional dependencies among random variables.
• D. Probabilistic Graphical Models: Principles and Techniques
  Probabilistic Graphical Models: Principles and Techniques is a foundational textbook that systematically presents the theory, algorithms, and applications of probabilistic graphical models in machine learning and artificial intelligence.
• E. Hammersley–Clifford theorem
  The Hammersley–Clifford theorem is a fundamental result in probability theory and statistics that links Markov random fields with Gibbs distributions by showing that, under positivity conditions, the Markov property is equivalent to factorization over cliques of an underlying graph.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.