Quantization-based hashing with optimal bits for efficient recommendation | Multimedia Tools and Applications Skip to main content
Springer Nature Link
Log in

Quantization-based hashing with optimal bits for efficient recommendation

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Recommendation technique has been widely applied in e-commerce systems, but the efficiency becomes challenging due to the growing scale of users and items. In recent years, several hashing-based recommendation frameworks were proposed to solve the efficiency issue successfully by representing users and items with binary codes. These hashing methods consist of two types: two-stage hashing and learning-based hashing. In this paper, we focus on putting forward to a two-stage hashing called quantization-based hashing (QBH) to alleviate the efficiency bottleneck and improve the recommendation accuracy as well. To be specific, we propose the QBH that consists of similarity quantization and norm quantization. To improve the accuracy performance, we search the optimal bits of quantization by minimizing a quantization loss function. We finally evaluate the proposed method on three public datasets to show its superiority on recommendation accuracy over other two-stage hashing methods and advantage on recommendation efficiency over the state-of-the-art recommender systems.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /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 includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. https://www.imdb.com

  2. https://grouplens.org/datasets/movielens

References

  1. Baltrunas L, Ludwig B, Ricci F (2011) Matrix factorization techniques for context aware recommendation. In: Proceedings of the Fifth ACM Conference on Recommender Systems, ACM, pp 301–304

  2. Cheng C, Yang H, King I, Lyu MR (2012) Fused matrix factorization with geographical and social influence in location-based social networks. Aaai 12:17–23

    Google Scholar 

  3. Gong Y, Lazebnik S, Gordo A, Perronnin F (2013) Iterative quantization: a procrustean approach to learning binary codes for large-scale image retrieval. IEEE Trans Pattern Anal Mach Intell 35(12):2916–2929

    Article  Google Scholar 

  4. Håstad J (2001) Some optimal inapproximability results. J ACM (JACM) 48 (4):798–859

    Article  MathSciNet  Google Scholar 

  5. Hu Y, Koren Y, Volinsky C (2008) Collaborative filtering for implicit feedback datasets. In: 2008 Eighth IEEE International Conference on Data Mining, Ieee, pp 263–272

  6. Jamali M, Ester M (2010) A matrix factorization technique with trust propagation for recommendation in social networks. In: Proceedings of the Fourth ACM Conference on Recommender Systems, ACM, pp 135–142

  7. Koren Y, Bell R (2011) Advances in collaborative filtering. In: Recommender systems handbook, Springer, pp 145–186

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

    Article  Google Scholar 

  9. Lan X, Zhang S, Yuen PC, Chellappa R (2017) Learning common and feature-specific patterns: a novel multiple-sparse-representation-based tracker. IEEE Trans Image Process 27(4):2022–2037

    Article  MathSciNet  Google Scholar 

  10. Lan X, Ye M, Zhang S, Zhou H, Yuen PC (2018) Modality-correlation-aware sparse representation for rgb-infrared object tracking. Pattern Recognition Letters

  11. Lan X, Ye M, Shao R, Zhong B, Jain DK, Zhou H (2019) Online non-negative multi-modality feature template learning for rgb-assisted infrared tracking. IEEE Access 7:67761–67771

    Article  Google Scholar 

  12. Lan X, Ye M, Shao R, Zhong B, Yuen PC, Zhou H (2019) Learning modality-consistency feature templates: a robust rgb-infrared tracking system. IEEE Transactions on Industrial Electronics

  13. Lian D, Zhao C, Xie X, Sun G, Chen E, Rui Y (2014) Geomf: joint geographical modeling and matrix factorization for point-of-interest recommendation. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 831–840

  14. Linden G, Smith B, York J (2003) Amazon. com recommendations: Item-to-item collaborative filtering. Internet Computing, IEEE 7(1):76–80

    Article  Google Scholar 

  15. Ma C, Liu C, Peng F, Liu J (2016) Multi-feature hashing tracking. Pattern Recogn Lett 69:62–71

    Article  Google Scholar 

  16. Ma H, Yang H, Lyu MR, King I (2008) Sorec: social recommendation using probabilistic matrix factorization. In: Proceedings of the 17th ACM conference on Information and knowledge management, ACM, pp 931–940

  17. Muja M, Lowe DG (2009) Fast approximate nearest neighbors with automatic algorithm configuration. In: Proceedings of VISAPP’09, pp 331–340

  18. Qi GJ, Hua XS, Zhang HJ (2009) Learning semantic distance from community-tagged media collection. In: Proc ACM MM, pp 243–252

  19. Shan H, Banerjee A (2010) Generalized probabilistic matrix factorizations for collaborative filtering. In: Proc IEEE ICDM, pp 1025–1030

  20. Wang J, Kumar S, Chang SF (2012) Semi-supervised hashing for large-scale search. IEEE Trans Pattern Anal Mach Intell 34(12):2393–2406

    Article  Google Scholar 

  21. Wang J, Shen HT, Song J, Ji J (2014) Hashing for similarity search: A survey. arXiv preprint arXiv:14082927

  22. Zhang H, Shen F, Liu W, He X, Luan H, Chua TS (2016) Discrete collaborative filtering. In: Proceedings of SIGIR’16, vol 16

  23. Zhang Y, Yang G, Lian D, Wen H, Wu J (2016) Constraint free preference preserving hashing for fast recommendation. In: 2016 IEEE Global Communications Conference, GLOBECOM, IEEE, pp 1–6

  24. Zhang Y, Lian D, Yang G (2017) Discrete personalized ranking for fast collaborative filtering from implicit feedback. In: AAAI, pp 1669–1675

  25. Zhang Y, Yang G, Hu L, Wen H, Wu J (2017) Dot-product based preference preserved hashing for fast collaborative filtering. In: 2017 IEEE International Conference on Communications (ICC), IEEE, pp 1–6

  26. Zhang Y, Wang H, Lian D, Tsang IW, Yin H, Yang G (2018) Discrete ranking-based matrix factorization with self-paced learning. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, ACM, pp 2758–2767

  27. Zhang Z, Wang Q, Ruan L, Si L (2014) Preference preserving hashing for efficient recommendation. In: Proceedings of the 37th international ACM SIGIR Conference on Research & Development in Information Retrieval, ACM, pp 183–192

  28. Zhou K, Zha H (2012) Learning binary codes for collaborative filtering. In: Proc ACM SIGKDD, pp 498–506

  29. Zhu L, Shen J, Xie L, Cheng Z (2016) Unsupervised visual hashing with semantic assistant for content-based image retrieval. IEEE Trans Knowl Data Eng 29 (2):472–486

    Article  Google Scholar 

  30. Zhu L, Huang Z, Liu X, He X, Sun J, Zhou X (2017) Discrete multimodal hashing with canonical views for robust mobile landmark search. IEEE Trans Multimedia 19(9):2066–2079

    Article  Google Scholar 

  31. Zhu L, Huang Z, Li Z, Xie L, Shen HT (2018) Exploring auxiliary context: discrete semantic transfer hashing for scalable image retrieval. IEEE Trans Neural Netw Learn Syst 29(11):5264–5276

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work is supported by National Natural Science Foundation of China (Grant No. 61572109, 61801060).

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, University of Electronic Science and Technology of China, Qingshuihe Campus:No.2006, Xiyuan Ave, West Hi-Tech Zone, Chengdu, 611731, Sichuan, China

    Yan Zhang, Defu Liu & Guowu Yang

  2. Key Laboratory of Mobile Communication, School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing, 400065, China

    Lin Hu

Authors
  1. Yan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Defu Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guowu Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lin Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guowu Yang.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, Y., Liu, D., Yang, G. et al. Quantization-based hashing with optimal bits for efficient recommendation. Multimed Tools Appl 79, 33907–33924 (2020). https://doi.org/10.1007/s11042-020-08705-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-020-08705-z

Keywords

Search

Navigation