Multistage System-Based Machine Learning Techniques for Intrusion Detection in WiFi Network
Algorithm 2
IncrementalSSGC: insertion process.
Input: a new data object ; a set of current clusters C, list containing edges for each point of current clusters L, θ (threshold), and number of nearest neighbors (NN) k.
Output: label for
Process:
(1)
Create the k-nearest neighbors list of edges between and all current clusters
(2)
Delete all :
(3)
if then
(4)
is added in a temporary list
(5)
else
(6)
If related to two or more components with different label then
(7)
Delete edges in with ascending order of weight until connecting with components with at most one kind of label
(8)
end if
(9)
Get label for and its connected points (if any) by propagating
(10)
Update list L: adding edges relating to to L; some edges between and will also be recalculated if appears in the nearest neighbors list of or .
