14 lines
371 B
Plaintext
14 lines
371 B
Plaintext
|
<frame title="kNN">
|
||
|
|
<split>
|
||
|
|
<que>
|
||
|
|
<list>
|
||
|
|
<e>How to do this? Here one algorithm: kNN</e>
|
||
|
|
<e>Goal: Generate an anomaly score (high value->highly anomalous)</e>
|
||
|
|
<e>Here: The anomaly score is the distance to the kth closest samples</e>
|
||
|
|
</list>
|
||
|
|
</que>
|
||
|
|
<que>
|
||
|
|
<i f="..//prep/04kNN/dist0.pdf" wmode="True"></i>
|
||
|
|
</que>
|
||
|
|
</split>
|
||
|
|
</frame>
|