{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:49:31Z","timestamp":1753890571372,"version":"3.41.2"},"reference-count":23,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T00:00:00Z","timestamp":1739145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62120106008"],"award-info":[{"award-number":["62120106008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Big Data"],"abstract":"<jats:sec><jats:title>Introduction<\/jats:title><jats:p>Traditional Graph Pattern Matching (GPM) research mainly focuses on improving the accuracy and efficiency of complex network analysis and fast subgraph retrieval. Despite their ability to return subgraphs quickly and accurately, these methods are limited to their applications without medical data research.<\/jats:p><\/jats:sec><jats:sec><jats:title>Methods<\/jats:title><jats:p>In order to overcome this limitation, based on the existing research on GPM with the lung cancer knowledge graph, this paper introduces the Monte Carlo method and proposes an edge-level multi-constraint graph pattern matching algorithm TEM with lung cancer knowledge graph. Furthermore, we apply Monte Carlo method to both nodes and edges, and propose a multi-constraint hologram pattern matching algorithm THM with lung cancer knowledge graph.<\/jats:p><\/jats:sec><jats:sec><jats:title>Results<\/jats:title><jats:p>The experiments have verified the effectiveness and efficiency of TEM algorithm.<\/jats:p><\/jats:sec><jats:sec><jats:title>Discussion<\/jats:title><jats:p>This method effectively addresses the complexity of uncertainty in lung cancer knowledge graph, and is significantly better than the existing algorithms on efficiency.<\/jats:p><\/jats:sec>","DOI":"10.3389\/fdata.2024.1546850","type":"journal-article","created":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T06:49:02Z","timestamp":1739170142000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Edge-level multi-constranint graph pattern matching with lung cancer knowledge graph"],"prefix":"10.3389","volume":"8","author":[{"given":"Houdie","family":"Tu","sequence":"first","affiliation":[]},{"given":"Lei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zhenchao","family":"Tao","sequence":"additional","affiliation":[]},{"given":"Zan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"1965","published-online":{"date-parts":[[2025,2,10]]},"reference":[{"key":"B1","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1109\/TPAMI.2017.2696940","article-title":"Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3","volume":"9","author":"Carletti","year":"2018","journal-title":"IEEE Trans. Pattern Analy. Mach. Intellig"},{"key":"B2","first-page":"913","article-title":"\u201cFast graph pattern matching,\u201d","volume-title":"IEEE 24th International Conference on Data Engineering","author":"Cheng","year":"2008"},{"key":"B3","unstructured":"\u201cCommunity mining and cross-community discovery in online social networks,\u201d\n          \n          \n            \n              Chikhaoui\n              B.\n            \n            \n              Tshimula\n              J. M.\n            \n            \n              Wang\n              S.\n            \n          \n          International Conference on Network-Based Information\n          \n          2020"},{"key":"B4","doi-asserted-by":"publisher","first-page":"264","DOI":"10.14778\/1920841.1920878","article-title":"Graph pattern matching: from intractable to polynomial time","volume":"3","author":"Fan","year":"2010","journal-title":"Proc. VLDB Endow"},{"key":"B5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/2508020.2489791","article-title":"Incremental graph pattern matching","volume":"38","author":"Fan","year":"2013","journal-title":"ACM Trans. Database Syst"},{"key":"B6","first-page":"1","article-title":"\u201cAn improved algorithm for matching large graphs,\u201d","volume-title":"Proc of the 3rd IAPR-TC-15 International Workshop on Graph-based Representation, Ischia, Italy","author":"Foggia","year":"2001"},{"journal-title":"Research on Quality Prediction of Continuous Casting Billet Based on Graph Pattern Matching","year":"2024","author":"Guo","key":"B7"},{"key":"B8","first-page":"453","article-title":"\u201cComputing simulations on finite and infinite graphs,\u201d","volume-title":"IEEE 36th Annual Foundations of Computer Science","author":"Henzinger","year":"1995"},{"key":"B9","doi-asserted-by":"publisher","first-page":"637","DOI":"10.3233\/IDA-160824","article-title":"Global graph matching using diffusion maps","volume":"20","author":"Hu","year":"2016","journal-title":"Data Analy"},{"key":"B10","first-page":"88","article-title":"Strong simulation matching of temporal pattern graph with temporal priority constraints","volume":"6","author":"Jin","year":"2023","journal-title":"Comp. Technol. Dev"},{"key":"B11","doi-asserted-by":"publisher","first-page":"0306","DOI":"10.1016\/j.ipm.2019.102054","article-title":"Compact group discovery in attributed graphs and social networks","volume":"57","author":"Khan","year":"2020","journal-title":"Inform. Proc. Managem"},{"key":"B12","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MIS.2016.6","article-title":"Trust agent-based behavior induction in social networks","volume":"31","author":"Li","year":"2016","journal-title":"IEEE Intellig. Syst"},{"key":"B13","doi-asserted-by":"crossref","DOI":"10.1145\/3685054","article-title":"\u201cProbabilistic graph pattern matching via tumor knowledge graph,\u201d","volume-title":"ACM Transactions on Probabilistic Machine Learning","author":"Li","year":"2024"},{"key":"B14","first-page":"4981","article-title":"\u201cDeep learning for community detection: progress, challenges and opportunities,\u201d","volume-title":"Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI'20)","author":"Liu","year":"2021"},{"key":"B15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/3481640","article-title":"Social group query based on multi-fuzzy-constrained strong simulation","volume":"16","author":"Liu","year":"2022","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"B16","doi-asserted-by":"publisher","first-page":"941","DOI":"10.3233\/IDA-194653","article-title":"Multi-fuzzy-constrained graph pattern matching with big graph data","volume":"24","author":"Liu","year":"2020","journal-title":"Intell. Data Anal."},{"key":"B17","first-page":"351","article-title":"\u201cMulti-Constrained graph pattern matching in large-scale contextual social graphs,\u201d","volume-title":"IEEE 31st International Conference on Data Engineering, Seoul, Korea","author":"Liu","year":"2015"},{"key":"B18","doi-asserted-by":"publisher","first-page":"920","DOI":"10.3156\/jsoft.28.920","article-title":"Social group discovery extracting useful features using multiple instance learning","volume":"28","author":"Sato","year":"2016","journal-title":"J. Japan Soc. Fuzzy Theory Intellig. Inform"},{"key":"B19","doi-asserted-by":"publisher","first-page":"2162","DOI":"10.1109\/TNNLS.2021.3137396","article-title":"A comprehensive survey on community detection with deep learning","volume":"9","author":"Su","year":"2022","journal-title":"IEEE Trans. Neural Netw. Learning Syst"},{"key":"B20","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1109\/ICDE.2008.4497505","article-title":"\u201cA tool for approximate large graph matching,\u201d","volume-title":"2008 IEEE 24th International Conference on Data Engineering","author":"Tian","year":"2008"},{"key":"B21","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1145\/1281192.1281271","article-title":"\u201cFast best-effort pattern matching in large attributed graphs,\u201d","author":"Tong","year":"2007","journal-title":"13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '07)"},{"key":"B22","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.14778\/2732977.2732992","article-title":"Reachability querying: an independent permutation labeling approach","volume":"7","author":"Wei","year":"2014","journal-title":"Proc. VLDB Endow"},{"volume-title":"Research on Multi-Constrained Graph Pattern Matching for Large Graph Data","year":"2023","author":"Yan","key":"B23"}],"container-title":["Frontiers in Big Data"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fdata.2025.1546850\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T06:49:10Z","timestamp":1739170150000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fdata.2025.1546850\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,10]]},"references-count":23,"alternative-id":["10.3389\/fdata.2024.1546850"],"URL":"https:\/\/doi.org\/10.3389\/fdata.2024.1546850","relation":{},"ISSN":["2624-909X"],"issn-type":[{"type":"electronic","value":"2624-909X"}],"subject":[],"published":{"date-parts":[[2025,2,10]]},"article-number":"1546850"}}