{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T07:30:48Z","timestamp":1778916648214,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010318","name":"University of Manitoba","doi-asserted-by":"publisher","id":[{"id":"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":[[2021,11,8]]},"DOI":"10.1145\/3487351.3489473","type":"proceedings-article","created":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T20:40:12Z","timestamp":1642624812000},"page":"569-576","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["A mathematical model for friend discovery from dynamic social graphs"],"prefix":"10.1145","author":[{"given":"Carson K.","family":"Leung","sequence":"first","affiliation":[{"name":"University of Manitoba, Winnipeg, MB, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sehaj P.","family":"Singh","sequence":"additional","affiliation":[{"name":"University of Manitoba, Winnipeg, MB, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,1,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.3390\/a8041175"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.05.021"},{"key":"e_1_3_2_1_3_1","first-page":"913","article-title":"DeepGx: deep learning using gene expression for cancer classification","author":"De Guia J.","year":"2019","unstructured":"J. De Guia , , \" DeepGx: deep learning using gene expression for cancer classification ,\" in IEEE\/ACM ASONAM 2019 , pp. 913 -- 920 . J. De Guia, et al., \"DeepGx: deep learning using gene expression for cancer classification,\" in IEEE\/ACM ASONAM 2019, pp. 913--920.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_4_1","first-page":"833","article-title":"Social network mining for recommendation of friends based on music interests","author":"Fan C.","year":"2018","unstructured":"C. Fan , , \" Social network mining for recommendation of friends based on music interests ,\" in IEEE\/ACM ASONAM 2018 , pp. 833 -- 840 . C. Fan, et al., \"Social network mining for recommendation of friends based on music interests,\" in IEEE\/ACM ASONAM 2018, pp. 833--840.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_5_1","first-page":"274","article-title":"A machine learning approach for stock price prediction","author":"Leung C.K.","year":"2014","unstructured":"C.K. Leung , , \" A machine learning approach for stock price prediction ,\" in IDEAS 2014 , pp. 274 -- 277 . C.K. Leung, et al., \"A machine learning approach for stock price prediction,\" in IDEAS 2014, pp. 274--277.","journal-title":"IDEAS"},{"key":"e_1_3_2_1_6_1","first-page":"235","article-title":"A data science solution for mining interesting patterns from uncertain big data","author":"Leung C.K.","year":"2014","unstructured":"C.K. Leung , F. Jiang , \" A data science solution for mining interesting patterns from uncertain big data ,\" in IEEE BDCloud 2014 , pp. 235 -- 242 . C.K. Leung, F. Jiang, \"A data science solution for mining interesting patterns from uncertain big data,\" in IEEE BDCloud 2014, pp. 235--242.","journal-title":"IEEE BDCloud"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2017.08.141"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-5225-2255-3.ch030"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/380995.381005"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-8265-9_170"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.02.028"},{"key":"e_1_3_2_1_12_1","first-page":"417","article-title":"Uncertain frequent pattern mining","author":"Leung C.K.","year":"2014","unstructured":"C.K. Leung , \" Uncertain frequent pattern mining ,\" in Frequent Pattern Mining , 2014 , pp. 417 -- 453 . C.K. Leung, \"Uncertain frequent pattern mining,\" in Frequent Pattern Mining, 2014, pp. 417--453.","journal-title":"Frequent Pattern Mining"},{"key":"e_1_3_2_1_13_1","first-page":"893","article-title":"Fast algorithms for frequent itemset mining from uncertain data","author":"Leung C.K.","year":"2014","unstructured":"C.K. Leung , , \" Fast algorithms for frequent itemset mining from uncertain data ,\" in IEEE ICDM 2014 , pp. 893 -- 898 . C.K. Leung, et al., \"Fast algorithms for frequent itemset mining from uncertain data,\" in IEEE ICDM 2014, pp. 893--898.","journal-title":"IEEE ICDM"},{"key":"e_1_3_2_1_14_1","first-page":"252","article-title":"Frequent pattern mining from time-fading streams of uncertain data","author":"Leung C.K.","year":"2011","unstructured":"C.K. Leung , F. Jiang , \" Frequent pattern mining from time-fading streams of uncertain data ,\" DaWaK 2011 , pp. 252 -- 264 . C.K. Leung, F. Jiang, \"Frequent pattern mining from time-fading streams of uncertain data,\" DaWaK 2011, pp. 252--264.","journal-title":"DaWaK"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.10.010"},{"key":"e_1_3_2_1_16_1","first-page":"29","volume-title":"Mining sequential patterns in uncertain databases using hierarchical index structure,\" in PAKDD","author":"Roy K.K.","year":"2021","unstructured":"K.K. Roy , , \" Mining sequential patterns in uncertain databases using hierarchical index structure,\" in PAKDD 2021 , Part II, pp. 29 -- 41 . K.K. Roy, et al., \"Mining sequential patterns in uncertain databases using hierarchical index structure,\" in PAKDD 2021, Part II, pp. 29--41."},{"key":"e_1_3_2_1_17_1","first-page":"127","article-title":"Multitask learning for blackmarket tweet detection","author":"Arora U.","year":"2019","unstructured":"U. Arora , , \" Multitask learning for blackmarket tweet detection ,\" in IEEE\/ACM ASONAM 2019 , pp. 127 -- 130 . U. Arora, et al., \"Multitask learning for blackmarket tweet detection,\" in IEEE\/ACM ASONAM 2019, pp. 127--130.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_18_1","first-page":"216","article-title":"\"gl2vec: learning feature representation using graphlets for directed networks","author":"Tu K.","year":"2019","unstructured":"K. Tu , , \"gl2vec: learning feature representation using graphlets for directed networks ,\" in IEEE\/ACM ASONAM 2019 , pp. 216 -- 221 . K. Tu, et al., \"gl2vec: learning feature representation using graphlets for directed networks,\" in IEEE\/ACM ASONAM 2019, pp. 216--221.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1809400.1809407"},{"key":"e_1_3_2_1_20_1","first-page":"30","article-title":"FpViz: a visualizer for frequent pattern mining","author":"Leung C.K.","year":"2009","unstructured":"C.K. Leung , C.L. Carmichael , \" FpViz: a visualizer for frequent pattern mining ,\" in ACM KDD-VAKD 2009 , pp. 30 -- 39 . C.K. Leung, C.L. Carmichael, \"FpViz: a visualizer for frequent pattern mining,\" in ACM KDD-VAKD 2009, pp. 30--39.","journal-title":"ACM KDD-VAKD"},{"key":"e_1_3_2_1_21_1","first-page":"966","article-title":"An evolutionary approach for detecting communities in social networks","author":"Ozturk K.","year":"2017","unstructured":"K. Ozturk , , \" An evolutionary approach for detecting communities in social networks ,\" in IEEE\/ACM ASONAM 2017 , pp. 966 -- 973 . K. Ozturk, et al., \"An evolutionary approach for detecting communities in social networks,\" in IEEE\/ACM ASONAM 2017, pp. 966--973.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_22_1","first-page":"9","article-title":"A fast and efficient incremental approach toward dynamic community detection","author":"Zarayeneh N.","year":"2019","unstructured":"N. Zarayeneh , A. Kalyanaraman , \" A fast and efficient incremental approach toward dynamic community detection ,\" in IEEE\/ACM ASONAM 2019 , pp. 9 -- 16 . N. Zarayeneh, A. Kalyanaraman, \"A fast and efficient incremental approach toward dynamic community detection,\" in IEEE\/ACM ASONAM 2019, pp. 9--16.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_23_1","first-page":"38","volume-title":"Mining frequent patterns from human interactions in meetings using directed acyclic graphs,\" in PAKDD","author":"Fariha A.","year":"2013","unstructured":"A. Fariha , , \" Mining frequent patterns from human interactions in meetings using directed acyclic graphs,\" in PAKDD 2013 , Part I, pp. 38 -- 49 . A. Fariha, et al., \"Mining frequent patterns from human interactions in meetings using directed acyclic graphs,\" in PAKDD 2013, Part I, pp. 38--49."},{"issue":"15","key":"e_1_3_2_1_24_1","first-page":"3994","article-title":"Parallel social network mining for interesting 'following' patterns","volume":"28","author":"Leung C.K.","year":"2016","unstructured":"C.K. Leung , , \" Parallel social network mining for interesting 'following' patterns ,\" CCPE 28 ( 15 ), 2016 , pp. 3994 -- 4012 . C.K. Leung, et al., \"Parallel social network mining for interesting 'following' patterns,\" CCPE 28(15), 2016, pp. 3994--4012.","journal-title":"CCPE"},{"key":"e_1_3_2_1_25_1","first-page":"123","article-title":"Big data analytics of social networks for the discovery of 'following' patterns","author":"Leung C.K.","year":"2015","unstructured":"C.K. Leung , F. Jiang , \" Big data analytics of social networks for the discovery of 'following' patterns ,\" in DaWaK 2015 , pp. 123 -- 135 . C.K. Leung, F. Jiang, \"Big data analytics of social networks for the discovery of 'following' patterns,\" in DaWaK 2015, pp. 123--135.","journal-title":"DaWaK"},{"key":"e_1_3_2_1_26_1","first-page":"1258","article-title":"Mining personal media thresholds for opinion dynamics and social influence","author":"Doyle C.","year":"2018","unstructured":"C. Doyle , , \" Mining personal media thresholds for opinion dynamics and social influence ,\" in IEEE\/ACM ASONAM 2018 , pp. 1258 -- 1265 . C. Doyle, et al., \"Mining personal media thresholds for opinion dynamics and social influence,\" in IEEE\/ACM ASONAM 2018, pp. 1258--1265.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-7131-2_110201"},{"key":"e_1_3_2_1_28_1","first-page":"921","article-title":"Big data mining of social networks for friend recommendation","author":"Jiang F.","year":"2016","unstructured":"F. Jiang , , \" Big data mining of social networks for friend recommendation ,\" in IEEE\/ACM ASONAM 2016 , pp. 921 -- 922 . F. Jiang, et al., \"Big data mining of social networks for friend recommendation,\" in IEEE\/ACM ASONAM 2016, pp. 921--922.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_29_1","first-page":"501","article-title":"Finding popular friends in social networks","author":"Jiang F.","year":"2012","unstructured":"F. Jiang , , \" Finding popular friends in social networks ,\" in CGC 2012 , pp. 501 -- 508 . F. Jiang, et al., \"Finding popular friends in social networks,\" in CGC 2012, pp. 501--508.","journal-title":"CGC"},{"key":"e_1_3_2_1_30_1","first-page":"1","article-title":"Big data analytics of social network data: Who cares most about you on Facebook?","author":"Leung C.K.","year":"2018","unstructured":"C.K. Leung , , \" Big data analytics of social network data: Who cares most about you on Facebook? \" Highlighting the Importance of Big Data Management and Analysis for Various Applications , 2018 , pp. 1 -- 15 . C.K. Leung, et al., \"Big data analytics of social network data: Who cares most about you on Facebook?\" Highlighting the Importance of Big Data Management and Analysis for Various Applications, 2018, pp. 1--15.","journal-title":"Highlighting the Importance of Big Data Management and Analysis for Various Applications"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32587-9_2"},{"key":"e_1_3_2_1_32_1","first-page":"659","article-title":"Compression for very sparse big social data","author":"Leung C.K.","year":"2020","unstructured":"C.K. Leung , , \" Compression for very sparse big social data ,\" in IEEE\/ACM ASONAM 2020 , pp. 659 -- 666 . C.K. Leung, et al., \"Compression for very sparse big social data,\" in IEEE\/ACM ASONAM 2020, pp. 659--666.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-67044-3_9"},{"key":"e_1_3_2_1_34_1","first-page":"741","article-title":"Flexible compression of big data","author":"Leung C.K.","year":"2019","unstructured":"C.K. Leung , , \" Flexible compression of big data ,\" in IEEE\/ACM ASONAM 2019 , pp. 741 -- 748 . C.K. Leung, et al., \"Flexible compression of big data,\" in IEEE\/ACM ASONAM 2019, pp. 741--748.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_35_1","first-page":"568","article-title":"Semi-supervised learning and graph neural networks for fake news detection","author":"Benamira A.","year":"2019","unstructured":"A. Benamira , , \" Semi-supervised learning and graph neural networks for fake news detection ,\" in IEEE\/ACM ASONAM 2019 , pp. 568 -- 569 . A. Benamira, et al., \"Semi-supervised learning and graph neural networks for fake news detection,\" in IEEE\/ACM ASONAM 2019, pp. 568--569.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_36_1","first-page":"879","article-title":"RelExt: relation extraction using deep learning approaches for cybersecurity knowledge graph improvement","author":"Pingle A.","year":"2019","unstructured":"A. Pingle , , \" RelExt: relation extraction using deep learning approaches for cybersecurity knowledge graph improvement ,\" in IEEE\/ACM ASONAM 2019 , pp. 879 -- 886 . A. Pingle, et al., \"RelExt: relation extraction using deep learning approaches for cybersecurity knowledge graph improvement,\" in IEEE\/ACM ASONAM 2019, pp. 879--886.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_37_1","first-page":"916","article-title":"Mining 'following' patterns from big but sparsely distributed social network data","author":"Leung C.K.","year":"2018","unstructured":"C.K. Leung , , \" Mining 'following' patterns from big but sparsely distributed social network data ,\" in IEEE\/ACM ASONAM 2018 , pp. 916 -- 919 . C.K. Leung, et al., \"Mining 'following' patterns from big but sparsely distributed social network data,\" in IEEE\/ACM ASONAM 2018, pp. 916--919.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_38_1","first-page":"923","article-title":"Mining 'following' patterns from big sparse social networks","author":"Leung C.K.","year":"2016","unstructured":"C.K. Leung , , \" Mining 'following' patterns from big sparse social networks ,\" in IEEE\/ACM ASONAM 2016 , pp. 923 -- 930 . C.K. Leung, et al., \"Mining 'following' patterns from big sparse social networks,\" in IEEE\/ACM ASONAM 2016, pp. 923--930.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_39_1","first-page":"1025","article-title":"Efficient mining of 'following' patterns from very big but sparse social networks","author":"Leung C.K.","year":"2017","unstructured":"C.K. Leung , F. Jiang , \" Efficient mining of 'following' patterns from very big but sparse social networks ,\" in IEEE\/ACM ASONAM 2017 , pp. 1025 -- 1032 . C.K. Leung, F. Jiang, \"Efficient mining of 'following' patterns from very big but sparse social networks,\" in IEEE\/ACM ASONAM 2017, pp. 1025--1032.","journal-title":"IEEE\/ACM ASONAM"},{"key":"e_1_3_2_1_40_1","first-page":"419","article-title":"Exploring social networks: a frequent pattern visualization approach","author":"Leung C.K.","year":"2010","unstructured":"C.K. Leung , C.L. Carmichael , \" Exploring social networks: a frequent pattern visualization approach ,\" in IEEE SocialCom 2010 , pp. 419 -- 424 . C.K. Leung, C.L. Carmichael, \"Exploring social networks: a frequent pattern visualization approach,\" in IEEE SocialCom 2010, pp. 419--424.","journal-title":"IEEE SocialCom"},{"key":"e_1_3_2_1_41_1","first-page":"335","article-title":"Visual analytics of social networks: mining and visualizing co-authorship networks","author":"Leung C.K.","year":"2011","unstructured":"C.K. Leung , , \" Visual analytics of social networks: mining and visualizing co-authorship networks ,\" in HCII-FAC 2011 , pp. 335 -- 345 . C.K. Leung, et al., \"Visual analytics of social networks: mining and visualizing co-authorship networks,\" in HCII-FAC 2011, pp. 335--345.","journal-title":"HCII-FAC"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.08.250"},{"key":"e_1_3_2_1_43_1","first-page":"484","article-title":"Knowledge discovery from big social key-value data","author":"Leung C.K.","year":"2016","unstructured":"C.K. Leung , , \" Knowledge discovery from big social key-value data ,\" in IEEE CIT 2016 , pp. 484 -- 491 . C.K. Leung, et al., \"Knowledge discovery from big social key-value data,\" in IEEE CIT 2016, pp. 484--491.","journal-title":"IEEE CIT"},{"key":"e_1_3_2_1_44_1","first-page":"102","article-title":"Supporting social information discovery from big uncertain social key-value data via graph-like metaphors","author":"Hoi S.H.","year":"2018","unstructured":"C. S.H. Hoi , , \" Supporting social information discovery from big uncertain social key-value data via graph-like metaphors ,\" in ICCC 2018 , pp. 102 -- 116 . C.S.H. Hoi, et al., \"Supporting social information discovery from big uncertain social key-value data via graph-like metaphors,\" in ICCC 2018, pp. 102--116.","journal-title":"ICCC"},{"key":"e_1_3_2_1_45_1","first-page":"212","volume-title":"A theoretical approach to discover mutual friendships from social graph networks,\" in iiWAS","author":"Singh S.P.","year":"2019","unstructured":"S.P. Singh , , \" A theoretical approach to discover mutual friendships from social graph networks,\" in iiWAS 2019 , pp. 212 -- 221 . S.P. Singh, et al., \"A theoretical approach to discover mutual friendships from social graph networks,\" in iiWAS 2019, pp. 212--221."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.09.036"}],"event":{"name":"ASONAM '21: International Conference on Advances in Social Networks Analysis and Mining","location":"Virtual Event Netherlands","acronym":"ASONAM '21","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"]},"container-title":["Proceedings of the 2021 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487351.3489473","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3487351.3489473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:49Z","timestamp":1750188649000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487351.3489473"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,8]]},"references-count":46,"alternative-id":["10.1145\/3487351.3489473","10.1145\/3487351"],"URL":"https:\/\/doi.org\/10.1145\/3487351.3489473","relation":{},"subject":[],"published":{"date-parts":[[2021,11,8]]},"assertion":[{"value":"2022-01-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}