{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T08:21:23Z","timestamp":1768638083311,"version":"3.49.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2018,12,19]],"date-time":"2018-12-19T00:00:00Z","timestamp":1545177600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Open Project Program of the National Laboratory of Pattern Recognition"},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61773310, 61822309, 61572397, U1766215, 61502383, and U1736205"],"award-info":[{"award-number":["61773310, 61822309, 61572397, U1766215, 61502383, and U1736205"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2019,2,28]]},"abstract":"<jats:p>\n            People participate in multiple online social networks, e.g., Facebook, Twitter, and Linkedin, and these social networks with heterogeneous social content and user relationship are named as heterogeneous social networks. Group structure widely exists in heterogeneous social networks, which reveals the evolution of human cooperation. Detecting similar groups in heterogeneous networks has a great significance for many applications, such as recommendation system and spammer detection, using the wealth of group information. Although promising, this novel problem encounters a variety of technical challenges, including incomplete data, high time complexity, and ground truth. To address the research gap and technical challenges, we take advantage of a ratio-cut optimization function to model this novel problem by the linear mixed-effects method and graph spectral theory. Based on this model, we propose an efficient algorithm called D\n            <jats:sc>igger<\/jats:sc>\n            to detect the similar groups in the large graphs. D\n            <jats:sc>igger<\/jats:sc>\n            consists of three steps, including measuring user similarity, construct a matching graph, and detecting similar groups. We adopt several strategies to lower the computational cost and detail the basis of labeling the ground truth. We evaluate the effectiveness and efficiency of our algorithm on five different types of online social networks. The extensive experiments show that our method achieves 0.693, 0.783, and 0.735 in precision, recall, and F1-measure, which significantly surpass the state-of-arts by 24.4%, 15.3%, and 20.7%, respectively. The results demonstrate that our proposal can detect similar groups in heterogeneous networks effectively.\n          <\/jats:p>","DOI":"10.1145\/3267106","type":"journal-article","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T13:35:46Z","timestamp":1545312946000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["D\n            <scp>igger<\/scp>"],"prefix":"10.1145","volume":"13","author":[{"given":"Xiaoming","family":"Liu","sequence":"first","affiliation":[{"name":"Xi\u2019an Jiaotong University and Georgia Institute of Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Shen","sequence":"additional","affiliation":[{"name":"Xi\u2019an Jiaotong University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohong","family":"Guan","sequence":"additional","affiliation":[{"name":"Xi\u2019an Jiaotong University and Tsinghua University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yadong","family":"Zhou","sequence":"additional","affiliation":[{"name":"Xi\u2019an Jiaotong University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,12,19]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.05.008"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2005.10.009"},{"key":"e_1_2_1_3_1","volume-title":"Classification and Regression Trees","author":"Breiman Leo","unstructured":"Leo Breiman . 2017. Classification and Regression Trees . Routledge . Leo Breiman. 2017. Classification and Regression Trees. Routledge."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0186-6"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20810-7_11"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-007-0114-x"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0913149107"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0132071"},{"key":"e_1_2_1_12_1","volume-title":"Handbook of Optimization in Complex Networks","author":"Kelley Stephen","unstructured":"Stephen Kelley , Mark Goldberg , Malik Magdon-Ismail , Konstantin Mertsalov , and Al Wallace . 2012. Defining and discovering communities in social networks . In Handbook of Optimization in Complex Networks . Springer , 139--168. Stephen Kelley, Mark Goldberg, Malik Magdon-Ismail, Konstantin Mertsalov, and Al Wallace. 2012. Defining and discovering communities in social networks. In Handbook of Optimization in Complex Networks. Springer, 139--168."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1241540.1241551"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539780"},{"key":"e_1_2_1_15_1","volume-title":"A common subgraph correspondence mining framework for map search services. Multimedia Tools and Applications","author":"Liu Wu","year":"2018","unstructured":"Wu Liu , Lingheng Zhu , Lingyang Chu , and Huadong Ma. 2018. A common subgraph correspondence mining framework for map search services. Multimedia Tools and Applications ( 2018 ), 1--20. Wu Liu, Lingheng Zhu, Lingyang Chu, and Huadong Ma. 2018. A common subgraph correspondence mining framework for map search services. Multimedia Tools and Applications (2018), 1--20."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.08.001"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.05.008"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2580060"},{"key":"e_1_2_1_19_1","volume-title":"Neuhaus","author":"McCulloch Charles E.","year":"2001","unstructured":"Charles E. McCulloch and John M . Neuhaus . 2001 . Generalized Linear Mixed Models. Wiley Online Library . Charles E. McCulloch and John M. Neuhaus. 2001. Generalized Linear Mixed Models. Wiley Online Library."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187863"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2032162.2032163"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11569596_31"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(88)90021-0"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.2297920"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2598561"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339778"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402736"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9868.00293"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/3192424.3192640"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 17th IEEE International Conference on Mobile Data Management (MDM\u201916)","volume":"1","author":"Wang Fengjiao","unstructured":"Fengjiao Wang , Shuyang Lin , and S. Yu Philip . 2016. Collaborative co-clustering across multiple social media . In Proceedings of the 17th IEEE International Conference on Mobile Data Management (MDM\u201916) , Vol. 1 . 142--151. Fengjiao Wang, Shuyang Lin, and S. Yu Philip. 2016. Collaborative co-clustering across multiple social media. In Proceedings of the 17th IEEE International Conference on Mobile Data Management (MDM\u201916), Vol. 1. 142--151."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2373385"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 14th International Conference on Machine Learning (ICML\u201997)","volume":"97","author":"Yang Yiming","unstructured":"Yiming Yang and Jan O. Pedersen . 1997. A comparative study on feature selection in text categorization . In Proceedings of the 14th International Conference on Machine Learning (ICML\u201997) , Vol. 97 . 412--420. Yiming Yang and Jan O. Pedersen. 1997. A comparative study on feature selection in text categorization. In Proceedings of the 14th International Conference on Machine Learning (ICML\u201997), Vol. 97. 412--420."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.93.012303"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2708090"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783268"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487597"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3267106","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3267106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:52Z","timestamp":1750278412000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3267106"}},"subtitle":["Detect Similar Groups in Heterogeneous Social Networks"],"short-title":[],"issued":{"date-parts":[[2018,12,19]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2,28]]}},"alternative-id":["10.1145\/3267106"],"URL":"https:\/\/doi.org\/10.1145\/3267106","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,19]]},"assertion":[{"value":"2018-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-12-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}