Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

Deep trajectory: a deep learning approach for mobile advertising in vehicular networks

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Mobile advertising is an interesting research topic and a promising commercial application in vehicular networks, which is expected to spread the timely information into the network at a lower cost. Seed vehicles are of vital importance for information broadcasting in mobile advertising. How to find the best set of seed vehicles with maximal influence on the network is a very challenging problem. In this paper, we propose developing deep learning schemes to select the most suitable candidate vehicles for mobile advertising so as to achieve maximum coverage and impact in vehicular networks. Specifically, we adopt the deep structure for the mobile advertising problem to exploit the spatial-temporal regularities of vehicle traces. The adaptive models MLP-W and MLP-T are able to either infer the future topology of vehicles explicitly or predict the future trajectory and infer topology implicitly. Then, vehicles with higher centralities are considered as good seeds for timely information disseminating. Extensive experiments have been conducted over two real-world taxi trace datasets. And the experimental results demonstrate the efficacy of our proposed methodology compared with the state-of-the-art approach for mobile advertising tasks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Notes

  1. Note that the “familiar stranger pattern” will be more obvious if we include the bus trace data.

  2. As the max derivative value for a Sigmoid activation function \(\sigma (x)\) will be 1/4. So when implementing BP, we have \(\left| w_j*\sigma '(x_j)\right| <1/4\), where \(w_j\) is the weights for very layer, \(\sigma '(x_j)\) is the derivative of Sigmoid activation function. So there will be a product of many such terms, and the product will tend to exponentially decrease: the deeper the structure is, the smaller the product will be, which is the so-called vanishing gradient problem in deep learning area. However, ReLU activation function does not have this problem.

  3. The LSTM used in the experiment has two hidden layers with 5000 neurons in each layer, the dropout value is 0.5, the activation function used in the hidden layers is ReLU.

