DMM: Leveraging Power-Law Mobility for Strategic Location Promotion in LBSNs

Exploiting mobility for location promotion in location-based social networks

2014-10-01
Wen-Yuan Zhu, Wen-Chih Peng, Ling-Jyh Chen
Summary
Problem
Method
Results
Takeaways
Abstract

The paper introduces the Location Promotion Problem in Location-Based Social Networks (LBSNs) and proposes a Distance-based Mobility Model (DMM). By framing location promotion as an Influence Maximization problem using the Independent Cascading Model (ICM), the authors identify optimal seed users to maximize the expected number of visitors to a specific location.

TL;DR

Promoting a physical venue (like a new cafe or hotel) in a social network isn't just about finding "influencers"—it's about finding influencers whose friends are physically capable of showing up. This paper introduces a Distance-based Mobility Model (DMM) that bridges the gap between social influence and geographical feasibility, solving the sparsity problem of LBSN data using power-law movement distributions.

Background: Why Social Influence is Not Enough

In traditional social networks, influence is often treated as a pure information flow. However, in Location-Based Social Networks (LBSNs) like Foursquare or Gowalla, the end goal is a physical action: a visit.

Previous Influence Maximization (IM) techniques fail here because:

  1. Spatial Constraint: A user with 10,000 followers in New York is useless for promoting a shop in Tokyo.
  2. Data Sparsity: Most users only check in 10-50 times, making it impossible to build dense Markov chains or complex trajectory patterns.
  3. Inductive Bias: Existing models often use Normal distributions, which fail to capture the "long-tail" nature of human travel (we mostly move locally, but occasionally travel far).

Methodology: The Hybrid DMM Architecture

The core innovation is the Distance-based Mobility Model (DMM). To determine the "propagation probability" (the chance a user visits a location after being influenced by a friend), the authors decompose the problem into two parts:

1. Estimating "Home" Areas via Random Walk with Restart (RWR)

Since check-ins are sparse, the authors use RWR on a user's historical check-in graph to determine a stationary distribution. This identifies the probability that a user is "staying" at a certain hub location .

2. The Power-Law Jump (Pareto Distribution)

Instead of assuming a bell curve for movement, the authors observed that movement distance follows a power-law property. They confirmed this using the Hurst exponent, showing that human mobility is self-similar. They utilize a Pareto distribution with a shape parameter estimated via Maximum Likelihood Estimation (MLE).

Overall Strategy Fig 1. The Location Promotion Problem: Selecting seeds to maximize reach to a specific target.

The final propagation probability is calculated as: This formula essentially asks: "What is the probability that a user, starting from their usual hubs , will make a jump long enough to reach target location ?"

Experiments: Superiority in Sparse Scenarios

The authors compared DMM against a general Normal distribution model. As shown in the log-likelihood figures, the Normal model's accuracy collapses when training data is sparse (e.g., only 10 records). DMM remains stable because its power-law prior is a much stronger fit for human behavior.

Mobility Comparison Fig 2. DMM (Red/Pink) significantly outperforms Normal distributions (Blue) in sparse data settings across Gowalla and Brightkite datasets.

Seed Selection Performance

Using the CELF (Cost-Effective Lazy Forward) algorithm—an optimized greedy approach for submodular functions—the authors demonstrated that their model produces a much larger "influence spread" than naive heuristics like selecting the most active check-in users (Active First) or those who visit the target location most frequently (Expert First).

Influence Spread Results Fig 3. Comparison of Influence Spread: CELF (incorporating DMM) consistently finds more effective seeds than Active First (AF) or Expert First (EF) heuristics.

Critical Insight: The "Tourist" Trap

An interesting finding in the results (Fig 9b) shows a gap where AF/EF heuristics fail significantly. This happens at scenic spots like Central Park. The "experts" recorded there are often tourists who check in frequently but stay only briefly. Their social circle doesn't live in the area, so influencing them has zero geographic viral potential. The DMM avoids this by correctly identifying that their "hubs" are far away, lowering their propagation probability for local promotion.

Conclusion

This paper provides a robust framework for physical-world marketing. By acknowledging that spatial distance is as important as social distance, and by leveraging the fixed mathematical properties of human movement (Power Law), DMM provides a scalable solution for LBSNs where user data is notoriously "thin."

Future Work could involve integrating real-time temporal windows—promoting a "Happy Hour" might require a different mobility model than promoting a "Museum Exhibition."

Find Similar Papers

Try Our Examples

  • What are the most recent SOTA algorithms for influence maximization in LBSNs that incorporate both temporal dynamics and spatial distance?
  • Which paper first established the power-law property (Pareto distribution) of human mobility, and how does the DMM model specifically adapt this for cold-start user scenarios?
  • How can the DMM approach be extended to multi-modal mobility data, such as combining check-in history with real-time GPS or public transport trajectories?
Contents
DMM: Leveraging Power-Law Mobility for Strategic Location Promotion in LBSNs
1. TL;DR
2. Background: Why Social Influence is Not Enough
3. Methodology: The Hybrid DMM Architecture
3.1. 1. Estimating "Home" Areas via Random Walk with Restart (RWR)
3.2. 2. The Power-Law Jump (Pareto Distribution)
4. Experiments: Superiority in Sparse Scenarios
4.1. Seed Selection Performance
5. Critical Insight: The "Tourist" Trap
6. Conclusion