Implementation of a Classification Arithmetic Based on SLIQ
Rong Qiu-sheng · Jisuanji gongcheng · 2003
This article introduces the conception of classification arithmetic, describes a kind of implementation of it based on SLIQ. Queue is used in the algorithm control structure to control the breadth-first search. And then, ordered attribute table sequence is formed through the internal sorting of the attribute table. Following, the best split project of the leaf node is found through the traversal of the entire attribute table, and the table, which ought to be splited, is changed. At last, decision-making tree is stored in output table by preorder traversal.