Table 5 Reducer task flow of FindBestSplit
From: Data classification algorithm for data-intensive computing environments
Require: Key k, Value Set V, Attribute set Att, Class set Y | |
1. For All k do 2. If Att[k] is continuous then 3. For all distinct values ∈V do 4. If sameBlock(value [i]) then 5. Output((k),(value [i], sumCount(value [i]))) |