{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T06:16:36Z","timestamp":1764828996281,"version":"3.38.0"},"reference-count":32,"publisher":"China Science Publishing & Media Ltd.","issue":"3","license":[{"start":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T00:00:00Z","timestamp":1660089600000},"content-version":"vor","delay-in-days":221,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["direct.mit.edu"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The research on graph pattern matching (GPM) has attracted a lot of attention. However, most of the research has focused on complex networks, and there are few researches on GPM in the medical field. Hence, with GPM this paper is to make a breast cancer-oriented diagnosis before the surgery. Technically, this paper has firstly made a new definition of GPM, aiming to explore the GPM in the medical field, especially in Medical Knowledge Graphs (MKGs). Then, in the specific matching process, this paper introduces fuzzy calculation, and proposes a multi-threaded bidirectional routing exploration (M-TBRE) algorithm based on depth first search and a two-way routing matching algorithm based on multi-threading. In addition, fuzzy constraints are introduced in the M-TBRE algorithm, which leads to the Fuzzy-M-TBRE algorithm. The experimental results on the two datasets show that compared with existing algorithms, our proposed algorithm is more efficient and effective.<\/jats:p>","DOI":"10.1162\/dint_a_00153","type":"journal-article","created":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T19:14:45Z","timestamp":1660158885000},"page":"599-619","update-policy":"https:\/\/doi.org\/10.1162\/mitpressjournals.corrections.policy","source":"Crossref","is-referenced-by-count":3,"title":["Fuzzy-Constrained Graph Pattern Matching in Medical Knowledge\n                    Graphs"],"prefix":"10.3724","volume":"4","author":[{"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 230601, China"},{"name":"Intelligent Interconnected Systems Laboratory of Anhui Province (Hefei University of Technology), Hefei 230601, China"},{"name":"School of Computer Science and Information Engineering, Hefei University of Technology, Hefei 230601, China"}]},{"given":"Xun","family":"Du","sequence":"additional","affiliation":[{"name":"School of Computer Science and Information Engineering, Hefei University of Technology, Hefei 230601, China"}]},{"given":"Zan","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Information Engineering, Hefei University of Technology, Hefei 230601, China"}]},{"given":"Zhenchao","family":"Tao","sequence":"additional","affiliation":[{"name":"The First Affiliated Hospital of University of Science and Technology of China, Hefei 230031, China"}]}],"member":"2026","published-online":{"date-parts":[[2022,7,1]]},"reference":[{"key":"2022081019142412400_ref1","doi-asserted-by":"crossref","DOI":"10.1109\/TKDE.2021.3118815","volume-title":"A comprehensive survey on graph anomaly detection with deep\n                        learning","author":"Ma","year":"2021"},{"issue":"10","key":"2022081019142412400_ref2","doi-asserted-by":"crossref","first-page":"2382","DOI":"10.1109\/TKDE.2013.2297923","article-title":"Bag constrained structure pattern mining for multi-graph\n                        classification","volume":"26","author":"Wu","year":"2014","journal-title":"IEEE Transactions on Knowledge and\n                        Data Engineering"},{"issue":"3","key":"2022081019142412400_ref3","doi-asserted-by":"crossref","first-page":"637","DOI":"10.3233\/IDA-160824","article-title":"Global graph matching using diffusion maps","volume":"20","author":"Hu","year":"2016","journal-title":"Intelligent Data Analysis"},{"key":"2022081019142412400_ref4","first-page":"963","volume-title":"TALE: A tool for approximate large graph matching","author":"Tian","year":"2018"},{"key":"2022081019142412400_ref5","first-page":"4981","volume-title":"Deep learning for community detection: progress, challenges and\n                        opportunities","author":"Liu","year":"2020"},{"key":"2022081019142412400_ref6","article-title":"A comprehensive survey on community detection with deep\n                        learning","volume":"1-21","author":"Su","year":"2021","journal-title":"IEEE Transactions on Neural Networks and\n                        Learning Systems,"},{"key":"2022081019142412400_ref7","first-page":"1316","volume-title":"Finding experts by graph pattern matching","author":"Fan","year":"2008"},{"issue":"3","key":"2022081019142412400_ref8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2489791","article-title":"Incremental graph pattern matching","volume":"38","author":"Fan","year":"2013","journal-title":"ACM Transactions on Database Systems"},{"issue":"2","key":"2022081019142412400_ref9","doi-asserted-by":"crossref","first-page":"102054","DOI":"10.1016\/j.ipm.2019.102054","article-title":"Compact group discovery in attributed graphs and social\n                        networks","volume":"57","author":"Khan","year":"2020","journal-title":"Information Processing &\n                        Management"},{"issue":"6","key":"2022081019142412400_ref10","doi-asserted-by":"crossref","first-page":"920","DOI":"10.3156\/jsoft.28.920","article-title":"Social Group Discovery Extracting Useful Features using\n                        Multiple Instance Learning","volume":"28","author":"Ryota","year":"2016","journal-title":"Journal of Japan Society\n                        for Fuzzy Theory & Intelligent Informatics"},{"key":"2022081019142412400_ref11","first-page":"176187","volume-title":"Community Mining and Cross-Community Discovery in Online Social\n                        Networks","author":"Chikhaoui","year":"2020"},{"issue":"1-2","key":"2022081019142412400_ref12","doi-asserted-by":"crossref","first-page":"264","DOI":"10.14778\/1920841.1920878","article-title":"Graph pattern matching: from intractable to polynomial\n                        time","volume":"3","author":"Fan","year":"2010","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2022081019142412400_ref13","first-page":"351","volume-title":"Multi-constrained graph pattern matching in large-scale contextual\n                        social graphs","author":"Liu","year":"2015"},{"issue":"4","key":"2022081019142412400_ref14","doi-asserted-by":"crossref","first-page":"941","DOI":"10.3233\/IDA-194653","article-title":"Multi-fuzzy-constrained graph pattern matching with big graph\n                        data","volume":"24","author":"Liu","year":"2020","journal-title":"Intelligent Data Analysis"},{"issue":"1","key":"2022081019142412400_ref15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","article-title":"An Algorithm for Subgraph Isomorphism","volume":"23","author":"Ullmann","year":"1976","journal-title":"Journal of the ACM"},{"issue":"10","key":"2022081019142412400_ref16","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","article-title":"A (Sub) Graph Isomorphism Algorithm for Matching Large\n                        Graphs","volume":"26","author":"Cordella","year":"2004","journal-title":"IEEE transactions on pattern analysis and\n                        machine intelligence"},{"key":"2022081019142412400_ref17","first-page":"737","volume-title":"Fast best-effort pattern matching in large attributed\n                        graphs","author":"Tong","year":"2007"},{"key":"2022081019142412400_ref18","first-page":"1033","volume-title":"Top-k graph pattern matching over large graphs","author":"Cheng","year":"2013"},{"key":"2022081019142412400_ref19","first-page":"913","volume-title":"Fast Graph Pattern Matching","author":"Cheng","year":"2008"},{"issue":"4","key":"2022081019142412400_ref20","doi-asserted-by":"crossref","first-page":"413","DOI":"10.14778\/2735496.2735504","article-title":"Event pattern matching over graph streams","volume":"8","author":"Song","year":"2014","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2022081019142412400_ref21","first-page":"925","volume-title":"Incremental graph pattern matching","author":"Fan","year":"2011"},{"key":"2022081019142412400_ref22","first-page":"335","volume-title":"Graph indexing: a frequent structure-based approach","author":"Yan","year":"2004"},{"key":"2022081019142412400_ref23","first-page":"39","volume-title":"Algorithmics and applications of tree and graph searching","author":"Shasha","year":"2002"},{"key":"2022081019142412400_ref24","first-page":"62","volume-title":"Enumerating subgraph instances using map-reduce","author":"Afrati","year":"2013"},{"key":"2022081019142412400_ref25","first-page":"625","volume-title":"Parallel subgraph listing in a large-scale graph","author":"Shao","year":"2014"},{"key":"2022081019142412400_ref26","first-page":"64","volume-title":"Query optimization of distributed pattern matching","author":"Huang","year":"2014"},{"issue":"3","key":"2022081019142412400_ref27","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s00138-010-0290-z","article-title":"Graph-based shape indexing","volume":"23","author":"Demirci","year":"2012","journal-title":"Machine\n                        Vision and Applications"},{"key":"2022081019142412400_ref28","first-page":"1101","volume-title":"StreamWorks: a system for dynamic graph search","author":"Choudhury","year":"2013"},{"key":"2022081019142412400_ref29","first-page":"453","volume-title":"Computing simulations on finite and infinite graphs","author":"Henzinger","year":"1995"},{"issue":"1","key":"2022081019142412400_ref30","doi-asserted-by":"crossref","first-page":"4:1","DOI":"10.1145\/2528937","article-title":"Capturing topology in graph pattern matching","volume":"39","author":"Ma","year":"2014","journal-title":"ACM Transactions on Database Systems"},{"issue":"6","key":"2022081019142412400_ref31","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1109\/TKDE.2017.2785824","article-title":"MCS-GPM: Multi-Constrained Simulation Based Graph Pattern\n                        Matching in Contextual Social Graphs","volume":"30","author":"Liu","year":"2018","journal-title":"IEEE\n                        Transactions on Knowledge and Data Engineering"},{"issue":"3","key":"2022081019142412400_ref32","first-page":"1","article-title":"Social Group Query Based on Multi-Fuzzy-Constrained Strong\n                        Simulation","volume":"16","author":"Liu","year":"2021","journal-title":"Transactions on Knowledge Discovery from\n                        Data"}],"container-title":["Data Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/direct.mit.edu\/dint\/article-pdf\/4\/3\/599\/2038443\/dint_a_00153.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/direct.mit.edu\/dint\/article-pdf\/4\/3\/599\/2038443\/dint_a_00153.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T07:41:23Z","timestamp":1741938083000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.sciengine.com\/doi\/10.1162\/dint_a_00153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7,1]]}},"URL":"https:\/\/doi.org\/10.1162\/dint_a_00153","relation":{},"ISSN":["2641-435X"],"issn-type":[{"type":"electronic","value":"2641-435X"}],"subject":[],"published-other":{"date-parts":[[2022]]},"published":{"date-parts":[[2022]]}}}