Package: binsegRcpp 2025.5.13

binsegRcpp: Efficient Implementation of Binary Segmentation

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.

Authors:Toby Dylan Hocking [aut, cre]

binsegRcpp_2025.5.13.tar.gz
binsegRcpp_2025.5.13.zip(r-4.7-x86_64)binsegRcpp_2025.5.13.zip(r-4.6-x86_64)binsegRcpp_2025.5.13.zip(r-4.5-x86_64)
binsegRcpp_2025.5.13.tgz(r-4.6-x86_64)binsegRcpp_2025.5.13.tgz(r-4.6-arm64)binsegRcpp_2025.5.13.tgz(r-4.5-x86_64)binsegRcpp_2025.5.13.tgz(r-4.5-arm64)
binsegRcpp_2025.5.13.tar.gz(r-4.7-arm64)binsegRcpp_2025.5.13.tar.gz(r-4.7-x86_64)binsegRcpp_2025.5.13.tar.gz(r-4.6-arm64)binsegRcpp_2025.5.13.tar.gz(r-4.6-x86_64)
binsegRcpp_2025.5.13.tgz(r-4.6-emscripten)
manual.pdf |manual.html✨
DESCRIPTION |NEWS
card.svg |card.png
binsegRcpp/json (API)

# Install 'binsegRcpp' in R:
install.packages('binsegRcpp', repos = c('https://tdhock.r-universe.dev', 'https://cloud.r-project.org'))

Bug tracker:https://github.com/tdhock/binsegrcpp/issues

Uses libs:
  • c++– GNU Standard C++ Library v3

On CRAN:

Conda:

cpp

4.29 score 7 stars 14 scripts 501 downloads 20 exports 2 dependencies

Last updated from:9b00471974. Checks:13 OK. Indexed: yes.

TargetResultTimeFilesSyslog
linux-devel-arm64OK122
linux-devel-x86_64OK168
source / vignettesOK175
linux-release-arm64OK121
linux-release-x86_64OK142
macos-release-arm64OK94
macos-release-x86_64OK159
macos-oldrel-arm64OK113
macos-oldrel-x86_64OK163
windows-devel-x86_64OK117
windows-release-x86_64OK116
windows-oldrel-x86_64OK117
wasm-releaseOK120

Exports:binsegbinseg_normalbinseg_normal_cvcase.colorscase.sizescum_mediandepth_first_interfaceget_complexityget_complexity_best_heuristic_equal_breadth_fullget_complexity_best_heuristic_equal_depth_fullget_complexity_best_optimal_costget_complexity_best_optimal_treeget_complexity_empiricalget_complexity_extremeget_complexity_worstget_distribution_infoget_tree_empiricalrandom_set_vecsize_to_splitstree_layout

Dependencies:data.tableRcpp

Cross-validation
Comparing cross-validation methods | How many times is sufficient?
Rendered fromcross-validation.Rmdusingknitr::knitr

Last update: 2022-05-12
Started: 2022-01-21

Comparisons with other packages
Comparisons | Comparing loss/parameters to changepoint | Penalized model selection with binsegRcpp and changepoint
Rendered fromcomparisons.Rmdusingknitr::knitr

Last update: 2022-03-31
Started: 2022-03-31

Readme and manuals

Help Manual

Help pageTopics
Binary segmentationbinseg binsegRcpp
binseg interfacebinseg_interface
Binary segmentation, normal change in meanbinseg_normal
Binary segmentation, normal change in mean, cross-validation for model selectionbinseg_normal_cv
case colorscase.colors
case sizescase.sizes
check sizescheck_sizes
coef binseg normal cvcoef.binseg_normal_cv
coef binsegRcppcoef.binsegRcpp
cum mediancum_median
cum median interfacecum_median_interface
depth first interfacedepth_first_interface
get complexityget_complexity
get complexity best heuristic equal breadth fullget_complexity_best_heuristic_equal_breadth_full
get complexity best heuristic equal depth fullget_complexity_best_heuristic_equal_depth_full
get complexity best optimal costget_complexity_best_optimal_cost
get complexity best optimal splitsget_complexity_best_optimal_splits
get complexity best optimal treeget_complexity_best_optimal_tree
get complexity empiricalget_complexity_empirical
get complexity extremeget_complexity_extreme
get complexity worstget_complexity_worst
get distribution infoget_distribution_info
get tree empiricalget_tree_empirical
plot binseg normal cvplot.binseg_normal_cv
plot binsegRcppplot.binsegRcpp
plot complexityplot.complexity
print binseg normal cvprint.binseg_normal_cv
print binsegRcppprint.binsegRcpp
qp xqp.x
random set vecrandom_set_vec
size to splitssize_to_splits
tree layouttree_layout