{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:41Z","timestamp":1750219841030,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100004489","name":"Mitacs","doi-asserted-by":"publisher","id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100004489","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/100008794","name":"Research Manitoba","doi-asserted-by":"publisher","id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/100008794","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/100010318","name":"University of Manitoba","doi-asserted-by":"publisher","id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/100010318","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,6]]},"DOI":"10.1145\/3625007.3627338","type":"proceedings-article","created":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T15:12:42Z","timestamp":1710515562000},"page":"735-744","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Personalized privacy-preserving semi-centralized recommendation system in a social network"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7541-9127","authenticated-orcid":false,"given":"Carson K.","family":"Leung","sequence":"first","affiliation":[{"name":"University of Manitoba, Winnipeg, MB, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-2579-0726","authenticated-orcid":false,"given":"Qi","family":"Wen","sequence":"additional","affiliation":[{"name":"University of Manitoba, Winnipeg, MB, Canada"}]}],"member":"320","published-online":{"date-parts":[[2024,3,15]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1027","article-title":"AI robo-advisor with big data analytics for financial services","volume":"2018","author":"Day M.","unstructured":"M. Day, et al., \"AI robo-advisor with big data analytics for financial services,\" IEEE\/ACM ASONAM 2018, 1027--1031.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_2_1","first-page":"741","article-title":"Flexible compression of big data","volume":"2019","author":"Leung C.K.","unstructured":"C.K. Leung, et al., \"Flexible compression of big data,\" IEEE\/ACM ASONAM 2019, 741--748.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_3_1","first-page":"710","article-title":"Recent trends in emotion analysis: a big data analysis perspective","volume":"2020","author":"Ozyer T.","unstructured":"T. Ozyer, et al., \"Recent trends in emotion analysis: a big data analysis perspective,\" IEEE\/ACM ASONAM 2020, 710--714.","journal-title":"IEEE\/ACM ASONAM"},{"issue":"6","key":"e_1_3_2_1_4_1","first-page":"2154","article-title":"Mobile web navigation in digital ecosystems using rooted directed trees","volume":"58","author":"Lee W.","year":"2011","unstructured":"W. Lee, et al., \"Mobile web navigation in digital ecosystems using rooted directed trees,\" IEEE TIE 58(6), 2154--2162, 2011.","journal-title":"IEEE TIE"},{"key":"e_1_3_2_1_5_1","first-page":"545","article-title":"Compressing and mining social network data","volume":"2021","author":"Hryhoruk C.J.","unstructured":"C.C.J. Hryhoruk, C.K. Leung, \"Compressing and mining social network data,\" IEEE\/ACM ASONAM 2021, 545--552.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_6_1","first-page":"17","article-title":"Effects of ego networks and communities on self-disclosure in an online social network","volume":"2019","author":"Kwon Y.D.","unstructured":"Y.D. Kwon, et al., \"Effects of ego networks and communities on self-disclosure in an online social network,\" IEEE\/ACM ASONAM 2019, 17--24.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_7_1","first-page":"659","article-title":"Compression for very sparse big social data","volume":"2020","author":"Leung C.K.","unstructured":"C.K. Leung, et al., \"Compression for very sparse big social data,\" IEEE\/ACM ASONAM 2020, 659--666.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_8_1","first-page":"916","article-title":"Mining 'following' patterns from big but sparsely distributed social network data","volume":"2018","author":"Leung C.K.","unstructured":"C.K. Leung, et al., \"Mining 'following' patterns from big but sparsely distributed social network data,\" IEEE\/ACM ASONAM 2018, 916--919.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_9_1","first-page":"923","article-title":"Mining 'following' patterns from big sparse social networks","volume":"2016","author":"Leung C.K.","unstructured":"C.K. Leung, et al., \"Mining 'following' patterns from big sparse social networks,\" IEEE\/ACM ASONAM 2016, 923--930.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_10_1","first-page":"1025","article-title":"Efficient mining of 'following' patterns from very big but sparse social networks","volume":"2017","author":"Leung C.K.","unstructured":"C.K. Leung, F. Jiang, \"Efficient mining of 'following' patterns from very big but sparse social networks,\" IEEE\/ACM ASONAM 2017, 1025--1032.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_11_1","first-page":"202","article-title":"Causal analysis on the anchor store effect in a location-based social network","volume":"2022","author":"Vallapuram A.K.","unstructured":"A.K. Vallapuram, et al., \"Causal analysis on the anchor store effect in a location-based social network,\" IEEE\/ACM ASONAM 2022, 202--209.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_12_1","first-page":"925","article-title":"A data science and engineering solution for fast k-means clustering of big data","volume":"2017","author":"Dierckens K.E.","unstructured":"K.E. Dierckens, et al., \"A data science and engineering solution for fast k-means clustering of big data,\" IEEE TrustCom-BigDataSE-ICESS 2017, 925--932.","journal-title":"IEEE TrustCom-BigDataSE-ICESS"},{"key":"e_1_3_2_1_13_1","volume-title":"Jiang: Frequent pattern mining from time-fading streams of uncertain data,\" DaWaK","author":"Leung C.K.","year":"2011","unstructured":"C.K. Leung, F. Jiang: Frequent pattern mining from time-fading streams of uncertain data,\" DaWaK 2011, 252--264."},{"key":"e_1_3_2_1_14_1","first-page":"540","article-title":"Approximating 4-cliques in streaming graphs: the power of dual sampling","volume":"2021","author":"Mann A.","unstructured":"A. Mann, et al., \"Approximating 4-cliques in streaming graphs: the power of dual sampling,\" IEEE\/ACM ASONAM 2021, 540--544.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_15_1","first-page":"76","article-title":"DMNP: a deep learning approach for missing node prediction in partially observed graphs","volume":"2022","author":"Faez F.","unstructured":"F. Faez, et al., \"DMNP: a deep learning approach for missing node prediction in partially observed graphs,\" IEEE\/ACM ASONAM 2022, 76--79.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_16_1","first-page":"569","article-title":"A mathematical model for friend discovery from dynamic social graphs","volume":"2021","author":"Leung C.K.","unstructured":"C.K. Leung, S.P. Singh, \"A mathematical model for friend discovery from dynamic social graphs,\" IEEE\/ACM ASONAM 2021, 569--576.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_17_1","first-page":"60","article-title":"Embedding social graphs from multiple national settings in common empirical opinion spaces","volume":"2022","author":"Ramaciotti P.","unstructured":"P. Ramaciotti, Z. Vagena, \"Embedding social graphs from multiple national settings in common empirical opinion spaces,\" IEEE\/ACM ASONAM 2022, 60--67.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM49781.2020.9381341"},{"key":"e_1_3_2_1_19_1","first-page":"421","article-title":"Text mining with information extraction for Chinese financial knowledge graph","volume":"2022","author":"Teng Y.","unstructured":"Y. Teng, et al., \"Text mining with information extraction for Chinese financial knowledge graph,\" IEEE\/ACM ASONAM 2022, 421--426.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_20_1","first-page":"1","article-title":"Efficient analytical computation of expected frequency of motifs of small size by marginalization in uncertain network","volume":"2021","author":"Fushimi T.","unstructured":"T. Fushimi, et al., \"Efficient analytical computation of expected frequency of motifs of small size by marginalization in uncertain network,\" IEEE\/ACM ASONAM 2021, 1--8.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_21_1","volume-title":"Tanbeer: Fast tree-based mining of frequent itemsets from uncertain data,\" DASFAA","author":"Leung C.K.","year":"2012","unstructured":"C.K. Leung, S.K. Tanbeer: Fast tree-based mining of frequent itemsets from uncertain data,\" DASFAA 2012, Part I, 272--287."},{"key":"e_1_3_2_1_22_1","first-page":"913","article-title":"DeepGx: deep learning using gene expression for cancer classification","volume":"2019","author":"de Guia J.","unstructured":"J. de Guia, et al., \"DeepGx: deep learning using gene expression for cancer classification,\" IEEE\/ACM ASONAM 2019, 913--920.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_23_1","first-page":"415","article-title":"Big data visualization and visual analytics of COVID-19 data","volume":"2020","author":"Leung C.K.","unstructured":"C.K. Leung, et al., \"Big data visualization and visual analytics of COVID-19 data,\" IV 2020, 415--420.","journal-title":"IV"},{"key":"e_1_3_2_1_24_1","first-page":"5118","article-title":"Machine learning and OLAP on big COVID-19 data","volume":"2020","author":"Leung C.K.","unstructured":"C.K. Leung, et al., \"Machine learning and OLAP on big COVID-19 data,\" IEEE BigData 2020, 5118--5127.","journal-title":"IEEE BigData"},{"key":"e_1_3_2_1_25_1","first-page":"24","article-title":"Urban analytics of big transportation data for supporting smart cities","volume":"2019","author":"Leung C.K.","unstructured":"C.K. Leung, et al., \"Urban analytics of big transportation data for supporting smart cities,\" DaWaK 2019, 24--33.","journal-title":"DaWaK"},{"key":"e_1_3_2_1_26_1","first-page":"570","article-title":"NetDriller-V3: a powerful social network analysis tool","volume":"2022","author":"Afra S.","unstructured":"S. Afra, et al., \"NetDriller-V3: a powerful social network analysis tool,\" IEEE\/ACM ASONAM 2022, 570--574.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_27_1","first-page":"324","article-title":"Social network analysis on interpretable compressed sparse networks","volume":"2022","author":"Hryhoruk C.J.","unstructured":"C.C.J. Hryhoruk, C.K. Leung, \"Social network analysis on interpretable compressed sparse networks,\" IEEE\/ACM ASONAM 2022, 324--331.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_28_1","first-page":"19","article-title":"A personalized food recommendation chatbot system for diabetes patients","volume":"2020","author":"Thongyoo P.","unstructured":"P. Thongyoo, et al., \"A personalized food recommendation chatbot system for diabetes patients,\" CDVE 2020, 19--28.","journal-title":"CDVE"},{"key":"e_1_3_2_1_29_1","first-page":"824","article-title":"Finding strong groups of friends among friends in social networks","volume":"2011","author":"Cameron J.J.","unstructured":"J.J. Cameron, et al., \"Finding strong groups of friends among friends in social networks,\" IEEE DASC 2011, 824--831.","journal-title":"IEEE DASC"},{"key":"e_1_3_2_1_30_1","first-page":"833","article-title":"Social network mining for recommendation of friends based on music interests","volume":"2018","author":"Fan C.","unstructured":"C. Fan, et al., \"Social network mining for recommendation of friends based on music interests,\" IEEE\/ACM ASONAM 2018, 833--840.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_31_1","first-page":"921","article-title":"Big data mining of social networks for friend recommendation","volume":"2016","author":"Jiang F.","unstructured":"F. Jiang, et al., \"Big data mining of social networks for friend recommendation,\" IEEE\/ACM ASONAM 2016, 921--922.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","DOI":"10.1080\/10919392.2014.896715","article-title":"Interactive mining of strong friends from social networks and its applications in e-commerce","author":"Tanbeer S.K.","year":"2014","unstructured":"S.K. Tanbeer, et al., \"Interactive mining of strong friends from social networks and its applications in e-commerce,\" J. Organ. Comput. Electron. Commer. 24(2--3), 157--173, 2014.","journal-title":"J. Organ. Comput. Electron. Commer. 24(2--3), 157--173"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2967792"},{"key":"e_1_3_2_1_34_1","volume-title":"Leung: Social media mining: prediction of box office revenue,\" IDEAS","author":"Choudhery D.","year":"2017","unstructured":"D. Choudhery, C.K. Leung: Social media mining: prediction of box office revenue,\" IDEAS 2017, 20--29."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-016-0400-0"},{"key":"e_1_3_2_1_36_1","first-page":"303","article-title":"Social network analysis of popular YouTube videos via vertical quantitative mining","volume":"2022","author":"Pazdor G.M.","unstructured":"A.G.M. Pazdor, et al., \"Social network analysis of popular YouTube videos via vertical quantitative mining,\" IEEE\/ACM ASONAM 2022, 303--307.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_37_1","first-page":"157","article-title":"A user-centric evaluation framework for recommender systems","volume":"2011","author":"Pu P.","unstructured":"P. Pu, et al., \"A user-centric evaluation framework for recommender systems,\" ACM RecSys 2011, 157--164.","journal-title":"ACM RecSys"},{"key":"e_1_3_2_1_38_1","first-page":"14","article-title":"Do you trust your recommendations? An exploration of security and privacy issues in recommender systems","volume":"2006","author":"Lam S.K.","unstructured":"S.K. Lam, et al., \"Do you trust your recommendations? An exploration of security and privacy issues in recommender systems,\" ETRICS 2006, 14--29.","journal-title":"ETRICS"},{"key":"e_1_3_2_1_39_1","first-page":"111","article-title":"Robust de-anonymization of large sparse datasets","volume":"2008","author":"Narayanan A.","unstructured":"A. Narayanan, V. Shmatikov, \"Robust de-anonymization of large sparse datasets,\" IEEE SP 2008, 111--125.","journal-title":"IEEE SP"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10639-019-10063-9"},{"issue":"6","key":"e_1_3_2_1_41_1","first-page":"6387","article-title":"Optimized machine learning based collaborative filtering (OMLCF) recommendation system in e-commerce","volume":"12","author":"Anitha J.","year":"2020","unstructured":"J. Anitha, M. Kalaiarasu, \"Optimized machine learning based collaborative filtering (OMLCF) recommendation system in e-commerce,\" JAIHC 12(6), 6387--6398, 2020.","journal-title":"JAIHC"},{"key":"e_1_3_2_1_42_1","first-page":"304","article-title":"Machine learning-based recommendation system for disease-drug material and adverse drug reaction: comparative review","volume":"51","author":"Tiwari K.","year":"2022","unstructured":"K. Tiwari, D.K. Singh, \"Machine learning-based recommendation system for disease-drug material and adverse drug reaction: comparative review,\" Materials Today: Proceedings 51, Part 1, 304--313, 2022.","journal-title":"Materials Today: Proceedings"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1061222"},{"issue":"4","key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3212509","article-title":"Efficient privacy-preserving matrix factorization for recommendation via fully homomorphic encryption","volume":"21","author":"Kim J.","year":"2018","unstructured":"J. Kim, et al., \"Efficient privacy-preserving matrix factorization for recommendation via fully homomorphic encryption,\" ACM TOPS 21(4), 17:1--17:30, 2018.","journal-title":"ACM TOPS"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"E. Shmueli T. Tassa. 2020 \"Mediated secure multi-party protocols for collaborative filtering ACM TIST 11(2) 1--25 2020.","DOI":"10.1145\/3375402"},{"key":"e_1_3_2_1_46_1","first-page":"332","article-title":"Privacy preserving collaborative filtering by distributed mediation","volume":"2021","author":"Horin A.B.","unstructured":"A.B. Horin, T. Tamir, \"Privacy preserving collaborative filtering by distributed mediation,\" ACM RecSys 2021, 332--341.","journal-title":"ACM RecSys"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11257-016-9177-7"},{"key":"e_1_3_2_1_48_1","first-page":"355","article-title":"Recommender systems with condensed local differential privacy","volume":"2020","author":"Liu A.","unstructured":"A. Liu, et al., \"Recommender systems with condensed local differential privacy,\" ML4CS 2020, 355--365.","journal-title":"ML4CS"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_50_1","volume-title":"ICALP","author":"Dwork C.","year":"2006","unstructured":"C. Dwork, \"Differential privacy,\" ICALP 2006, 1--12."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1965.10480775"},{"key":"e_1_3_2_1_52_1","first-page":"150","article-title":"Global and local differential privacy for collaborative bandits","volume":"2020","author":"Wang H.","unstructured":"H. Wang, et al., \"Global and local differential privacy for collaborative bandits,\" ACM RecSys 2020, 150--159.","journal-title":"ACM RecSys"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.09.060"},{"key":"e_1_3_2_1_54_1","first-page":"2814","article-title":"Efficient-FedRec: efficient federated learning framework for privacy-preserving news recommendation","volume":"2021","author":"Yi J.","year":"2021","unstructured":"J. Yi, et al., \"Efficient-FedRec: efficient federated learning framework for privacy-preserving news recommendation,\" EMNLP 2021, 2814--2824, 2021.","journal-title":"EMNLP"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298981"},{"key":"e_1_3_2_1_56_1","first-page":"821","article-title":"Improving latent factor models via personalized feature projection for one class recommendation","volume":"2015","author":"Zhao T.","unstructured":"T. Zhao, et al., \"Improving latent factor models via personalized feature projection for one class recommendation,\" ACM CIKM 2015, 821--830.","journal-title":"ACM CIKM"},{"key":"e_1_3_2_1_57_1","first-page":"1476","article-title":"SPMC: socially-aware personalized Markov chains for sparse sequential recommendation","volume":"2017","author":"Cai C.","unstructured":"C. Cai, et al., \"SPMC: socially-aware personalized Markov chains for sparse sequential recommendation,\" IJCAI 2017, 1476--1482.","journal-title":"IJCAI"},{"key":"e_1_3_2_1_58_1","first-page":"957","article-title":"PTV: intelligent personalised TV guides","volume":"2000","author":"Cotter P.","unstructured":"P. Cotter, B. Smyth, \"PTV: intelligent personalised TV guides,\" AAAI\/IAAI 2000, 957--964.","journal-title":"AAAI\/IAAI"}],"event":{"name":"ASONAM '23: International Conference on Advances in Social Networks Analysis and Mining","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Kusadasi Turkiye","acronym":"ASONAM '23"},"container-title":["Proceedings of the International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3625007.3627338","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3625007.3627338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:49Z","timestamp":1750178809000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3625007.3627338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,6]]},"references-count":58,"alternative-id":["10.1145\/3625007.3627338","10.1145\/3625007"],"URL":"https:\/\/doi.org\/10.1145\/3625007.3627338","relation":{},"subject":[],"published":{"date-parts":[[2023,11,6]]},"assertion":[{"value":"2024-03-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}