Product Description
Influence Maximization in Trajectory Databases
Abstract— A novel problem of influence maximization in trajectory databases that is very useful in precise location-aware advertising. It finds k best trajectories to be attached with a given advertisement and maximizes the expected influence among a large group of audience. We show that the problem is NP-hard and propose both exact and approximate solutions to find the best set of trajectories. In the exact solution, we devise an expansion-based framework that enumerates trajectory combinations in a best-first manner and propose three types of upper bound estimation techniques to facilitate early termination. In addition, we propose a novel trajectory index to reduce the influence calculation cost. To support large k, we propose a greedy solution with an approximation ratio of (1-1/e), whose performance is further optimized by a new proposed cluster-based method. We also propose a threshold method. In addition, we extend our problem to support the scenario when there are a group of advertisements. < final year projects >
Including Packages
Our Specialization
Support Service
Statistical Report
![Influence Maximization In Trajectory Databases 4 110](https://myprojectbazaar.com/wp-content/uploads/2013/12/110.jpg)
satisfied customers
3,589![Influence Maximization In Trajectory Databases 5 25](https://myprojectbazaar.com/wp-content/uploads/2013/12/25.jpg)
Freelance projects
983![Influence Maximization In Trajectory Databases 6 311](https://myprojectbazaar.com/wp-content/uploads/2013/12/311.jpg)
sales on Site
11,021![Influence Maximization In Trajectory Databases 7 41](https://myprojectbazaar.com/wp-content/uploads/2013/12/41.jpg)
developers
175+