Description Usage Arguments Details Value References Examples
View source: R/min_within_segment_loss.R
Detect the location of change points based on minimizing within segment quadratic loss with fixed number of change points.
1 | OrderKmeans(x, K = 4, num_init = 10)
|
x |
The data to find change points with dimension N x D, must be matrix |
K |
The number of change points. |
num_init |
The number of repetition times, in order to avoid local minimum. Default is 10. Must be integer. |
The K change points form K+1 segments (1 2 ... change_point(1)) ... (change_point(K) ... N).
wgss_sum |
total within segment sum of squared distances to the segment mean (wgss) of all segments. |
num_each |
number of observations of each segment |
wgss |
total wgss of each segment. |
change_point |
location of optimal change points. |
J. Ding, Y. Xiang, L. Shen, and V. Tarokh, Multiple Change Point Analysis: Fast Implementation and Strong Consistency. IEEE Transactions on Signal Processing, vol. 65, no. 17, pp. 4495-4510, 2017.
1 2 3 4 5 6 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.