Skip to main content
Top
Published in: Knowledge and Information Systems 1/2021

17-09-2020 | Regular Paper

Incremental one-class collaborative filtering with co-evolving side networks

Published in: Knowledge and Information Systems | Issue 1/2021

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

One-class collaborative filtering (OCCF) is a fundamental research problem in a myriad of applications where the preferences of users can only be implicitly inferred from their one-class feedback (e.g., click an ad or purchase a product). The main challenges of OCCF lie in the sparsity of user feedback and the ambiguity of unobserved preferences. To effectively address the above two challenges, side networks from users and items are extensively exploited by state-of-the-art methods, which are predominantly focused on static settings. However, as real-world recommender systems evolve over time (where both the user–item ratings and user–user/item–item side networks will change), it is necessary to update OCCF results (e.g., the latent features of users and items) accordingly. The main obstacle for OCCF online update with co-evolving side networks lies in the fact that the coupled system is highly sensitive to local changes, which may cause massive perturbation on the latent features of a large number of users and items. In this paper, we propose a novel incremental one-class collaborative filtering (OCCF) method that can cope with co-evolving side networks efficiently. In particular, we model the evolution of latent features as a linear transformation process, which enables fast update of the latent features on the fly. Empirical experiments demonstrate that our method can provide high-quality recommendation results on real-world datasets.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Appendix
Available only for authorised users
Footnotes
1
The rationale behind the non-negative constraint is that non-negative matrix factorization is more capable of a representation for parts of data [16], making the factorization results more expressive for data reconstruction [8].
 
2
\(\Vert {\mathbf {a}}\Vert _2\) is the L2-norm of vector \(\mathbf {a}\).
 
3
Similarity between items is calculated by the cosine similarity between TF-IDF (Term Frequency-Inverse Document Frequency) [27] word vectors constructed from item reviews.
 
4
Eq. (1) is derived from wiZAN-Dual in [42]. Therefore, ReRun is equivalent to wiZan-Dual here.
 
