A Real-Valued Negative Selection Algorithm Based on Grid for Anomaly Detection

Algorithm 5

The filling process of neighbor grids.

𝐹𝑖𝑙𝑙𝑁𝑒𝑖𝑔ℎ𝑏𝑜𝑢𝑟𝑠(𝐿𝑖𝑛𝑒𝐺𝑟𝑖𝑑𝑠)

Input: 𝐿𝑖𝑛𝑒𝐺𝑟𝑖𝑑𝑠 the line storage of grids

Step 1. Obtain the basic neighbor grids for each grid in the structure 𝐿𝑖𝑛𝑒𝐺𝑟𝑖𝑑𝑠;

Step 2. For each basic neighbor of every grid, if selves of this neighbor are empty, complement the neighbor of this

   neighbor in the same direction as an attached neighbor for the grid;

Step 3. For each attached neighbor of every grid, if selves of this neighbor are empty, complement the neighbor of this

    neighbor in the same direction as an attached neighbor for the grid.