Skip to main content

Table 4 Mapper task flow of FindBestSplit

From: Data classification algorithm for data-intensive computing environments

Require: Current node Tcurr, Attribute set Att, Class set Y

1. For each A Att do

2. Class Count array countY for Y

3. Index=firstreCord(Tcurr→D)

4. For all (x,y)(Tcurr→D,Attribute list of A) do

5. county[findY(Y,y)]++

6. Output((findA(A)),(Index, countY))