Bayesian Blocks: Divide and Conquer, MCMC, and Cell Coalescence Approaches

Physics – Data Analysis – Statistics and Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages, LaTeX; 19th International Workshop on Bayesian Inference and Maximum Entropy Methods (MaxEnt '99), August 2-6, 1999,

Scientific paper

Identification of local structure in intensive data -- such as time series, images, and higher dimensional processes -- is an important problem in astronomy. Since the data are typically generated by an inhomogeneous Poisson process, an appropriate model is one that partitions the data space into cells, each of which is described by a homogeneous (constant event rate) Poisson process. It is key that the sizes and locations of the cells are determined by the data, and are not predefined or even constrained to be evenly spaced. For one-dimensional time series, the method amounts to Bayesian changepoint detection. Three approaches to solving the multiple changepoint problem are sketched, based on: (1) divide and conquer with single changepoints, (2) maximum posterior for the number of changepoints, and (3) cell coalescence. The last method starts from the Voronoi tessellation of the data, and thus should easily generalize to spaces of higher dimension.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Bayesian Blocks: Divide and Conquer, MCMC, and Cell Coalescence Approaches does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bayesian Blocks: Divide and Conquer, MCMC, and Cell Coalescence Approaches, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bayesian Blocks: Divide and Conquer, MCMC, and Cell Coalescence Approaches will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-25056

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.