Skip to main content
. 2021 Jan 21;21(3):709. doi: 10.3390/s21030709
Algorithm 1 IR influential users and locations selection.

     Input: LBSN: G,L; Query: (R,k,m)

     Output: S-seeds, V-locations 1

  • 1:

    S,V

  • 2:

    θ 150 miles                    ▹The boundary area for target region R

  • 3:

    L                               ▹Location set

  • 4:

    I 10,000                        ▹Number of Simulations

  • 5:

    for all locations lL do

  • 6:

        if distance(l, R) θ then

  • 7:

            L=L{l}

  • 8:

    Extract Users checked in at L

  • 9:

    G=(U,E){UUUL}  ▹Subgraph of users who checked in at locations lying under target region

  • 10:

    SDegreeDiscount(G,k,I)

  • 11:

    LL{SL}               ▹extract locations visited by top S seed users

  • 12:

    fori1:mdo

  • 13:

        for all locations l L do

  • 14:

            LUF=ComputeLocationUserFreq(l)

  • 15:

        V=V{arg maxlLUFV{LUF}}

  • 16:

        L=LV

  • 17:

    Return S,V