Perform Monothetic Clustering with Extensions to Circular Data
Coerce Similar Object to MonoClust
Find Centroid of the Cluster
First Gate Function
Add/Subtract Circular Values in Degrees/Radian
Distance Matrix of Circular Variables
Cluster Statistics Calculation
Create Labels for Split Variables
Cross-Validation Test on MonoClust
Make Error Bars
Find the Closest Cut
Find the Best Split
GGPlot the Mean Square Error with Error Bar for +/- 1 Standard Error
Parallel Coordinates Plot with Circular Variables
Cluster Inertia Calculation
Test If The Object is A MonoClust
Create Jump Table
Find Medoid of the Cluster
monoClust: Perform Monothetic Clustering with Extensions to Circular D...
Monothetic Clustering Tree Object
Monothetic Clustering
Create A New Node for Split Data Frame
Permutation Test on Monothetic Tree
Plot the Mean Square Error with Error Bar for +/- 1 Standard Error
Plot MonoClust Splitting Rule Tree
Calculate Branch Coordinates
Calculate Nodes Coordinates
Plot the monoClust Tree.
Predictions from a MonoClust Object
Print MonoClust Cross-Validation Result
Print Monothetic Clustering Results
Split Function
Hypothesis Test at Split
Implementation of Print Labels on MonoClust Tree
Transform Between Degree and Radian
Find Tree Depth Based on Node Indexes
Traverse a Tree to Find the Leaves (Terminal Nodes)
Implementation of the Monothetic Clustering algorithm (Chavent, 1998 <doi:10.1016/S0167-8655(98)00087-7>) on continuous data sets. A lot of extensions are included in the package, including applying Monothetic clustering on data sets with circular variables, visualizations with the results, and permutation and cross-validation based tests to support the decision on the number of clusters.
Useful links