Sabrish Gopalakrishnan
Angle Based Outlier Factor algorithm
O(n^3) implementation as per the KDD 2008 paper by Hans-Peter Kriegel, Matthias Schubert , Arthur Zimek. Fast ABOD is implementable with a prestep of Knn to reduce to O(n^2k)
Discover companies you will love
Available to logged-in users only
O(n^3) implementation as per the KDD 2008 paper by Hans-Peter Kriegel, Matthias Schubert , Arthur Zimek. Fast ABOD is implementable with a prestep of Knn to reduce to O(n^2k)