From: Data classification algorithm for data-intensive computing environments
Require: NodeQueue NQ, TreeModel TM, Training record | |
(x,y) ∈D, Attribute set Att 1. Troot = new Node 2. Initiate(Troot, D,Att) 3. TM = Troot 4. NQ.push_back(Troot) 5. BuildTree(NQ) |