Research Article
MA-STS-Based Social Intimacy Analysis Algorithm Using Real Campus Network Data
Algorithm 3
Training decision tree model algorithm.
| Enter Training Set D, Eigenvalue A, Threshold | | Process: | (1) | while (The decision tree does not classify all the examples correctly) | (2) | According to equations (3)-(4), we get the attribute of the instance contained in D that best distinguishes from A | (3) | is the dataset that reaches node t | (4) | if | (5) | is marked as leaf nodes for most of class C | (6) | else | (7) | Splitting into smaller subsets, is not a leaf node | (8) | end if | (9) | end while | (10) | return: decision tree |
|