References

  1. Toor Y, Muhlethaler P, Laouiti A, Da Le Fortelle A (2008) Vehicle ad hoc networks: applications. IEEE Commun Surv Rutor 10:74–88

    Article  Google Scholar 

  2. Haghirian P, Madlberger M, Tanuskova A (2005) Increasing advertising value of mobile marketing-an empirical study of antecedents. In: Proceedings of the 38th annual Hawaii international conference on system sciences, pp 32c–32c

  3. de Castro JE, Shimakawa H (2006) Mobile advertisement system utilizing user’s contextual information. In: 7th international conference on mobile data management (MDM’06), pp 91–91

  4. Haddadi H, Hui P, Brown I (2010) MobiAd: private and scalable mobile advertising. In: Proceedings of the fifth ACM international workshop on Mobility in the evolving internet architecture, pp 33–38

  5. Qin J, Zhu H, Zhu Y, Lu L, Xue G, Li M (2016) Post: exploiting dynamic sociality for mobile advertising in vehicular networks. IEEE Trans Parallel Distrib Syst 27:1770–1782

    Article  Google Scholar 

  6. Kempe D, Kleinberg J, Tardos É (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp 137–146

  7. Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 199–208

  8. Wang Y, Cong G, Song G, Xie K (2010) Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 1039–1048

  9. Korkmaz G, Ekici E, Özgüner F, Özgüner Ü (2004) Urban multi-hop broadcast protocol for inter-vehicle communication systems. In: Proceedings of the 1st ACM international workshop on vehicular ad hoc networks, pp 76–85

  10. Saha AK, Johnson DB (2004) Modeling mobility for vehicular ad-hoc networks. In: Proceedings of the 1st ACM international workshop on vehicular ad hoc networks, pp 91–92

  11. Wu H, Fujimoto R, Guensler R, Hunter M (2004) MDDV: a mobility-centric data dissemination algorithm for vehicular networks. In: Proceedings of the 1st ACM international workshop on vehicular ad hoc networks, pp 47–56

  12. Lochert C, Hartenstein H, Tian J, Fussler H, Hermann D, Mauve M (2003) A routing strategy for vehicular ad hoc networks in city environments. In: Intelligent Vehicles Symposium, 2003. Proceedings. IEEE, pp 156–161

  13. Heinzelman WR, Kulik J, Balakrishnan H (1999) Adaptive protocols for information dissemination in wireless sensor networks. In: Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, pp 174–185

  14. Wischhof L, Ebner A, Rohling H (2005) Information dissemination in self-organizing intervehicle networks. IEEE Trans Intell Transp Syst 6:90–101

    Article  Google Scholar 

  15. Jeung H, Liu Q, Shen HT, Zhou X (2008) A hybrid prediction model for moving objects. In: IEEE international conference on data engineering, pp 70–79

  16. Fürstenberg K, Rössler B (2005) A new European approach for intersection safety the EC-Project INTERSAFE. Springer, Berlin, pp 432–436

    Google Scholar 

  17. Zeadally S, Hunt R, Chen Y-S, Irwin A, Hassan A (2012) Vehicular ad hoc networks (VANETS): status, results, and challenges. Telecommun Syst 50:217–241

    Article  Google Scholar 

  18. Bai F, Stancil DD, Krishnan H (2010) Toward understanding characteristics of dedicated short range communications (DSRC) from a perspective of vehicular network engineers. In: International conference on mobile computing and networking, MOBICOM 2010, Chicago, Illinois, USA, September, pp 329–340

  19. Sun L, Axhausen KW, Lee D-H, Huang X (2013) Understanding the collective encounter patterns in an empirical urban contact network, CoRR, abs/1301.5979

  20. LeCun Y, Bengio Y, Hinton G (2015) Deep learning. Nature 521:436–444

    Article  Google Scholar 

  21. Ye F, Roy S, Wang H (2012) Efficient data dissemination in vehicular ad hoc networks. IEEE J Sel Areas Commun 30:769–779

    Article  Google Scholar 

  22. Chen K, Chen L, Mao J, Zhao D (2013) A multiple metrics gateway selection algorithm for vehicular ad hoc networks in fading channels. In: Proceedings of the 9th international conference on computational intelligence and security (CIS), pp 648–652

  23. Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, pp 57–66

  24. Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pp 61–70

  25. Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83:1420–1443

    Article  Google Scholar 

  26. Watts DJ (2002) A simple model of global cascades on random networks. Proc Natl Acad Sci USA 99:5766–5771

    Article  MathSciNet  MATH  Google Scholar 

  27. Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 1029–1038

  28. Kimura M, Saito K, Nakano R (2007) Extracting influential nodes for information diffusion on a social network. AAAI 7:1371–1376

    Google Scholar 

  29. Zhang H, Cao X, Ho JKL, Chow TWS (2017) Object-level video advertising: an optimization framework. IEEE Trans Ind Inform 13:520–531

    Article  Google Scholar 

  30. Wu Y, Zhu Y, Li B (2011) Trajectory improves data delivery in vehicular networks. In: Proceedings of the 30th IEEE international conference on computer communications. INFOCOM 2011, pp 2183–2191

  31. Namboodiri V, Gao L (2007) Prediction-based routing for vehicular ad hoc networks. IEEE Trans Veh Technol 56:2332–2345

    Article  Google Scholar 

  32. Xue G et al (2012) A novel vehicular location prediction based on mobility patterns for routing in urban vanet. EURASIP J Wirel Commun Netw C7–222(2012):1–14

  33. Burgess J, Gallagher B, Jensen D, Levine BN (2006) MaxProp: routing for vehicle-based disruption-tolerant networks. In: Proceedings of the 25th IEEE international conference on computer communications. INFOCOM 2006, vol 6, pp 1–11

  34. Choi O, Kim S, Jeong J, Lee H, Chong S (2013) Delay-optimal data forwarding in vehicular sensor networks. In: Proceedings of the 11th international symposium on modeling and optimization in mobile, ad hoc and wireless networks. WiOpt 2013, pp 532–539

  35. Krizhevsky A, Sutskever I, Hinton GE (2012) ImageNet classification with deep convolutional neural networks. In: Advances in neural information processing systems, vol 25, pp 1097–1105

  36. Silver D, Huang A, Maddison CJ, Guez A, Sifre L, Van Den Driessche G, Schrittwieser J, Antonoglou I, Panneershelvam V, Lanctot M (2016) Mastering the game of Go with deep neural networks and tree search. Nature 529:484–489

    Article  Google Scholar 

  37. Rumelhart DE, Hinton GE, Williams RJ (1985) Learning internal representations by error propagation. DTIC Document

  38. Rumelhart DE, Hinton GE, Williams RJ (1988) Learning representations by back-propagating errors. Cogn Model 5:1

    MATH  Google Scholar 

  39. Hornik K, Stinchcombe M, White H (1989) Multilayer feedforward networks are universal approximators. Neural Netw 5:359–366

    Article  MATH  Google Scholar 

  40. Hahnloser RHR, Sarpenshkar R, Mahowald MA, Douglas RJ, Seung HS (2000) Digital selection and analogue amplification coesist in a cortex-inspired silicon circuit. Nature 405:947–951

    Article  Google Scholar 

  41. de Brébisson A, Simon É, Auvolat A, Vincent P, Bengio Y (2015) Artificial neural networks applied to taxi destination prediction. arXiv:1508.00021

  42. Bengio Y, Ducharme R, Vincent P, Jauvin C (2003) A neural probabilistic language model. J Mach Learn Res 3:1137–1155

    MATH  Google Scholar 

  43. S. J. U. Traffic Information Grid Team, Grid Computing Center (2005) Shanghai taxi trace data. http://wirelesslab.sjtu.edu.cn/

  44. Kaggle (2015) ECML/PKDD 15: taxi trajectory prediction(I). http://www.kaggle.com/c/pkdd-15-predict-taxi-service-trajectory-i

  45. Hochreiter S, Schmidhuber J (1997) Long short-term memory. Neural Comput 9(8):1735–1780

    Article  Google Scholar 

  46. Zhang H, Li J, Ji Y, Yue H (2017) Understanding subtitles by character-level sequence-to-sequence learning. IEEE Trans Ind Inform 13(2):616–624

    Article  Google Scholar 

  47. Bengio Y, Simard P, Frasconi P (1994) Learning long-term dependencies with gradient descent is difficult. IEEE Trans Neural Netw 5:157–166

    Article  Google Scholar 

Download references

Acknowledgements

This work has been partially supported by National Key R&D Program of China under Grant No. 2017YFB0803300 and NSFC under Grant No. 61772074.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chuan Zhou.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, X., Yang, L., Li, Y. et al. Deep trajectory: a deep learning approach for mobile advertising in vehicular networks. Neural Comput & Applic 31, 2813–2825 (2019). https://doi.org/10.1007/s00521-017-3231-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-017-3231-1

Keywords