Research Article
A Deep Random Forest Model on Spark for Network Intrusion Detection
Algorithm 3.
Hierarchical replacement.
| | Input: : cache collection of RDD, : cluster cache size, : cached RDD size, : cache candidate, : size of candidate. | | | Output: | | (1) | calc ; | | (2) | IntegrityCheck (rdds); | | (3) | ; | | (4) | if () | | (5) | for ((k,)⟵) | | (6) | if ( = = FALSE) | | (7) | Replace (k = , = TRUE) | | (8) | end if | | (9) | end for | | (10) | if () | | (11) | | | (12) | else | | (13) | for ((k,)←) | | (14) | v.QuickSort ();//Sort by execution efficiency | | (15) | if (<) | | (16) | Replace (k = , = ) | | (17) | end if | | (18) | end for | | (19) | | | (20) | end if | | (21) | end if |
|
