Weight balanced tree for detecting anomaly
Go to file
Ryan Febriansyah 222f176a95 initial commit
2023-06-08 08:00:26 +07:00
__init__.py initial commit 2023-06-08 08:00:26 +07:00
.gitignore initial commit 2023-06-08 08:00:26 +07:00
anomaly_http_example.py initial commit 2023-06-08 08:00:26 +07:00
anomaly_node_example.py initial commit 2023-06-08 08:00:26 +07:00
README.md initial commit 2023-06-08 08:00:26 +07:00
tests_weight_balanced_tree.py initial commit 2023-06-08 08:00:26 +07:00
weight_balanced_tree.py initial commit 2023-06-08 08:00:26 +07:00

Weighted Balanced Tree for Anomaly Detection

Exploring weighted-balanced tree as the alternative solution for detecting anomaly. It's worth to notice, the anomaly detection will employ the isolation forest algorithm as its core, with a binary search tree utilized for the anomaly classification process. Currently, im suspecting and have an assumption that the binary search tree may encounter unsuccessful operations when the tree nodes become unbalanced / skeewed tree operation (let's say we assume there are 5 tree nodes which of them weren't sorted by default), making it challenging to maintain balance between the two nodes.

This is just proof-of-concept for my research for a master's degree, it may have biased and unxepected results since it wasn't properly tested and evaluated