Man pages for rwoldford/treebinr
Data Reduction via Tree-based Binning

addPointAdd a Point to an Existing Configuration
clusterBoundaryTestBoundary Test for the GapBin Method
clusterMeasureCompute the Gap Measure of Rahman & Oldford
clusterPointsConvert Bins into a Reduced Point Configuration
clusterSelectSelect the Bin to be Split
clusterSplitSplit the Chosen Bin
clusterStopStopping Criteria for the Clustered Binning Algorithm
clusterUpdateCreate a Bin from a Number of Pruned Bins
doNextSplitPerform one Additional Iteration of treebin
ewBoundaryTestBoundary Test for the Equal Width Method
ewMeasureCompute the Equal Width Measure
ewPointsConvert Bins into a Reduced Point Configuration
ewSelectSelect the Bin to be Split
ewSplitSplit the Chosen Bin
ewStopStopping Criteria for the Equal Width Binning Algorithm
ewUpdateCreate a Bin from a Number of Pruned Bins
gapBoundaryTestBoundary Test for the GapBin Method
gapMeasureCompute the Gap Measure of Rahman & Oldford
gapPointsConvert Bins into a Reduced Point Configuration
gapSelectSelect the Bin to be Split
gapSplitSplit the Chosen Bin
gapStopStopping Criteria for the GapBin Algorithm
gapUpdateCreate a Bin from a Number of Pruned Bins
treebinTree-based Binning
treebinr-classThe S4 class treebinr to represent the data reduction output...
treePrunePrune a Bin
treeSplitSplit A Node
treeTrimTrim the Binning Tree to a Given Number of Bins
trimTrim the Binning Tree
undoLastSplitPrune the Last Split Performed by treebin
rwoldford/treebinr documentation built on May 12, 2019, 4:38 a.m.