Efficient Implementation of Binary Segmentation
Binary segmentation
binseg interface
Binary segmentation, normal change in mean
Binary segmentation, normal change in mean, cross-validation for model...
case colors
case sizes
check sizes
coef binseg normal cv
coef binsegRcpp
cum median
cum median interface
depth first interface
get complexity
get complexity best heuristic equal breadth full
get complexity best heuristic equal depth full
get complexity best optimal cost
get complexity best optimal splits
get complexity best optimal tree
get complexity empirical
get complexity extreme
get complexity worst
get distribution info
get tree empirical
plot binseg normal cv
plot binsegRcpp
plot complexity
print binseg normal cv
print binsegRcpp
qp x
random set vec
size to splits
tree layout
Standard template library containers are used to implement an efficient binary segmentation algorithm, which is log-linear on average and quadratic in the worst case.