Literature
1.
go back to reference Aggarwal C, Subbian K (2014) Evolutionary network analysis: a survey. ACM Comput Surv 47(1):10CrossRef Aggarwal C, Subbian K (2014) Evolutionary network analysis: a survey. ACM Comput Surv 47(1):10CrossRef
2.
go back to reference Aggarwal, CC, Li N (2011) On node classification in dynamic content-based networks. In: Proceedings of the 2011 SIAM international conference on data mining, pp 355–366 Aggarwal, CC, Li N (2011) On node classification in dynamic content-based networks. In: Proceedings of the 2011 SIAM international conference on data mining, pp 355–366
3.
go back to reference Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, CambridgeCrossRef Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, CambridgeCrossRef
4.
go back to reference Chen C, Tong H (2015) Fast eigen-functions tracking on dynamic graphs. In: Proceedings of the 2015 SIAM international conference on data mining, pp 559–567 Chen C, Tong H (2015) Fast eigen-functions tracking on dynamic graphs. In: Proceedings of the 2015 SIAM international conference on data mining, pp 559–567
5.
go back to reference Chen C, Tong H, Xie L, Ying L, He Q (2016) Fascinate: fast cross-layer dependency inference on multi-layered networks. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp 765–774 Chen C, Tong H, Xie L, Ying L, He Q (2016) Fascinate: fast cross-layer dependency inference on multi-layered networks. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp 765–774
6.
go back to reference Chen X, Candan KS (2014) LWI-SVD: low-rank, windowed, incremental singular value decompositions on time-evolving data sets. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 987–996 Chen X, Candan KS (2014) LWI-SVD: low-rank, windowed, incremental singular value decompositions on time-evolving data sets. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 987–996
7.
go back to reference Ding Y, Li X (2005) Time weight collaborative filtering. In: Proceedings of the 14th ACM international conference on information and knowledge management, pp 485–492 Ding Y, Li X (2005) Time weight collaborative filtering. In: Proceedings of the 14th ACM international conference on information and knowledge management, pp 485–492
8.
go back to reference Field DJ (1994) What is the goal of sensory coding? Neural Comput 6(4):559–601CrossRef Field DJ (1994) What is the goal of sensory coding? Neural Comput 6(4):559–601CrossRef
9.
go back to reference Herlocker JL, Konstan JA, Borchers A, Riedl J (1999) An algorithmic framework for performing collaborative filtering. In: Proceedings of the 22nd annual international ACM SIGIR conference on research and development in information retrieval, pp 230–237 Herlocker JL, Konstan JA, Borchers A, Riedl J (1999) An algorithmic framework for performing collaborative filtering. In: Proceedings of the 22nd annual international ACM SIGIR conference on research and development in information retrieval, pp 230–237
10.
go back to reference Hofmann T (2004) Latent semantic models for collaborative filtering. ACM Trans Inf Syst 22(1):89–115CrossRef Hofmann T (2004) Latent semantic models for collaborative filtering. ACM Trans Inf Syst 22(1):89–115CrossRef
11.
go back to reference Hu Y, Koren Y, Volinsky C (2008) Collaborative filtering for implicit feedback datasets. In: Proceedings of the 8th IEEE international conference on data mining, pp 263–272 Hu Y, Koren Y, Volinsky C (2008) Collaborative filtering for implicit feedback datasets. In: Proceedings of the 8th IEEE international conference on data mining, pp 263–272
12.
go back to reference Huang X, Wu L, Chen E, Zhu H, Liu Q, Wang Y, Center BTI (2017) Incremental matrix factorization: a linear feature transformation perspective. In: Proceedings of the 26th international joint conference on artificial intelligence, pp 1901–1908 Huang X, Wu L, Chen E, Zhu H, Liu Q, Wang Y, Center BTI (2017) Incremental matrix factorization: a linear feature transformation perspective. In: Proceedings of the 26th international joint conference on artificial intelligence, pp 1901–1908
13.
go back to reference Jiang M, Cui P, Wang F, Zhu W, Yang S (2014) Scalable recommendation with social contextual information. IEEE Trans Knowl Data Eng 26(11):2789–2802CrossRef Jiang M, Cui P, Wang F, Zhu W, Yang S (2014) Scalable recommendation with social contextual information. IEEE Trans Knowl Data Eng 26(11):2789–2802CrossRef
14.
go back to reference Koren Y (2008) Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp 426–434 Koren Y (2008) Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp 426–434
15.
go back to reference Koren Y (2009) Collaborative filtering with temporal dynamics. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, pp 447–456 Koren Y (2009) Collaborative filtering with temporal dynamics. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, pp 447–456
16.
go back to reference Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788–791CrossRef Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788–791CrossRef
17.
go back to reference Lee DD, Seung HS (2001) Algorithms for non-negative matrix factorization. In: Advances in neural information processing systems, pp 556–562 Lee DD, Seung HS (2001) Algorithms for non-negative matrix factorization. In: Advances in neural information processing systems, pp 556–562
18.
go back to reference Leskovec J, Backstrom L, Kumar R, Tomkins A (2008) Microscopic evolution of social networks. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp 462–470 Leskovec J, Backstrom L, Kumar R, Tomkins A (2008) Microscopic evolution of social networks. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp 462–470
19.
go back to reference Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the 11th ACM SIGKDD international conference on knowledge discovery in data mining, pp 177–187 Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the 11th ACM SIGKDD international conference on knowledge discovery in data mining, pp 177–187
20.
go back to reference Li J, Dani H, Hu X, Tang J, Chang Y, Liu H (2017) Attributed network embedding for learning in a dynamic environment. In: Proceedings of the 26th ACM international conference on conference on information and knowledge management Li J, Dani H, Hu X, Tang J, Chang Y, Liu H (2017) Attributed network embedding for learning in a dynamic environment. In: Proceedings of the 26th ACM international conference on conference on information and knowledge management
21.
go back to reference Li J, Hu X, Jian L, Liu H (2016) Toward time-evolving feature selection on dynamic networks. In: Proceedings of the 2016 IEEE international conference on data mining, pp 1003–1008 Li J, Hu X, Jian L, Liu H (2016) Toward time-evolving feature selection on dynamic networks. In: Proceedings of the 2016 IEEE international conference on data mining, pp 1003–1008
22.
go back to reference Li Y, Hu J, Zhai C, Chen Y (2010) Improving one-class collaborative filtering by incorporating rich user information. In: Proceedings of the 19th ACM international conference on information and knowledge management, pp 959–968 Li Y, Hu J, Zhai C, Chen Y (2010) Improving one-class collaborative filtering by incorporating rich user information. In: Proceedings of the 19th ACM international conference on information and knowledge management, pp 959–968
23.
go back to reference Ma H, Zhou D, Liu C, Lyu MR, King I (2011) Recommender systems with social regularization. In: Proceedings of the 4th ACM international conference on web search and data mining, pp 287–296 Ma H, Zhou D, Liu C, Lyu MR, King I (2011) Recommender systems with social regularization. In: Proceedings of the 4th ACM international conference on web search and data mining, pp 287–296
24.
go back to reference Pan R, Zhou Y, Cao B, Liu NN, Lukose R, Scholz M, Yang Q (2008) One-class collaborative filtering. In: Proceedings of the 8th IEEE international conference on data mining, pp 502–511 Pan R, Zhou Y, Cao B, Liu NN, Lukose R, Scholz M, Yang Q (2008) One-class collaborative filtering. In: Proceedings of the 8th IEEE international conference on data mining, pp 502–511
25.
go back to reference Pan W, Chen L (2013) Gbpr: group preference based bayesian personalized ranking for one-class collaborative filtering. In: Proceedings of the 23rd international joint conference on artificial intelligence, vol 13, pp 2691–2697 Pan W, Chen L (2013) Gbpr: group preference based bayesian personalized ranking for one-class collaborative filtering. In: Proceedings of the 23rd international joint conference on artificial intelligence, vol 13, pp 2691–2697
26.
go back to reference Qin J, Ren K, Fang Y, Zhang W, Yu Y (2020) Sequential recommendation with dual side neighbor-based collaborative relation modeling. In: Proceedings of the 13th international conference on web search and data mining, pp 465–473 Qin J, Ren K, Fang Y, Zhang W, Yu Y (2020) Sequential recommendation with dual side neighbor-based collaborative relation modeling. In: Proceedings of the 13th international conference on web search and data mining, pp 465–473
27.
go back to reference Rajaraman A, Ullman JD (2011) Mining of massive datasets. Cambridge University Press, CambridgeCrossRef Rajaraman A, Ullman JD (2011) Mining of massive datasets. Cambridge University Press, CambridgeCrossRef
28.
go back to reference Rendle S, Freudenthaler C, Gantner Z, Schmidt-Thieme L (2009) Bpr: Bayesian personalized ranking from implicit feedback. In: Proceedings of the 25th conference on uncertainty in artificial intelligence, pp 452–461 Rendle S, Freudenthaler C, Gantner Z, Schmidt-Thieme L (2009) Bpr: Bayesian personalized ranking from implicit feedback. In: Proceedings of the 25th conference on uncertainty in artificial intelligence, pp 452–461
29.
go back to reference Rendle S, Freudenthaler C, Schmidt-Thieme L (2010) Factorizing personalized markov chains for next-basket recommendation. In: Proceedings of the 19th international conference on world wide web, pp 811–820 Rendle S, Freudenthaler C, Schmidt-Thieme L (2010) Factorizing personalized markov chains for next-basket recommendation. In: Proceedings of the 19th international conference on world wide web, pp 811–820
30.
go back to reference Shi Y, Karatzoglou A, Baltrunas L, Larson M, Oliver N, Hanjalic A (2012) Climf: learning to maximize reciprocal rank with collaborative less-is-more filtering. In: Proceedings of the sixth ACM conference on recommender systems, pp 139–146 Shi Y, Karatzoglou A, Baltrunas L, Larson M, Oliver N, Hanjalic A (2012) Climf: learning to maximize reciprocal rank with collaborative less-is-more filtering. In: Proceedings of the sixth ACM conference on recommender systems, pp 139–146
31.
go back to reference Tang J, Gao H, Liu H (2012) mtrust: discerning multi-faceted trust in a connected world. In: Proceedings of the 5th ACM international conference on web search and data mining, pp 93–102 Tang J, Gao H, Liu H (2012) mtrust: discerning multi-faceted trust in a connected world. In: Proceedings of the 5th ACM international conference on web search and data mining, pp 93–102
32.
go back to reference Tang J, Gao H, Liu H, Das Sarma A (2012) etrust: understanding trust evolution in an online world. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, pp 253–261 Tang J, Gao H, Liu H, Das Sarma A (2012) etrust: understanding trust evolution in an online world. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, pp 253–261
33.
go back to reference Tang J, Hu X, Liu H (2013) Social recommendation: a review. Soc Netw Anal Min 3(4):1113–1133CrossRef Tang J, Hu X, Liu H (2013) Social recommendation: a review. Soc Netw Anal Min 3(4):1113–1133CrossRef
34.
go back to reference Tang L, Liu H, Zhang J, Nazeri Z (2008) Community evolution in dynamic multi-mode networks. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp 677–685 Tang L, Liu H, Zhang J, Nazeri Z (2008) Community evolution in dynamic multi-mode networks. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp 677–685
35.
go back to reference Tong H, Papadimitriou S, Sun J, Yu PS, Faloutsos C (2008) Colibri: fast mining of large static and dynamic graphs. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp 686–694 Tong H, Papadimitriou S, Sun J, Yu PS, Faloutsos C (2008) Colibri: fast mining of large static and dynamic graphs. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp 686–694
36.
go back to reference Tong H, Papadimitriou S, Yu PS, Faloutsos C (2008) Fast monitoring proximity and centrality on time-evolving bipartite graphs. Stat Anal Data Min 1(3):142–156MathSciNetCrossRef Tong H, Papadimitriou S, Yu PS, Faloutsos C (2008) Fast monitoring proximity and centrality on time-evolving bipartite graphs. Stat Anal Data Min 1(3):142–156MathSciNetCrossRef
37.
go back to reference Vinagre J, Jorge AM, Gama J (2014) Fast incremental matrix factorization for recommendation with positive-only feedback. In: International conference on user modeling, adaptation, and personalization. Springer, pp 459–470 Vinagre J, Jorge AM, Gama J (2014) Fast incremental matrix factorization for recommendation with positive-only feedback. In: International conference on user modeling, adaptation, and personalization. Springer, pp 459–470
38.
go back to reference Wang F, Tong H, Lin CY (2011) Towards evolutionary nonnegative matrix factorization. In: Twenty-fifth AAAI conference on artificial intelligence Wang F, Tong H, Lin CY (2011) Towards evolutionary nonnegative matrix factorization. In: Twenty-fifth AAAI conference on artificial intelligence
39.
go back to reference Wang X, Lu W, Ester M, Wang C, Chen C (2016) Social recommendation with strong and weak ties. In: Proceedings of the 25th ACM international on conference on information and knowledge management, pp 5–14 Wang X, Lu W, Ester M, Wang C, Chen C (2016) Social recommendation with strong and weak ties. In: Proceedings of the 25th ACM international on conference on information and knowledge management, pp 5–14
40.
go back to reference Wu L, Ge Y, Liu Q, Chen E, Hong R, Du J, Wang M (2017) Modeling the evolution of users preferences and social links in social networking services. IEEE Trans Knowl Data Eng 29(6):1240–1253CrossRef Wu L, Ge Y, Liu Q, Chen E, Hong R, Du J, Wang M (2017) Modeling the evolution of users preferences and social links in social networking services. IEEE Trans Knowl Data Eng 29(6):1240–1253CrossRef
41.
go back to reference Xiong L, Chen X, Huang TK, Schneider J, Carbonell JG (2010) Temporal collaborative filtering with bayesian probabilistic tensor factorization. In: Proceedings of the 2010 SIAM international conference on data mining. SIAM, pp 211–222 Xiong L, Chen X, Huang TK, Schneider J, Carbonell JG (2010) Temporal collaborative filtering with bayesian probabilistic tensor factorization. In: Proceedings of the 2010 SIAM international conference on data mining. SIAM, pp 211–222
42.
go back to reference Yao Y, Tong H, Yan G, Xu F, Zhang X, Szymanski BK, Lu J (2014) Dual-regularized one-class collaborative filtering. In: Proceedings of the 23rd ACM international conference on conference on information and knowledge management, pp 759–768 Yao Y, Tong H, Yan G, Xu F, Zhang X, Szymanski BK, Lu J (2014) Dual-regularized one-class collaborative filtering. In: Proceedings of the 23rd ACM international conference on conference on information and knowledge management, pp 759–768
43.
go back to reference Zhao T, McAuley J, King I (2014) Leveraging social connections to improve personalized ranking for collaborative filtering. In: Proceedings of the 23rd ACM international conference on conference on information and knowledge management, pp 261–270 Zhao T, McAuley J, King I (2014) Leveraging social connections to improve personalized ranking for collaborative filtering. In: Proceedings of the 23rd ACM international conference on conference on information and knowledge management, pp 261–270
Metadata
Title
Incremental one-class collaborative filtering with co-evolving side networks
Publication date
17-09-2020
Published in
Knowledge and Information Systems / Issue 1/2021
Print ISSN: 0219-1377
Electronic ISSN: 0219-3116
DOI
https://doi.org/10.1007/s10115-020-01511-x

Other articles of this Issue 1/2021

Knowledge and Information Systems 1/2021 Go to the issue

Premium Partner