1. HLC(Training Set D)
2. Initialize tree Tand put all records of Din the root;
3. while (some leaf vbin Tis a non-STOP node)
4. test if node vb can be stopped
5. if it can, mark vb as a STOP node, determine its concept label,and exit
6. else for each attributearofvbdo
evaluate the appropriateness of splitting node vb with attributear
7. get the best split for it;
8. partition the node according to the best split;
9. end while;
10. returnT