{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T15:55:57Z","timestamp":1774540557466,"version":"3.50.1"},"reference-count":72,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T00:00:00Z","timestamp":1705017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,4,30]]},"abstract":"<jats:p>Non-negative matrix factorization is a popular unsupervised machine learning algorithm for extracting meaningful features from inherently non-negative data. Such data often contain privacy-sensitive user information. Additionally, the dataset can contain outliers, which may lead to extracting sub-optimal features from the data. It is, therefore, necessary to address these two issues while analyzing privacy-sensitive data that may contain outliers. In this work, we develop a non-negative matrix factorization algorithm in the privacy-preserving framework that (i) considers the presence of outliers in the data, and (ii) can achieve results comparable to those of the non-private algorithm. We design our method in such a way that one has the control to select the degree of privacy grantee based on the required utility gap. We show the effectiveness of our proposed algorithm\u2019s performance on six real and diverse datasets. The experimental results show that our proposed method can achieve a performance that closely approximates the performance of the non-private algorithm under some parameter choices, while ensuring strict privacy guarantees.<\/jats:p>","DOI":"10.1145\/3632961","type":"journal-article","created":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T11:56:02Z","timestamp":1700135762000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Privacy-Preserving Non-Negative Matrix Factorization with Outliers"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0614-4131","authenticated-orcid":false,"given":"Swapnil","family":"Saha","sequence":"first","affiliation":[{"name":"Department of Electrical and Electronic Engineering, Bangladesh University of Engineering and Technology, Bangladesh"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2042-5941","authenticated-orcid":false,"given":"Hafiz","family":"Imtiaz","sequence":"additional","affiliation":[{"name":"Department of Electrical and Electronic Engineering, Bangladesh University of Engineering and Technology, Bangladesh"}]}],"member":"320","published-online":{"date-parts":[[2024,1,12]]},"reference":[{"key":"e_1_3_4_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"e_1_3_4_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/EICT48899.2019.9068846"},{"key":"e_1_3_4_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/MMSP48831.2020.9287113"},{"key":"e_1_3_4_5_2","first-page":"17455","article-title":"Differentially private learning with adaptive clipping","volume":"34","author":"Andrew Galen","year":"2021","unstructured":"Galen Andrew, Om Thakkar, Brendan McMahan, and Swaroop Ramaswamy. 2021. Differentially private learning with adaptive clipping. In Advances in Neural Information Processing Systems, M. Ranzato, A. Beygelzimer, Y. Dauphin, P. S. Liang, and J. Wortman Vaughan (Eds.). Vol. 34, 17455\u201317466. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2021\/file\/91cff01af640a24e7f9f7a5ab407889f-Paper.pdf","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.56"},{"key":"e_1_3_4_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345576"},{"key":"e_1_3_4_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/2792838.2800173"},{"key":"e_1_3_4_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/2133806.2133826"},{"key":"e_1_3_4_10_2","first-page":"9","volume-title":"On-line Learning in Neural Networks","author":"Bottou L\u00e9on","year":"1998","unstructured":"L\u00e9on Bottou. 1998. On-line learning in neural networks. In On-line Learning in Neural Networks, David Saad (Ed.). Cambridge University Press, New York, NY, USA, Chapter On-line Learning and Stochastic Approximations, 9\u201342. Retrieved fromhttp:\/\/dl.acm.org\/citation.cfm?id=304710.304720"},{"key":"e_1_3_4_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2007.09.010"},{"key":"e_1_3_4_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408965"},{"key":"e_1_3_4_13_2","article-title":"Privacy-preserving logistic regression","volume":"21","author":"Chaudhuri Kamalika","year":"2008","unstructured":"Kamalika Chaudhuri and Claire Monteleoni. 2008. Privacy-preserving logistic regression. In Advances in Neural Information Processing Systems, D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou (Eds.). Vol. 21, Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2008\/file\/8065d07da4a77621450aa84fee5656d9-Paper.pdf","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"3","key":"e_1_3_4_14_2","article-title":"Differentially private empirical risk minimization.","volume":"12","author":"Chaudhuri Kamalika","year":"2011","unstructured":"Kamalika Chaudhuri, Claire Monteleoni, and Anand D. Sarwate. 2011. Differentially private empirical risk minimization. Journal of Machine Learning Research 12, 3 (2011), 1069\u20131109.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_4_15_2","article-title":"A near-optimal algorithm for differentially-private principal components.","volume":"14","author":"Chaudhuri Kamalika","year":"2013","unstructured":"Kamalika Chaudhuri, Anand D. Sarwate, and Kaushik Sinha. 2013. A near-optimal algorithm for differentially-private principal components. Journal of Machine Learning Research 14, 1 (2013), 2905\u20132943.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_4_16_2","first-page":"57","volume-title":"Proceedings of the DARPA Broadcast News Workshop","year":"1999","unstructured":"David Graff, Chris Cieri, Stephanie Strassel, and Nii Martey. 1999. The TDT-2 text and speech corpus. In Proceedings of the DARPA Broadcast News Workshop. 57\u201360."},{"key":"e_1_3_4_17_2","unstructured":"Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. Retrieved from http:\/\/archive.ics.uci.edu\/ml"},{"key":"e_1_3_4_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_4_19_2","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"e_1_3_4_20_2","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.v1i2.570"},{"key":"e_1_3_4_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3372408"},{"key":"e_1_3_4_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2468177"},{"key":"e_1_3_4_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813677"},{"key":"e_1_3_4_24_2","article-title":"Cloud-based outsourcing for enabling privacy-preserving large-scale non-negative matrix factorization","author":"Fu Anmin","year":"2019","unstructured":"Anmin Fu, Zhenzhu Chen, Yi Mu, Willy Susilo, Yinxia Sun, and Jie Wu. 2019. Cloud-based outsourcing for enabling privacy-preserving large-scale non-negative matrix factorization. IEEE Transactions on Services Computing 15, 1 (2019), 266\u2013278.","journal-title":"IEEE Transactions on Services Computing"},{"key":"e_1_3_4_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806568"},{"key":"e_1_3_4_26_2","article-title":"Nonnegative matrix factorization: Complexity, algorithms and applications","author":"Gillis Nicolas","year":"2011","unstructured":"Nicolas Gillis. 2011. Nonnegative matrix factorization: Complexity, algorithms and applications. Unpublished Doctoral Dissertation, Universit\u00e9 Catholique de Louvain. Louvain-La-Neuve: CORE (2011).","journal-title":"Unpublished Doctoral Dissertation, Universit\u00e9 Catholique de Louvain. Louvain-La-Neuve: CORE"},{"key":"e_1_3_4_27_2","article-title":"Accelerating the lee-seung algorithm for non-negative matrix factorization","author":"Gonzalez Edward F.","year":"2005","unstructured":"Edward F. Gonzalez and Yin Zhang. 2005. Accelerating the lee-seung algorithm for non-negative matrix factorization. Dept. Comput. & Appl. Math., Rice Univ., Houston, TX, Tech. Rep. TR-05-02 (2005).","journal-title":"Dept. Comput. & Appl. Math., Rice Univ., Houston, TX, Tech. Rep. TR-05-02"},{"key":"e_1_3_4_28_2","article-title":"Movielens data set","volume":"19","author":"Harper F. M.","year":"2006","unstructured":"F. M. Harper and J. A. Konstan. 2006. Movielens data set. ACM Trans Interact Intell Syst, 2016, 5: 1 19 (2006).","journal-title":"ACM Trans Interact Intell Syst, 2016, 5: 1"},{"key":"e_1_3_4_29_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pgen.1000167"},{"issue":"9","key":"e_1_3_4_30_2","article-title":"Non-negative matrix factorization with sparseness constraints.","volume":"5","author":"Hoyer Patrik O.","year":"2004","unstructured":"Patrik O. Hoyer. 2004. Non-negative matrix factorization with sparseness constraints. Journal of Machine Learning Research 5, 9 (2004), 1457\u20131469.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_4_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3523273"},{"key":"e_1_3_4_32_2","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence","author":"Hua Jingyu","year":"2015","unstructured":"Jingyu Hua, Chang Xia, and Sheng Zhong. 2015. Differentially private matrix factorization. In Proceedings of the International Joint Conference on Artificial Intelligence."},{"key":"e_1_3_4_33_2","unstructured":"Zhanglong Ji Zachary C. Lipton and Charles Elkan. 2014. Differential privacy and machine learning: A survey and review. arXiv:1412.7584. Retrieved from https:\/\/arxiv.org\/abs\/1412.7584"},{"key":"e_1_3_4_34_2","doi-asserted-by":"publisher","DOI":"10.1137\/07069239X"},{"key":"e_1_3_4_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-013-0035-4"},{"key":"e_1_3_4_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.149"},{"key":"e_1_3_4_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063676"},{"issue":"2","key":"e_1_3_4_38_2","first-page":"341","article-title":"Differentially private filtering","volume":"59","author":"Ny Jerome Le","year":"2013","unstructured":"Jerome Le Ny and George J. Pappas. 2013. Differentially private filtering. IEEE Transactions on Automatic Control 59, 2 (2013), 341\u2013354.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"e_1_3_4_39_2","volume-title":"Advances in Neural Information Processing Systems","author":"Lee Daniel","year":"2001","unstructured":"Daniel Lee and H. Sebastian Seung. 2001. Algorithms for non-negative matrix factorization. In Advances in Neural Information Processing Systems. T. Leen, T. Dietterich, and V. Tresp (Eds.), Vol. 13. MIT Press. Retrieved from https:\/\/proceedings.neurips.cc\/paper\/2000\/file\/f9d1152547c0bde01830b7e8bd60024c-Paper.pdf"},{"key":"e_1_3_4_40_2","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1005345"},{"key":"e_1_3_4_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2794384"},{"key":"e_1_3_4_42_2","article-title":"Accuracy first: Selecting a differential privacy level for accuracy constrained ERM","volume":"30","author":"Ligett Katrina","year":"2017","unstructured":"Katrina Ligett, Seth Neel, Aaron Roth, Bo Waggoner, and Steven Z. Wu. 2017. Accuracy first: Selecting a differential privacy level for accuracy constrained ERM. In Advances in Neural Information Processing Systems. I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Eds.). Vol. 30, Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2017\/file\/86df7dcfd896fcaf2674f757a2463eba-Paper.pdf","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2007.895831"},{"key":"e_1_3_4_44_2","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.10.2756"},{"key":"e_1_3_4_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/2792838.2800191"},{"key":"e_1_3_4_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.66"},{"key":"e_1_3_4_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.11"},{"key":"e_1_3_4_48_2","unstructured":"Arvind Narayanan and Vitaly Shmatikov. 2006. How to break anonymity of the netflix prize dataset. arXiv:cs\/0610105. Retrieved from https:\/\/arxiv.org\/abs\/cs\/0610105"},{"key":"e_1_3_4_49_2","volume-title":"Programming Differential Privacy","author":"Near Joseph P.","year":"2021","unstructured":"Joseph P. Near and Chik\u00e9 Abuah. 2021. Programming Differential Privacy. Vol. 1. Retrieved from https:\/\/uvm-plaid.github.io\/programming-dp\/"},{"key":"e_1_3_4_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516751"},{"key":"e_1_3_4_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250803"},{"key":"e_1_3_4_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2016.2614100"},{"key":"e_1_3_4_53_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.02.055"},{"issue":"15","key":"e_1_3_4_54_2","first-page":"510","article-title":"The matrix cookbook","volume":"7","author":"Petersen Kaare Brandt","year":"2008","unstructured":"Kaare Brandt Petersen and Michael Syskind Pedersen. 2008. The matrix cookbook. Technical University of Denmark 7, 15 (2008), 510.","journal-title":"Technical University of Denmark"},{"key":"e_1_3_4_55_2","article-title":"Fast and secure distributed nonnegative matrix factorization","author":"Qian Yuqiu","year":"2020","unstructured":"Yuqiu Qian, Conghui Tan, Danhao Ding, Hui Li, and Nikos Mamoulis. 2020. Fast and secure distributed nonnegative matrix factorization. IEEE Transactions on Knowledge and Data Engineering 34, 2 (2020), 653\u2013666.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_4_56_2","first-page":"29","volume-title":"Proceedings of the 1st Instructional Conference on Machine Learning","volume":"242","author":"Ramos Juan","year":"2003","unstructured":"Juan Ramos. 2003. Using tf-idf to determine word relevance in document queries. In Proceedings of the 1st Instructional Conference on Machine Learning, Vol. 242. Citeseer, 29\u201348."},{"key":"e_1_3_4_57_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.01.079"},{"key":"e_1_3_4_58_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.01.050"},{"key":"e_1_3_4_59_2","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(88)90021-0"},{"key":"e_1_3_4_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2014.7026069"},{"key":"e_1_3_4_61_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.41"},{"key":"e_1_3_4_62_2","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2013.6736861"},{"issue":"9","key":"e_1_3_4_63_2","first-page":"29","article-title":"Only you, your doctor, and many others may know","volume":"2015092903","author":"Sweeney Latanya","year":"2015","unstructured":"Latanya Sweeney. 2015. Only you, your doctor, and many others may know. Technology Science 2015092903, 9 (2015), 29.","journal-title":"Technology Science"},{"key":"e_1_3_4_64_2","article-title":"Differentially private empirical risk minimization revisited: Faster and more general","volume":"30","author":"Wang Di","year":"2017","unstructured":"Di Wang, Minwei Ye, and Jinhui Xu. 2017. Differentially private empirical risk minimization revisited: Faster and more general. In Advances in Neural Information Processing Systems, I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Eds.). Vol. 30, Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2017\/file\/f337d999d9ad116a7b4f3d409fcc6480-Paper.pdf","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_65_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.51"},{"key":"e_1_3_4_66_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2004.315"},{"key":"e_1_3_4_67_2","article-title":"Robust asymmetric nonnegative matrix factorization","author":"Woo Hyenkyun","year":"2014","unstructured":"Hyenkyun Woo and Haesun Park. 2014. Robust asymmetric nonnegative matrix factorization. Computational and Applied Mathematics Reports, University of California, USA 2 (2014).","journal-title":"Computational and Applied Mathematics Reports, University of California, USA"},{"key":"e_1_3_4_68_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-012-0194-5"},{"key":"e_1_3_4_69_2","unstructured":"Yale. 2001. The extended yale face database B. (2001). Retrieved from http:\/\/vision.ucsd.edu\/iskwak\/ExtYaleDatabase\/ExtYaleB.html"},{"key":"e_1_3_4_70_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.07.070"},{"key":"e_1_3_4_71_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11460-011-0128-0"},{"key":"e_1_3_4_72_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2620967"},{"key":"e_1_3_4_73_2","article-title":"Deep leakage from gradients","volume":"32","author":"Zhu Ligeng","year":"2019","unstructured":"Ligeng Zhu, Zhijian Liu, and Song Han. 2019. Deep leakage from gradients. In Advances in Neural Information Processing Systems, H. Wallach, H. Larochelle, A. Beygelzimer, F. d\u2019Alch\u00e9-Buc, E. Fox, and R. Garnett. Vol. 32, Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2019\/file\/60a6c4002cc7b29142def8871531281a-Paper.pdf","journal-title":"Advances in Neural Information Processing Systems"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3632961","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3632961","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:35:50Z","timestamp":1750178150000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3632961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,12]]},"references-count":72,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,4,30]]}},"alternative-id":["10.1145\/3632961"],"URL":"https:\/\/doi.org\/10.1145\/3632961","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,12]]},"assertion":[{"value":"2023-03-19","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-11-02","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}