| Algorithm 1 Outliers Detection | |||
| Input:δ(p) Output:Stat(tid), true for noise point | |||
| 1: | count NZPs:nNZP ← counter(δ(p)) | 10: | if p ∈ H then |
| 2: | ifnNZP < k then | 11: | return: Stat (tid) ← true |
| 3: | return: Stat (tid) ← true | 12: | endif |
| 4: | endif | 13: | calculate SD: SD ← deviation(H) |
| 5: | ascending ordering:H ← sorter(δ(p)) | 14: | ifSD > SDmax then |
| 6: | nremain ← nNZP | 15: | return: Stat (tid) ← true |
| 7: | do | 16: | else |
| 8: | remove outliers: DixonTest(H, nremain) | 17: | return: Stat (tid) ← false |
| 9: | whilek < nremain < n | 18: | endif |