Non-parametric change-point detection using string matching algorithms

Details Non-parametric change-point detection using string matching algorithms Non-parametric change-point detection using string matching algorithms

2011-06-28

arxiv.org/abs/1106.5714v2

Mathematics

Probability

Scientific paper

Given the output of a data source taking values in a finite alphabet, we wish to detect change-points, that is times when the statistical properties of the source change. Motivated by ideas of match lengths in information theory, we introduce a novel non-parametric estimator which we call CRECHE (CRossings Enumeration CHange Estimator). We present simulation evidence that this estimator performs well, both for simulated sources and for real data formed by concatenating text sources. For example, we show that we can accurately detect the point at which a source changes from a Markov chain to an IID source with the same stationary distribution. Our estimator requires no assumptions about the form of the source distribution, and avoids the need to estimate its probabilities. Further, we establish consistency of the CRECHE estimator under a related toy model, by establishing a fluid limit and using martingale arguments.

Affiliated with

Also associated with

No associations

Rating

Non-parametric change-point detection using string matching algorithms 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 Non-parametric change-point detection using string matching algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-parametric change-point detection using string matching algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-41790