Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 3316726
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 17, 20262026-05-17T22:30:12+00:00 2026-05-17T22:30:12+00:00

When dealing with Dirichlet Processes, according to [Teh, 2007], a DP is defined as

  • 0

When dealing with Dirichlet Processes, according to [Teh, 2007], a DP is defined as by a base Probability H and a scale factor “alpha”

According to the Stick Breaking Construction, the random draws G from a DP:

G~DP(alpha,H)

are given by:

G=sum(pi_k*delta_theta_k) over k from 1 to infinity

pi_k are ordered draws from a Beta Distribution given the length of an unitary stick

delta_theta_k is a point mass centered in “theta_k” (theta_k are random draws from the base distribution)

I have pretty much a clear understanding of all the variables, but I do not know what do they mean by “mass point” is it the probability density of that draw, or is it something else.

It would be great if you could point me in any direction, only a reference would be amazing.

Thanks

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-17T22:30:13+00:00Added an answer on May 17, 2026 at 10:30 pm

    G is a probability distribution over probability distributions. These (sub) probability distributions are over some domain, let’s call it BigTheta.

    Each theta_k is a draw from a distribution over BigTheta, so it is some element of BigTheta.

    Each delta_theta_k is a probability distribution over BigTheta, defined to be delta_theta_k(theta_k) = 1 and delta_theta_k(anything else) = 0. This is what they call the ‘point mass’ distribution, because all the mass of the distribution is over a single point of the domain.

    G is a probability distribution over probability distributions over BigTheta, defined as: for some distribution over BigTheta called f (which is parameterised by theta), G(f(theta)) = sum (pi_k * delta_theta_k(theta)).

    I hope that helps, I think you generally have the right idea it’s just the notation can get a little complicated (and SO isn’t the best for this kind of notation). It’s generally helpful whenever you encounter a symbol to think about what type of function it is, i.e. what is it defined over.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I am dealing with very primitive HTML construction that goes like this: <a NAME=header1></a><b><font
When dealing with pointers, pointers to one past the end have (mostly) defined behavior:
Dealing with some legacy code and in trying to get a poorly designed database
Dealing with Java - which the option you prefer in the most cases -
When dealing with a series of numbers, and wanting to use hash results for
When dealing with a single file, I'm used to: /blah do some work n
When dealing with a collection of key/value pairs is there any difference between using
When dealing with events, people are usually taking examples of very simple values object
I'm dealing with a problem the whole week already and can't find the answer
Other questions dealing with use of match_parent pre 2.2 have answers stating one should

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.