Clique Potential
Jump to navigation
Jump to search
See: Markov Random Field, Graphical Model, Factor Potential, Clique, Clique Identification Task.
References
2009
- http://en.wikipedia.org/wiki/Markov_random_field#Clique_factorization
- … The functions φC are often referred to as factor potentials or clique potentials. ...
- (Kulkarni et al., 2009) ⇒ Sayali Kulkarni, Amit Singh, Ganesh Ramakrishnan, and Soumen Chakrabarti. (2009). “Collective Annotation of Wikipedia Entities in Web Text.” In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2009). doi:10.1145/1557019.1557073
- We propose a collective optimization problem that precisely models the combination of evidence from local spot-to-entity compatibility (“node potential”) and global page-level topical coherence (“clique potential”) of the entities chosen to disambiguate all spots. Our optimization is equivalent to searching for the maximum probability annotation configuration (inference) in a probabilistic graphical model where each page is a clique. Inference is NP-hard.