Pitman–Yor process models
E1031256
Pitman–Yor process models are Bayesian nonparametric models that generalize Dirichlet process models by allowing power-law behavior and heavier-tailed distributions over clusters.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Pitman–Yor process models canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T13266993 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Pitman–Yor process models Context triple: [Dirichlet process models, relatedTo, Pitman–Yor process models]
-
A.
Dirichlet process models
Dirichlet process models are a class of Bayesian nonparametric models that allow flexible, potentially infinite mixture modeling without fixing the number of components in advance.
-
B.
Stick-breaking construction for the Indian buffet process
"Stick-breaking construction for the Indian buffet process" is a research paper by Yee-Whye Teh that introduces a stick-breaking representation for the Indian buffet process, providing a constructive and interpretable way to model infinite latent feature allocations in Bayesian nonparametrics.
-
C.
Hidden Markov Model
A Hidden Markov Model is a statistical model that represents systems with unobserved (hidden) states generating observable outputs, widely used for sequence analysis tasks such as speech recognition, bioinformatics, and natural language processing.
-
D.
Latent Dirichlet Allocation
Latent Dirichlet Allocation is a generative probabilistic model commonly used in natural language processing to discover latent topics within large collections of documents.
-
E.
Bayesian Occam factor
The Bayesian Occam factor is a term in Bayesian model comparison that automatically penalizes overly complex models by integrating over their larger parameter spaces, thereby implementing Occam’s razor in probabilistic inference.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Pitman–Yor process models Target entity description: Pitman–Yor process models are Bayesian nonparametric models that generalize Dirichlet process models by allowing power-law behavior and heavier-tailed distributions over clusters.
-
A.
Dirichlet process models
Dirichlet process models are a class of Bayesian nonparametric models that allow flexible, potentially infinite mixture modeling without fixing the number of components in advance.
-
B.
Stick-breaking construction for the Indian buffet process
"Stick-breaking construction for the Indian buffet process" is a research paper by Yee-Whye Teh that introduces a stick-breaking representation for the Indian buffet process, providing a constructive and interpretable way to model infinite latent feature allocations in Bayesian nonparametrics.
-
C.
Hidden Markov Model
A Hidden Markov Model is a statistical model that represents systems with unobserved (hidden) states generating observable outputs, widely used for sequence analysis tasks such as speech recognition, bioinformatics, and natural language processing.
-
D.
Latent Dirichlet Allocation
Latent Dirichlet Allocation is a generative probabilistic model commonly used in natural language processing to discover latent topics within large collections of documents.
-
E.
Bayesian Occam factor
The Bayesian Occam factor is a term in Bayesian model comparison that automatically penalizes overly complex models by integrating over their larger parameter spaces, thereby implementing Occam’s razor in probabilistic inference.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
Bayesian nonparametric model
ⓘ
probabilistic model ⓘ |
| allow |
heavier-tailed distributions over clusters
ⓘ
power-law behavior in cluster sizes ⓘ |
| appliedTo |
power-law phenomena in data
ⓘ
vocabulary growth modeling ⓘ word frequency modeling ⓘ |
| assume | exchangeability of observations ⓘ |
| basedOn | Pitman–Yor process NERFINISHED ⓘ |
| canBeExtendedTo | hierarchical Pitman–Yor process models ⓘ |
| characterizedBy |
exchangeable partition probability function
ⓘ
power-law distribution over number of clusters ⓘ rich-get-richer clustering behavior ⓘ |
| comparedTo | Dirichlet process models NERFINISHED ⓘ |
| enable |
flexible prior over partitions
ⓘ
modeling of heavy-tailed cluster size distributions ⓘ |
| extend | Dirichlet process mixture models NERFINISHED ⓘ |
| generalize |
Chinese restaurant process models
ⓘ
Dirichlet process models NERFINISHED ⓘ |
| hasHyperparameter |
base distribution
ⓘ
concentration parameter ⓘ discount parameter ⓘ |
| implementedIn |
Markov chain Monte Carlo inference methods
NERFINISHED
ⓘ
sequential Monte Carlo methods ⓘ variational inference methods ⓘ |
| mathematicallyBasedOn |
random partitions
ⓘ
stable subordinators ⓘ |
| originatedFrom |
work of Jim Pitman
ⓘ
work of Marc Yor ⓘ |
| provide | more flexible prior over cluster sizes than Dirichlet process models ⓘ |
| relatedTo |
Chinese restaurant process
NERFINISHED
ⓘ
Dirichlet process NERFINISHED ⓘ Poisson–Dirichlet distribution NERFINISHED ⓘ |
| specialCaseOf | two-parameter Poisson–Dirichlet process models ⓘ |
| support |
countably infinite number of clusters
ⓘ
power-law tails in predictive distributions ⓘ |
| usedFor |
clustering
ⓘ
density estimation ⓘ hierarchical Bayesian modeling ⓘ language modeling ⓘ mixture modeling ⓘ nonparametric prior over discrete distributions ⓘ topic modeling ⓘ |
| usedIn |
Bayesian statistics
NERFINISHED
ⓘ
machine learning ⓘ natural language processing ⓘ nonparametric Bayesian inference ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Pitman–Yor process models Description of subject: Pitman–Yor process models are Bayesian nonparametric models that generalize Dirichlet process models by allowing power-law behavior and heavier-tailed distributions over clusters.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.