Skip to main content
. 2024 Mar 25;24(7):2088. doi: 10.3390/s24072088
Algorithm 3 Determine the Nearest Neighbor
  •   1:

    procedure NearestNeighbor(profile, fp)

  •   2:

          Group profile by region_id

  •   3:

          for each region_id group i do

  •   4:

                w = 0, t = 0

  •   5:

                for j in (length(group[i]) do

  •   6:

                      t = pow((fp[j][‘mean’] − group[i][j][‘mean’]), 2)

  •   7:

                      t = t × group[i][j][‘weight’]

  •   8:

                      w += t

  •   9:

                wts[i] = [region, group[i][j][‘timestamp’].mean(), w]

  • 10:

          return wts.minimum()                                    ▹ Return region with lowest weight