An implementation of the Random Cut Forest data structure for sketching streaming data, with support for anomaly detection, density estimation, imputation, and more.
Description of changes: Adds attribution to the rust version. Further refactors the visitor classes to enable three types of visitors based on the data requirement (simple computations, needing data point at leaf, or requiring bounding boxes) which are optimized . The optimization is non-trivial because it interacts with the maintenance/non-maintenance of the bounding boxes at a node (which affects the state/memory).
Description of changes: Adds attribution to the rust version. Further refactors the visitor classes to enable three types of visitors based on the data requirement (simple computations, needing data point at leaf, or requiring bounding boxes) which are optimized . The optimization is non-trivial because it interacts with the maintenance/non-maintenance of the bounding boxes at a node (which affects the state/memory).