Skip to main content

Optimized Random Walk with Restart for Recommendation Systems

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (Canadian AI 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11489))

Included in the following conference series:

Abstract

Many sophisticated recommendation methods have been developed to produce recommendations to the users. Among them, Random Walk with Restart (RWR) is one of the most widely used techniques. However, RWR has a large time complexity of \(O(k(n+m)^3)\) and memory complexity of \((O(n+m)^2)\). The change reducing the computational complexity is of great practical importance. In this paper, we propose an optimized version of random walk with restart, called the Optimized Random Walk with Restart (ORWR) and conduct theoretical and empirical studies on its performance. Mathematical analysis shows that using this technique the time complexity reduces to \(O(nm^2)\) and the memory complexity to O(nm). Experiments on three different recommendation problems using real-world datasets confirms the proposed ORWR method improves both time and memory cost of the recommendation.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Dong, X., Shen, J., Shao, L., Gool, L.V.: Sub-markov random walk for image segmentation. IEEE Tran. Image Process. 25(2), 516–527 (2016)

    Article  MathSciNet  Google Scholar 

  2. Grady, L.: Random walks for image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 28(11), 1768–1783 (2006)

    Article  Google Scholar 

  3. Liu, Y., Zeng, X., He, Z., Zou, Q.: Inferring microrna-disease associations by random walk on a heterogeneous network with multiple data sources. IEEE/ACM Trans. Comput. Biol. Bioinf. 14(4), 905–915 (2017)

    Article  Google Scholar 

  4. Yin, Z., Gupta, M., Weninger, T., Han, J.: A unified framework for link recommendation using random walks. In: 2010 International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 152–159, 08 2010

    Google Scholar 

  5. Gori, M., Pucci, A.: Itemrank: a random-walk based scoring algorithm for recommender engines. In: Proceedings of the 20th International Joint Conference on Artifical Intelligence. IJCAI 2007, pp. pp. 2766–2771. Morgan Kaufmann Publishers Inc., San Francisco (2007)

    Google Scholar 

  6. Tong, H., Faloutsos, C., Pan, J.: Fast random walk with restart and its applications. In: Sixth International Conference on Data Mining (ICDM 2006), pp. 613–622, December 2006

    Google Scholar 

  7. Yu, W., Lin, X.: IRWR: incremental random walk with restart. In: Proceedings of the 36th International ACM SIGIR Conference on Research and Development in Information Retrieval. SIGIR 2013, pp. 1017–1020. ACM, New York (2013)

    Google Scholar 

  8. Pearson, K.: The problem of the random walk. Nature 72(1865), 294 (1905)

    Article  Google Scholar 

  9. Cooper, C.S., Lee, S.H., Radzik, T., Siantos, Y.: Random walks in recommender systems: exact computation and simulations. In: WWW (2014)

    Google Scholar 

  10. Christoffel, F., Paudel, B., Newell, C., Bernstein, A.: Blockbusters and wallflowers: accurate, diverse, and scalable recommendations with random walks. In: RecSys (2015)

    Google Scholar 

  11. Fouss, F., Pirotte, A., Renders, J., Saerens, M.: Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans Knowl. Data Eng. 19(3), 355–369 (2007)

    Article  Google Scholar 

  12. Nikolakopoulos, A.N., Korba, A., Garofalakis, J.D.: Random surfing on multipartite graphs. In: 2016 IEEE International Conference on Big Data (Big Data), pp. 736–745, December 2016

    Google Scholar 

  13. Movielens \(\vert \) grouplens. https://grouplens.org/datasets/movielens/. Accessed 17 Oct 2018

  14. Zhou, D., Wang, B., Rahimi, S.M., Wang, X.: A study of recommending locations on location-based social network by collaborative filtering. Proc. Can. AI 2012, 255–266 (2012)

    MathSciNet  Google Scholar 

  15. Download geolife gps trajectories. https://www.microsoft.com/en-us/download/details.aspx?id=52367 Accessed 17 Oct 2018

  16. Rahimi, S.M., Wang, X., Far, B.: Behavior-based location recommendation on location-based social networks. In: Kim, J., Shim, K., Cao, L., Lee, J.-G., Lin, X., Moon, Y.-S. (eds.) PAKDD 2017. LNCS (LNAI), vol. 10235, pp. 273–285. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-57529-2_22

    Chapter  Google Scholar 

  17. Zheng, Y., Zhang, L., Xie, X., Ma, W.Y.: Mining interesting locations and travel sequences from GPS trajectories. In: Proceedings of the 18th International Conference on World Wide Web. WWW 2009, pp. 791–800. ACM, New York (2009)

    Google Scholar 

  18. Zheng, Y., Li, Q., Chen, Y., Xie, X., Ma, W.Y.: Understanding mobility based on GPS data. In: Proceedings of the UbiComp 2008. UbiComp 2008, pp. 312–321. ACM, New York (2008)

    Google Scholar 

  19. Zheng, Y., Xie, X., Ma, W.Y.: Geolife: a collaborative social networking service among user, location and trajectory. IEEE Data(base) Engineering Bulletin, June 2010

    Google Scholar 

  20. Cui, G., Wang, X.: MaP2R: a personalized maximum probability route recommendation method using GPS trajectories. In: Kim, J., Shim, K., Cao, L., Lee, J.-G., Lin, X., Moon, Y.-S. (eds.) PAKDD 2017. LNCS (LNAI), vol. 10235, pp. 168–180. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-57529-2_14

    Chapter  Google Scholar 

  21. Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(8), 30–37 (2009)

    Article  Google Scholar 

  22. Park, H., Jung, J., Kang, U.: A comparative study of matrix factorization and random walk with restart in recommender systems. CoRR abs/1708.09088 (2017)

    Google Scholar 

Download references

Acknowledgments

The research is supported by the Natural Sciences and Engineering Research Council of Canada Discovery Grant to Xin Wang and Behrouz Far, and National Natural Science Foundation of China (No. 61772420).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xin Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rahimi, S.M., de Oliveira e Silva, R.A., Far, B., Wang, X. (2019). Optimized Random Walk with Restart for Recommendation Systems. In: Meurs, MJ., Rudzicz, F. (eds) Advances in Artificial Intelligence. Canadian AI 2019. Lecture Notes in Computer Science(), vol 11489. Springer, Cham. https://doi.org/10.1007/978-3-030-18305-9_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-18305-9_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-18304-2

  • Online ISBN: 978-3-030-18305-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics