Anomaly Prediction over Human Crowded Scenes via Associate-Based Data Mining and K-Ary Tree Hashing

Algorithm 2

Naïve approach for K-ary tree hashing.

	Require: L, K i
	Ensure: T( )
	% N is neighbor, L is Data, and T is size fixing approach%
(1)	Temp ← sort (L(Ki))
(2)	j ← min (j, |Ki|)
(3)	t(i) ← [i, index (temp (1: j))]