|
Authors:
Azadeh Khaleghi and
Daniil Ryabko
Source: Algorithmic Learning Theory, 24th International Conference, ALT 2013,
Singapore, October 6 - 9, 2013, Proccedings,
Lecture Notes in Artificial Intelligence 8139, pp. 382–396, Springer, 2013.
Abstract.
Given a heterogeneous time-series sample,
it is required to find the points in time (called change points)
where the probability distribution generating the data has changed.
The data is assumed to have been generated by arbitrary, unknown, stationary ergodic distributions.
No modelling, independence or mixing assumptions are made.
A novel, computationally efficient, nonparametric method is proposed, and
is shown to be asymptotically
consistent in this general framework;
the theoretical results are complemented with experimental evaluations.
©Copyright Springer 2013
|