Fetching the paper…
Reading the bibliography…
Recommender systems are important for providing personalized services to users, but the vast amount of collected user data has raised concerns about privacy (e.g., sensitive data), security (e.g., malicious data) and utility (e.g., toxic data).
J. Yu, H. Zhu, C.-Y. Chang, X. Feng, B. Yuan, X. He, and Z. Dong, “Influence function for unbiased recommendation,” in Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval , 2020, pp. 1929–1932
1932
Earlier work this paper cites.
F. R. Hampel, “The influence curve and its role in robust estimation,” Journal of the american statistical association , vol. 69, no. 346, pp. 383–393, 1974
1974
Earlier work this paper cites.
J. L. Herlocker, J. A. Konstan, A. Borchers, and J. Riedl, “An algorithmic framework for performing collaborative filtering,” in Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval , 1999, pp. 230–237
1999
Earlier work this paper cites.
B. Sarwar, G. Karypis, J. Konstan, and J. T. Riedl, “Application of dimensionality reduction in recommender system-a case study,” Computer Science & Engineering (CS&E) Technical Reports , 2000
2000
Earlier work this paper cites.
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, “Item-based collaborative filtering recommendation algorithms,” in Proceedings of the 10th international conference on World Wide Web , 2001, pp. 285–295
2001
Earlier work this paper cites.
J. C. Bezdek and R. J. Hathaway, “Convergence of alternating optimization,” Neural, Parallel & Scientific Computations , vol. 11, no. 4, pp. 351–368, 2003
2003
Earlier work this paper cites.
C. Dwork, “Differential privacy,” in International colloquium on automata, languages, and programming . Springer, 2006, pp. 1–12
2006
Earlier work this paper cites.
J. B. Schafer, D. Frankowski, J. Herlocker, and S. Sen, “Collaborative filtering recommender systems,” in The adaptive web: methods and strategies of web personalization . Springer, 2007, pp. 291–324
2007
Earlier work this paper cites.
Y. Hu, Y. Koren, and C. Volinsky, “Collaborative filtering for implicit feedback datasets,” in 2008 Eighth IEEE international conference on data mining . Ieee, 2008, pp. 263–272
2008
Earlier work this paper cites.
Y. Koren, “Factorization meets the neighborhood: a multifaceted collaborative filtering model,” in Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining , 2008, pp. 426–434
2008
Earlier work this paper cites.
Y. Zhou, D. Wilkinson, R. Schreiber, and R. Pan, “Large-scale parallel collaborative filtering for the netflix prize,” in Algorithmic Aspects in Information and Management: 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings 4 . Springer, 2008, pp. 337–348
2008
Earlier work this paper cites.
Y. Koren, R. Bell, and C. Volinsky, “Matrix factorization techniques for recommender systems,” Computer , vol. 42, no. 8, pp. 30–37, 2009
2009
Earlier work this paper cites.
J. Martens et al. , “Deep learning via hessian-free optimization.” in ICML , vol. 27, 2010, pp. 735–742
2010
Earlier work this paper cites.
X. Ning and G. Karypis, “Slim: Sparse linear methods for top-n recommender systems,” in 2011 IEEE 11th international conference on data mining . IEEE, 2011, pp. 497–506
2011
Earlier work this paper cites.
E. Cho, S. A. Myers, and J. Leskovec, “Friendship and mobility: user movement in location-based social networks,” in Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining , 2011, pp. 1082–1090
2011
Earlier work this paper cites.
2012
Earlier work this paper cites.
C. Dwork, A. Roth et al. , “The algorithmic foundations of differential privacy,” Foundations and Trends® in Theoretical Computer Science , vol. 9, no. 3–4, pp. 211–407, 2014
2014
Earlier work this paper cites.
Y. Shi, M. Larson, and A. Hanjalic, “Collaborative filtering beyond the user-item matrix: A survey of the state of the art and future challenges,” ACM Computing Surveys (CSUR) , vol. 47, no. 1, pp. 1–45, 2014
2014
Earlier work this paper cites.
H. Yi, F. Zhang, and J. Lan, “A robust collaborative recommendation algorithm based on k-distance and tukey m-estimator,” China Communications , vol. 11, no. 9, pp. 112–123, 2014
2014
Earlier work this paper cites.
C.-H. Tsai, C.-Y. Lin, and C.-J. Lin, “Incremental and decremental training for linear classification,” in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining , 2014, pp. 343–352
2014
Earlier work this paper cites.
M. Fredrikson, S. Jha, and T. Ristenpart, “Model inversion attacks that exploit confidence information and basic countermeasures,” in Proceedings of the 22nd ACM SIGSAC conference on computer and communications security , 2015, pp. 1322–1333
2015
Earlier work this paper cites.
S. Sedhain, A. K. Menon, S. Sanner, and L. Xie, “Autorec: Autoencoders meet collaborative filtering,” in Proceedings of the 24th international conference on World Wide Web , 2015, pp. 111–112
2015
Earlier work this paper cites.
Y. Cao and J. Yang, “Towards making systems forget with machine unlearning,” in 2015 IEEE symposium on security and privacy . IEEE, 2015, pp. 463–480
2015
Earlier work this paper cites.
F. M. Harper and J. A. Konstan, “The movielens datasets: History and context,” Acm transactions on interactive intelligent systems (tiis) , vol. 5, no. 4, pp. 1–19, 2015
2015
Earlier work this paper cites.
B. Li, Y. Wang, A. Singh, and Y. Vorobeychik, “Data poisoning attacks on factorization-based collaborative filtering,” Advances in neural information processing systems , vol. 29, 2016
2016
Earlier work this paper cites.
Z. Izzo, M. A. Smart, K. Chaudhuri, and J. Zou, “Approximate data deletion from machine learning models,” in International Conference on Artificial Intelligence and Statistics . PMLR, 2021, pp. 2008–2016
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
X. He, L. Liao, H. Zhang, L. Nie, X. Hu, and T.-S. Chua, “Neural collaborative filtering,” in Proceedings of the 26th international conference on world wide web , 2017, pp. 173–182
2017
Cited alongside, same era.
P. W. Koh and P. Liang, “Understanding black-box predictions via influence functions,” in International conference on machine learning . PMLR, 2017, pp. 1885–1894
2017
Cited alongside, same era.
R. Shokri, M. Stronati, C. Song, and V. Shmatikov, “Membership inference attacks against machine learning models,” in 2017 IEEE symposium on security and privacy (SP) . IEEE, 2017, pp. 3–18
2017
Cited alongside, same era.
M. Jagielski, A. Oprea, B. Biggio, C. Liu, C. Nita-Rotaru, and B. Li, “Manipulating machine learning: Poisoning attacks and countermeasures for regression learning,” in 2018 IEEE symposium on security and privacy (SP) . IEEE, 2018, pp. 19–35
2018
Cited alongside, same era.
Y. Shen, Y. Wu, Y. Zhang, C. Shan, J. Zhang, B. K. Letaief, and D. Li, “How powerful is graph convolution for recommendation?” in Proceedings of the 30th ACM international conference on information & knowledge management , 2021, pp. 1619–1629
2021
Later among the works it cites.
Y. Koren, S. Rendle, and R. Bell, “Advances in collaborative filtering,” Recommender systems handbook , pp. 91–142, 2021
2021
Later among the works it cites.
S. Schelter, S. Grafberger, and T. Dunning, “Hedgecut: Maintaining randomised trees for low-latency machine unlearning,” in Proceedings of the 2021 International Conference on Management of Data , 2021, pp. 1545–1557
2021
Later among the works it cites.
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
N. Carlini, C. Liu, Ú. Erlingsson, J. Kos, and D. Song, “The secret sharer: Evaluating and testing unintended memorization in neural networks,” in 28th USENIX Security Symposium (USENIX Security 19) , 2019, pp. 267–284
2019
Cited alongside, same era.
H. Steck, “Embarrassingly shallow autoencoders for sparse data,” in The World Wide Web Conference , 2019, pp. 3251–3257
2019
Cited alongside, same era.
X. Wang, X. He, M. Wang, F. Feng, and T.-S. Chua, “Neural graph collaborative filtering,” in Proceedings of the 42nd international ACM SIGIR conference on Research and development in Information Retrieval , 2019, pp. 165–174
2019
Cited alongside, same era.
2019
Cited alongside, same era.
A. Ginart, M. Guan, G. Valiant, and J. Y. Zou, “Making ai forget you: Data deletion in machine learning,” Advances in neural information processing systems , vol. 32, 2019
2019
Cited alongside, same era.
P. W. W. Koh, K.-S. Ang, H. Teo, and P. S. Liang, “On the accuracy of influence functions for measuring group effects,” Advances in neural information processing systems , vol. 32, 2019
2019
Cited alongside, same era.
W. Cheng, Y. Shen, L. Huang, and Y. Zhu, “Incorporating interpretability into latent factor models via fast influence analysis,” in Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2019, pp. 885–893
2019
Cited alongside, same era.
S. Neel, A. Roth, and S. Sharifi-Malvajerdi, “Descent-to-delete: Gradient-based methods for machine unlearning,” in Algorithmic Learning Theory . PMLR, 2021, pp. 931–962
2021
Later among the works it cites.
C. Wu, D. Lian, Y. Ge, Z. Zhu, and E. Chen, “Triple adversarial learning for influence based poisoning attack in recommender systems,” in Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining , 2021, pp. 1830–1840
2021
Later among the works it cites.
2021
Later among the works it cites.
A. Sekhari, J. Acharya, G. Kamath, and A. T. Suresh, “Remember what you want to forget: Algorithms for machine unlearning,” Advances in Neural Information Processing Systems , vol. 34, pp. 18 075–18 086, 2021
2021
Later among the works it cites.
D. Yu, H. Zhang, W. Chen, J. Yin, and T.-Y. Liu, “How does data augmentation affect privacy in machine learning?” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 35, no. 12, 2021, pp. 10 746–10 753
2021
Later among the works it cites.
C. Chen, F. Sun, M. Zhang, and B. Ding, “Recommendation unlearning,” in Proceedings of the ACM Web Conference 2022 , 2022, pp. 2768–2777
2022
Later among the works it cites.
2022
Later among the works it cites.
J. Liu, D. Li, H. Gu, T. Lu, P. Zhang, and N. Gu, “Parameter-free dynamic graph embedding for link prediction,” Advances in Neural Information Processing Systems , vol. 35, pp. 27 623–27 635, 2022
2022
Later among the works it cites.
J. Xia, D. Li, H. Gu, J. Liu, T. Lu, and N. Gu, “Fire: Fast incremental recommendation with graph signal processing,” in Proceedings of the ACM Web Conference 2022 , 2022, pp. 2360–2369
2022
Later among the works it cites.
T. Baumhauer, P. Schöttle, and M. Zeppelzauer, “Machine unlearning: Linear filtration for logit-based classifiers,” Machine Learning , vol. 111, no. 9, pp. 3203–3226, 2022
2022
Later among the works it cites.
M. Chen, Z. Zhang, T. Wang, M. Backes, M. Humbert, and Y. Zhang, “Graph unlearning,” in Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security , 2022, pp. 499–513
2022
Later among the works it cites.
H. Yan, X. Li, Z. Guo, H. Li, F. Li, and X. Lin, “Arcane: An efficient architecture for exact machine unlearning,” in Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22 , 2022, pp. 4006–4013
2022
Later among the works it cites.
2022
Later among the works it cites.
G. Wu, M. Hashemi, and C. Srinivasa, “Puma: Performance unchanged model augmentation for training data removal,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 36, no. 8, 2022, pp. 8675–8682
2022
Later among the works it cites.
R. Mehta, S. Pal, V. Singh, and S. N. Ravi, “Deep unlearning via randomized conditionally independent hessians,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2022, pp. 10 422–10 431
2022
Later among the works it cites.
J. Zhu, Q. Dai, L. Su, R. Ma, J. Liu, G. Cai, X. Xiao, and R. Zhang, “Bars: Towards open benchmarking for recommender systems,” in Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval , 2022, pp. 2912–2923
2022
Later among the works it cites.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
J. Liu, D. Li, H. Gu, T. Lu, P. Zhang, L. Shang, and N. Gu, “Personalized graph signal processing for collaborative filtering,” in Proceedings of the ACM Web Conference 2023 , 2023, pp. 1264–1272
2023
Closest in time.
W. Yuan, H. Yin, F. Wu, S. Zhang, T. He, and H. Wang, “Federated unlearning for on-device recommendation,” in Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining , 2023, pp. 393–401
2023
Closest in time.
2023
Closest in time.
S. Ji, Y. Feng, R. Ji, X. Zhao, W. Tang, and Y. Gao, “Dual channel hypergraph collaborative filtering,” in Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining , 2020, pp. 2020–2029
2029
Closest in time.