Research Article
Self-Trained LMT for Semisupervised Learning
Definitions: | – root of decision tree | minNumInst – minimum number of instances at which a node is considered for splitting | numBoostIter – fixed number of iterations of LogitBoost [32] | CART – pruning algorithm [33] | Steps: | (1) Build logistic model at | (2) Split data at according to the splitting criterion | (3) Terminate the splitting phase when any of the stopping criterion (minNumInst or numBoostIter) is met | (4) Prune the tree using CART-based algorithm |
|