{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T15:41:43Z","timestamp":1764603703374,"version":"3.38.0"},"reference-count":42,"publisher":"SAGE Publications","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2020,7,15]]},"DOI":"10.3233\/ida-194653","type":"journal-article","created":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T17:16:34Z","timestamp":1595351794000},"page":"941-958","source":"Crossref","is-referenced-by-count":14,"title":["Multi-fuzzy-constrained graph pattern matching with big graph data"],"prefix":"10.1177","volume":"24","author":[{"given":"Guliu","family":"Liu","sequence":"first","affiliation":[{"name":"Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology), Ministry of Education, Hefei, Anhui, China"},{"name":"School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, Anhui, China"}]},{"given":"Lei","family":"Li","sequence":"additional","affiliation":[{"name":"Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology), Ministry of Education, Hefei, Anhui, China"},{"name":"School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, Anhui, China"}]},{"given":"Xindong","family":"Wu","sequence":"additional","affiliation":[{"name":"Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology), Ministry of Education, Hefei, Anhui, China"},{"name":"School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, Anhui, China"},{"name":"Mininglamp Academy of Sciences, Mininglamp Technologies, Beijing, China"}]}],"member":"179","reference":[{"issue":"1","key":"10.3233\/IDA-194653_ref1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/TKDE.2013.109","article-title":"Data mining with big data","volume":"26","author":"Wu","year":"2014","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"10.3233\/IDA-194653_ref2","doi-asserted-by":"crossref","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 Intelligent Systems"},{"issue":"1","key":"10.3233\/IDA-194653_ref3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00778-017-0468-3","article-title":"Reachability querying: an independent permutation labeling approach","volume":"27","author":"Wei","year":"2018","journal-title":"The VLDB Journal \u2013 The International Journal on Very Large Data Bases"},{"issue":"2","key":"10.3233\/IDA-194653_ref4","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","article-title":"Finding the k shortest paths","volume":"28","author":"Eppstein","year":"1998","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"10.3233\/IDA-194653_ref5","doi-asserted-by":"crossref","first-page":"103","DOI":"10.3233\/IDA-173705","article-title":"Efficient frequent subgraph mining on large streaming graphs","volume":"23","author":"Ray","year":"2019","journal-title":"Intelligent Data Analysis"},{"issue":"6","key":"10.3233\/IDA-194653_ref6","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.3233\/IDA-173681","article-title":"Discovering frequent induced subgraphs from directed networks","volume":"22","author":"Zhang","year":"2018","journal-title":"Intelligent Data Analysis"},{"key":"10.3233\/IDA-194653_ref7","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10115-017-1079-4","article-title":"On mining approximate and exact fault-tolerant frequent itemsets","volume":"55","author":"Liu","year":"2018","journal-title":"Knowledge and Information Systems"},{"issue":"3","key":"10.3233\/IDA-194653_ref8","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1007\/s10115-017-1104-7","article-title":"Mining frequent subgraphs from tremendous amount of small graphs using MapReduce","volume":"56","author":"Peng","year":"2018","journal-title":"Knowledge and Information Systems"},{"key":"10.3233\/IDA-194653_ref9","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.ins.2013.10.003","article-title":"SQBC: An efficient subgraph matching method over large and dense graphs","volume":"261","author":"Zheng","year":"2014","journal-title":"Information Sciences"},{"issue":"1","key":"10.3233\/IDA-194653_ref10","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10115-017-1129-y","article-title":"Resling: A scalable and generic framework to mine top-k representative subgraph patterns","volume":"54","author":"Natarajan","year":"2018","journal-title":"Knowledge and Information Systems"},{"key":"10.3233\/IDA-194653_ref11","doi-asserted-by":"crossref","unstructured":"T. Tran, H. Wang, S. Rudolph and P. Cimiano, Top-k exploration of query candidates for efficient keyword Search on graph-shaped (RDF) data, IEEE 25th International Conference on Data Engineering, IEEE, Shanghai, China, 2009, pp. 405\u2013416.","DOI":"10.1109\/ICDE.2009.119"},{"key":"10.3233\/IDA-194653_ref12","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.jss.2018.02.050","article-title":"Efficient graph pattern matching framework for network-based in-vehicle fault detection","volume":"140","author":"Baek","year":"2018","journal-title":"Journal of Systems and Software"},{"issue":"1","key":"10.3233\/IDA-194653_ref13","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 (JACM)"},{"issue":"10","key":"10.3233\/IDA-194653_ref14","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","article-title":"A (sub) graph isomorphism algorithm for matching large graphs","volume":"26","author":"Cordella","year":"2004","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"3","key":"10.3233\/IDA-194653_ref15","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":"10.3233\/IDA-194653_ref16","unstructured":"W. Fan, X. Wang and Y. Wu, Expfinder: Finding experts by graph pattern matching, IEEE 29th International Conference on Data Engineering, IEEE, Brisbane, QLD, Australia, 2013, pp. 1316\u20131319."},{"key":"10.3233\/IDA-194653_ref17","first-page":"89","article-title":"Research and application on crime rule based on graph data mining algorithm","volume":"11","author":"Tang","year":"2011","journal-title":"Computer Technology and Development"},{"issue":"3","key":"10.3233\/IDA-194653_ref18","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/2489791","article-title":"Incremental graph pattern matching","volume":"38","author":"Fan","year":"2013","journal-title":"ACM Transactions on Database Systems (TODS)"},{"issue":"4","key":"10.3233\/IDA-194653_ref19","doi-asserted-by":"crossref","first-page":"881","DOI":"10.3233\/IDA-173442","article-title":"Personalized news recommendation using graph-based approach","volume":"22","author":"Lenin","year":"2018","journal-title":"Intelligent Data Analysis"},{"issue":"3","key":"10.3233\/IDA-194653_ref20","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/s10115-017-1106-5","article-title":"On route planning by inferring visiting time, modeling user preferences, and mining representative trip patterns","volume":"56","author":"Li","year":"2018","journal-title":"Knowledge and Information Systems"},{"issue":"2","key":"10.3233\/IDA-194653_ref21","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10115-017-1056-y","article-title":"Personalized trip recommendation for tourists based on user interests, points of interest visit durations and visit recency","volume":"54","author":"Lim","year":"2018","journal-title":"Knowledge and Information Systems"},{"key":"10.3233\/IDA-194653_ref22","doi-asserted-by":"crossref","unstructured":"W. Fan, J. Li, S. Ma, N. Tang, Y. Wu and Y. Wu, Graph pattern matching: from intractable to polynomial time, Proceedings of the VLDB Endowment 3(1\u20132) (2010), 264\u2013275.","DOI":"10.14778\/1920841.1920878"},{"key":"10.3233\/IDA-194653_ref23","doi-asserted-by":"crossref","unstructured":"G. Liu, K. Zheng, Y. Wang, M.A. Orgun, A. Liu, L. Zhao and X. Zhou, Multi-constrained graph pattern matching in large-scale contextual social graphs, IEEE 31st International Conference on Data Engineering, IEEE, Seoul, South Korea, 2015, pp. 351\u2013362.","DOI":"10.1109\/ICDE.2015.7113297"},{"key":"10.3233\/IDA-194653_ref24","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1109\/SFCS.1995.492576","article-title":"Computing simulations on finite and infinite graphs","author":"Henzinger","year":"1995","journal-title":"IEEE 36th Annual Foundations of Computer Science"},{"key":"10.3233\/IDA-194653_ref25","doi-asserted-by":"crossref","unstructured":"S. Zhang, S. Li and J. Yang, GADDI: Distance index based subgraph matching in biological networks, Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, ACM, Saint Petersburg, Russia, 2009, pp. 192\u2013203.","DOI":"10.1145\/1516360.1516384"},{"key":"10.3233\/IDA-194653_ref26","doi-asserted-by":"crossref","unstructured":"C. Wickramaarachchi, R. Kannan, C. Chelmis and V.K. Prasanna, Distributed exact subgraph matching in small diameter dynamic graphs, IEEE International Conference on Big Data, IEEE, Washington, DC, USA, 2017, pp. 3360\u20133369.","DOI":"10.1109\/BigData.2016.7840996"},{"key":"10.3233\/IDA-194653_ref27","doi-asserted-by":"crossref","unstructured":"X. Yan, P.S. Yu and J. Han, Graph indexing: a frequent structure-based approach, Proceedings of the 2004 ACM SIGMOD international conference on Management of data, SIGMOD, Paris, France, 2004, pp. 335\u2013346.","DOI":"10.1145\/1007568.1007607"},{"key":"10.3233\/IDA-194653_ref28","doi-asserted-by":"crossref","unstructured":"D. Shasha, J.T.L. Wang, R. Giugno, Algorithmics and applications of tree and graph searching, Acm Sigmod-sigact-sigart Symposium on Principles of Database Systems, ACM, Madison, Wisconsin, 2002.","DOI":"10.1145\/543613.543620"},{"key":"10.3233\/IDA-194653_ref29","doi-asserted-by":"crossref","unstructured":"J. Cheng, Y. Ke, W. Ng and A. Lu, Fg-index: towards verification-free query processing on graph databases, Proceedings of the 2007 ACM SIGMOD international conference on Management of data, ACM, Beijing, China, 2007, pp. 857\u2013872.","DOI":"10.1145\/1247480.1247574"},{"key":"10.3233\/IDA-194653_ref30","doi-asserted-by":"crossref","unstructured":"J. Mondal and A. Deshpande, CASQD: continuous detection of activity-based subgraph pattern queries on dynamic graphs, Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems, ACM, Irvine, California, 2016, pp. 226\u2013237.","DOI":"10.1145\/2933267.2933316"},{"key":"10.3233\/IDA-194653_ref31","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/978-3-319-18120-2_18","article-title":"Fast subgraph matching on large graphs using graphics processors","author":"Tran","year":"2015","journal-title":"Database Systems for Advanced Applications"},{"key":"10.3233\/IDA-194653_ref32","doi-asserted-by":"crossref","unstructured":"F.N. Afrati, D. Fotakis and J.D. Ullman, Enumerating subgraph instances using map-reduce, IEEE 29th International Conference on Data Engineering, IEEE, Brisbane, QLD, Australia, 2013, pp. 62\u201373.","DOI":"10.1109\/ICDE.2013.6544814"},{"key":"10.3233\/IDA-194653_ref33","doi-asserted-by":"crossref","unstructured":"Y. Shao, B. Cui, C. Lei, M. Lin, J. Yao and X. Ning, Parallel subgraph listing in a large-scale graph, Acm Sigmod International Conference on Management of Data, ACM, Snowbird, Utah, USA, 2014, pp. 625\u2013636.","DOI":"10.1145\/2588555.2588557"},{"key":"10.3233\/IDA-194653_ref34","doi-asserted-by":"crossref","unstructured":"J. Gao, B. Song, P. Liu, W. Ke, J. Wang and X. Hu, Parallel top-k subgraph query in massive graphs: Computing from the perspective of single vertex, IEEE International Conference on Big Data, IEEE, Washington, DC, USA, 2017, pp. 636\u2013645.","DOI":"10.1109\/BigData.2016.7840656"},{"key":"10.3233\/IDA-194653_ref35","doi-asserted-by":"crossref","unstructured":"W. Fan, X. Wang and Y. Wu, Answering graph pattern queries using views, IEEE 30th International Conference on Data Engineering, IEEE, Chicago, IL, USA, 2014, pp. 184\u2013195.","DOI":"10.1109\/ICDE.2014.6816650"},{"key":"10.3233\/IDA-194653_ref36","doi-asserted-by":"crossref","unstructured":"W. Fan, X. Wang and Y. Wu, Querying big graphs within bounded resources, Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, ACM, New York, NY, USA, 2014, pp. 301\u2013312.","DOI":"10.1145\/2588555.2610513"},{"issue":"1","key":"10.3233\/IDA-194653_ref37","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/2528937","article-title":"Strong simulation: Capturing topology in graph pattern matching","volume":"39","author":"Ma","year":"2014","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"10.3233\/IDA-194653_ref38","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/j.knosys.2016.07.009","article-title":"Efficient pattern matching for graphs with multi-Labeled nodes","volume":"109","author":"Shemshadi","year":"2016","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/IDA-194653_ref39","doi-asserted-by":"crossref","unstructured":"R. Milano, R. Baggio and R. Piattelli, The effects of online social media on tourism websites, ENTER2011 18th International Conference on Information Technology and Travel & Tourism, Congress und Messe Innsbruck GmbH, Innsbruck, Austria, 2011, pp. 471\u2013483.","DOI":"10.1007\/978-3-7091-0503-0_38"},{"key":"10.3233\/IDA-194653_ref40","doi-asserted-by":"crossref","unstructured":"G. Liu, Y. Wang and M.A. Orgun, Optimal social trust path selection in complex social networks, AAAI Conference on Artificial Intelligence, AAAI, Atlanta, GA, 2010.","DOI":"10.1609\/aaai.v24i1.7509"},{"key":"10.3233\/IDA-194653_ref41","doi-asserted-by":"crossref","unstructured":"Q. Shi, G. Liu, K. Zheng, A. Liu, Z. Li, L. Zhao and X. Zhou, Multi-constrained top-K graph pattern matching in contextual social graphs, IEEE International Conference on Web Services, IEEE, Honolulu, HI, USA, 2017, pp. 588\u2013595.","DOI":"10.1109\/ICWS.2017.69"},{"issue":"6","key":"10.3233\/IDA-194653_ref42","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1109\/TKDE.2017.2785824","article-title":"MCS-GPM: Multi-constrained simulation based graph pattern matching in contextual social graphs","volume":"30","author":"Liu","year":"2018","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-194653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T19:37:58Z","timestamp":1741635478000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-194653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,15]]},"references-count":42,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.3233\/ida-194653","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"type":"print","value":"1088-467X"},{"type":"electronic","value":"1571-4128"}],"subject":[],"published":{"date-parts":[[2020,7,15]]}}}