{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:59:58Z","timestamp":1775080798551,"version":"3.50.1"},"reference-count":47,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T00:00:00Z","timestamp":1676851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62076087, 61906059 & 62120106008"],"award-info":[{"award-number":["62076087, 61906059 & 62120106008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Program for Changjiang Scholars and Innovative Research Team in University (PCSIRT) of the Ministry of Education of China","award":["IRT17R32"],"award-info":[{"award-number":["IRT17R32"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2023,2,28]]},"abstract":"<jats:p>Graph pattern matching (GPM) is widely used in social network analysis, such as expert finding, social group query, and social position detection. Technically, GPM is to find matched subgraphs that meet the requirements of pattern graphs in big social networks. In the application of expert community location, the nodes in the pattern graph and data graph represent expert entities, and the edges represent previous cooperations between them. However, the existing GPM methods focus on shortening the matching time and without considering the preference of the decision maker (DM), which makes it difficult for the DM to find ideal teams from numerous matches to complete the assigned task. In this article, as for the process of graph pattern matching and rematching, with a preferred expert set, i.e., the DM hopes that one or more experts in this set will appear in matched subgraphs, we propose a Dual Simulation-based Edge Sequencing-oriented Semi-Supervised GPM method (DsEs-ssGPM). In addition, considering a preferred expert set and a dispreferred expert set together, the DM hopes that experts in the dispreferred expert set will not appear in final matches, so we have the DsEs-ssGPM+ method. Technically, these DsEs-ssGPM methods conduct the matching process from the preferred expert set during dual simulation-based edge sequencing, and based on the edge sequence, these edges are searched recursively. Especially, as for the rematching process, when the preferred and\/or the dispreferred expert sets change continuously, to process the GPM again is unnecessary and it is possible to revise the previous matched results partially with DsEs-ssGPM methods. Experiments on four large datasets demonstrate the effectiveness, efficiency and stability of our proposed DsEs-ssGPM methods, and the necessity of introducing an edge sequencing mechanism.<\/jats:p>","DOI":"10.1145\/3532623","type":"journal-article","created":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T12:20:33Z","timestamp":1651494033000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Semi-Supervised Graph Pattern Matching and Rematching for Expert Community Location"],"prefix":"10.1145","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5374-7293","authenticated-orcid":false,"given":"Lei","family":"Li","sequence":"first","affiliation":[{"name":"Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China), Hefei University of Technology, Hefei, China and Intelligent Interconnected Systems Laboratory of Anhui Province (Hefei University of Technology), Hefei, China and School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0516-885X","authenticated-orcid":false,"given":"Mengjiao","family":"Yan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8142-9164","authenticated-orcid":false,"given":"Zhenchao","family":"Tao","sequence":"additional","affiliation":[{"name":"The First Affiliated Hospital of University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3918-384X","authenticated-orcid":false,"given":"Huanhuan","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-1704","authenticated-orcid":false,"given":"Xindong","family":"Wu","sequence":"additional","affiliation":[{"name":"Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China), Hefei University of Technology, Hefei, China"}]}],"member":"320","published-online":{"date-parts":[[2023,2,20]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148181"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.4159\/9780674020658"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/int.1055"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129110"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3053165"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/ett.3600"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.62"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.26"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3127876"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.29"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767858"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920878"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/2489791"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2012.54"},{"key":"e_1_3_2_17_2","unstructured":"Shuai Ma Jia Li Chunming Hu Xudong Liu and Jinpeng Huai. 2018. Graph pattern matching for dynamic team formation. arXiv:1801.01012. Retrieved from https:\/\/arxiv.org\/abs\/1801.01012."},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2007.14"},{"key":"e_1_3_2_19_2","first-page":"45","volume-title":"Capturing and Using Patterns for Evidence Detection, Papers from the 2006 AAAI Fall Symposium, Washington, DC, USA, October 13-15, 2006 (AAAI Technical Report)","author":"Gallagher Brian","year":"2006","unstructured":"Brian Gallagher. 2006. Matching structure and semantics: A survey on graph-based pattern matching. In Capturing and Using Patterns for Evidence Detection, Papers from the 2006 AAAI Fall Symposium, Washington, DC, USA, October 13-15, 2006 (AAAI Technical Report), Vol. FS-06-02. AAAI Press, 45\u201353. Retrieved from https:\/\/www.aaai.org\/Library\/Symposia\/Fall\/2006\/fs06-02-007.php."},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492576"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-160824"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2808332"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557074"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488518500277"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2016.6"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0130493"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.4018\/JDM.2019100102"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/WAIM.2008.100"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-194653"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-019-00674-0"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICWS.2017.69"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3481640"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2785824"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7509"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113297"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/2528937"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-0503-0_38"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281247"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.3115\/1699510.1699543"},{"issue":"11","key":"e_1_3_2_40_2","first-page":"89","article-title":"Research and application on crime rule based on graph data mining algorithm","volume":"21","author":"Tang Dequan","year":"2011","unstructured":"Dequan Tang, Yue Zhang, Yonghe He, and Zihong Xiao. 2011. Research and application on crime rule based on graph data mining algorithm. Computer Technology and Development 21, 11 (2011), 89\u201395.","journal-title":"Computer Technology and Development"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3461339"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2012.12.020"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0468-3"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.12.031"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.109"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68125-0_41"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.10.003"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687727"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3532623","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3532623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:04Z","timestamp":1750182664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3532623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,20]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2,28]]}},"alternative-id":["10.1145\/3532623"],"URL":"https:\/\/doi.org\/10.1145\/3532623","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,20]]},"assertion":[{"value":"2021-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-04-16","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}