{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T15:15:18Z","timestamp":1777130118240,"version":"3.51.4"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:00:00Z","timestamp":1649203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:00:00Z","timestamp":1649203200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ho Chi Minh City and the Department of Science and Technology","award":["23\/2021\/H\u0110-QKHCN"],"award-info":[{"award-number":["23\/2021\/H\u0110-QKHCN"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10489-022-03164-5","type":"journal-article","created":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T05:02:59Z","timestamp":1649221379000},"page":"17881-17895","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An efficient and scalable approach for mining subgraphs in a single large graph"],"prefix":"10.1007","volume":"52","author":[{"given":"Lam B. Q.","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loan T. T.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2723-1138","authenticated-orcid":false,"given":"Bay","family":"Vo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Zelinka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerry Chun-Wei","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hung Son","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,6]]},"reference":[{"key":"3164_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. very large data bases, VLDB, vol 1215, pp 487-499"},{"issue":"2","key":"3164_CR2","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/380995.381002","volume":"2","author":"J Han","year":"2000","unstructured":"Han J, Pei J (2000) Mining frequent patterns by pattern-growth: methodology and implications. ACM SIGKDD Explorations Newsl 2(2):14\u201320","journal-title":"ACM SIGKDD Explorations Newsl"},{"issue":"1","key":"3164_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min Knowl Disc 8(1):53\u201387","journal-title":"Data Min Knowl Disc"},{"issue":"10","key":"3164_CR4","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne G, Zhu J (2005) Fast algorithms for frequent itemset mining using fp-trees. IEEE Trans Knowl Data Eng 17(10):1347\u20131362","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"3164_CR5","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"3164_CR6","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ, Hsiao CJ (2005) Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans Knowl Data Eng 17(4):462\u2013478","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"8","key":"3164_CR7","doi-asserted-by":"publisher","first-page":"7196","DOI":"10.1016\/j.eswa.2012.01.062","volume":"39","author":"B Vo","year":"2012","unstructured":"Vo B, Hong TP, Le B (2012) DBV-Miner: A Dynamic Bit-Vector approach for fast mining frequent closed itemsets. Expert Syst Appl 39(8):7196\u20137206","journal-title":"Expert Syst Appl"},{"key":"3164_CR8","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.asoc.2016.01.010","volume":"41","author":"ZH Deng","year":"2016","unstructured":"Deng ZH (2016) DiffNodesets: An efficient structure for fast mining frequent itemsets. Appl Soft Comput 41:214\u2013223","journal-title":"Appl Soft Comput"},{"key":"3164_CR9","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.eswa.2017.10.039","volume":"96","author":"H Bui","year":"2018","unstructured":"Bui H, Vo B, Nguyen H, Nguyen-Hoang TA, Hong TP (2018) A weighted N-list-based method for mining frequent weighted itemsets. Expert Syst Appl 96:388\u2013405","journal-title":"Expert Syst Appl"},{"key":"3164_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.eswa.2018.03.041","volume":"105","author":"N Aryabarzan","year":"2018","unstructured":"Aryabarzan N, Minaei-Bidgoli B, Teshnehlab M (2018) negFIN: An efficient algorithm for fast mining frequent itemsets. Expert Syst Appl 105:129\u2013143","journal-title":"Expert Syst Appl"},{"key":"3164_CR11","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.eswa.2016.12.023","volume":"73","author":"B Vo","year":"2017","unstructured":"Vo B, Pham S, Le T, Deng ZH (2017) A novel approach for mining maximal frequent patterns. Expert Syst Appl 73:178\u2013186","journal-title":"Expert Syst Appl"},{"issue":"19","key":"3164_CR12","doi-asserted-by":"publisher","first-page":"6648","DOI":"10.1016\/j.eswa.2015.04.048","volume":"42","author":"T Le","year":"2015","unstructured":"Le T, Vo B (2015) An N-list-based algorithm for mining frequent closed patterns. Expert Syst Appl 42(19):6648\u20136657","journal-title":"Expert Syst Appl"},{"key":"3164_CR13","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ins.2019.05.006","volume":"495","author":"LT Nguyen","year":"2019","unstructured":"Nguyen LT, Vu VV, Lam MT, Duong TT, Manh LT, Nguyen TT, Fujita H (2019) An efficient method for mining high utility closed itemsets. Inf Sci 495:78\u201399","journal-title":"Inf Sci"},{"key":"3164_CR14","doi-asserted-by":"publisher","first-page":"90465","DOI":"10.1109\/ACCESS.2020.2994059","volume":"8","author":"B Vo","year":"2020","unstructured":"Vo B, Nguyen LV, Vu VV, Lam MT, Duong TT, Manh LT, Hong TP (2020) Mining correlated high utility itemsets in one phase. IEEE Access 8:90465\u201390477","journal-title":"IEEE Access"},{"key":"3164_CR15","doi-asserted-by":"crossref","unstructured":"Nouioua M, Fournier-Viger P, Wu CW, Lin JCW, Gan W (2021) FHUQI-Miner: Fast high utility quantitative itemset mining. Appl Intell: 1\u201325","DOI":"10.1007\/s10489-021-02204-w"},{"issue":"2","key":"3164_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3430767","volume":"12","author":"Y Baek","year":"2021","unstructured":"Baek Y, Yun U, Kim H, Nam H, Kim H, Lin JCW, Pedrycz W (2021) RHUPS: Mining recent high utility patterns with sliding window\u2013based arrival time control over data streams. ACM Trans Intell Syst Technol (TIST) 12(2):1\u201327","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"key":"3164_CR17","doi-asserted-by":"crossref","unstructured":"Gan W, Lin JCW, Zhang J, Fournier-Viger P, Chao HC, Philip SY (2020) Fast utility mining on sequence data. IEEE transactions on cybernetics 51(2):487\u2013500","DOI":"10.1109\/TCYB.2020.2970176"},{"issue":"3","key":"3164_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1080\/01969722.2016.1276774","volume":"48","author":"T Tran","year":"2017","unstructured":"Tran T, Vo B, Le TTN, Nguyen NT (2017) Text clustering using frequent weighted utility itemsets. Cybern Syst 48(3):193\u2013209","journal-title":"Cybern Syst"},{"key":"3164_CR19","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.ins.2019.07.005","volume":"504","author":"W Gan","year":"2019","unstructured":"Gan W, Lin JCW, Chao HC, Fujita H, Philip SY (2019) Correlated utility-based pattern mining. Inf Sci 504:470\u2013486","journal-title":"Inf Sci"},{"issue":"3","key":"3164_CR20","doi-asserted-by":"publisher","first-page":"3169","DOI":"10.1016\/j.eswa.2011.09.003","volume":"39","author":"JJ Jung","year":"2012","unstructured":"Jung JJ (2012) Constraint graph-based frequent pattern updating from temporal databases. Expert Syst Appl 39(3):3169\u20133173","journal-title":"Expert Syst Appl"},{"key":"3164_CR21","doi-asserted-by":"crossref","unstructured":"Elseidy M, Abdelhamid E, Skiadopoulos S, Kalnis P (2014) Grami: Frequent subgraph and pattern mining in a single large graph. Proc VLDB Endow 7(7):517-528","DOI":"10.14778\/2732286.2732289"},{"key":"3164_CR22","doi-asserted-by":"publisher","first-page":"103539","DOI":"10.1016\/j.engappai.2020.103539","volume":"90","author":"LB Nguyen","year":"2020","unstructured":"Nguyen LB, Vo B, Le NT, Snasel V, Zelinka I (2020) Fast and scalable algorithms for mining subgraphs in a single large graph. Eng Appl Artif Intell 90:103539","journal-title":"Eng Appl Artif Intell"},{"key":"3164_CR23","doi-asserted-by":"crossref","unstructured":"Abdelhamid E, Abdelaziz I, Kalnis P, Khayyat Z, Jamour F (2016) Scalemine: Scalable parallel frequent subgraph mining in a single large graph. In: SC\u201916: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE,\u00a0pp 716-727","DOI":"10.1109\/SC.2016.60"},{"issue":"2","key":"3164_CR24","doi-asserted-by":"publisher","first-page":"230","DOI":"10.3390\/app8020230","volume":"8","author":"F Qiao","year":"2018","unstructured":"Qiao F, Zhang X, Li P, Ding Z, Jia S, Wang H (2018) A parallel approach for frequent subgraph mining in a single large graph using spark. Appl Sci 8(2):230","journal-title":"Appl Sci"},{"key":"3164_CR25","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ins.2019.12.010","volume":"514","author":"NT Le","year":"2020","unstructured":"Le NT, Vo B, Nguyen LB, Fujita H, Le B (2020) Mining weighted subgraphs in a single large graph. Inf Sci 514:149\u2013165","journal-title":"Inf Sci"},{"key":"3164_CR26","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1016\/j.future.2016.06.034","volume":"105","author":"J Zeng","year":"2020","unstructured":"Zeng J, Yang LT, Lin M, Ning H, Ma J (2020) A survey: Cyber-physical-social systems and their system-level design methodology. Future Gener Comput Syst 105:1028\u20131042","journal-title":"Future Gener Comput Syst"},{"key":"3164_CR27","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.inffus.2019.02.004","volume":"50","author":"RX Ding","year":"2019","unstructured":"Ding RX, Wang X, Shang K, Herrera F (2019) Social network analysis-based conflict relationship investigation and conflict degree-based consensus reaching process for large scale decision making using sparse representation. Inf Fusion 50:251\u2013272","journal-title":"Inf Fusion"},{"key":"3164_CR28","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1016\/j.future.2017.10.021","volume":"105","author":"R Iqbal","year":"2020","unstructured":"Iqbal R, Doctor F, More B, Mahmud S, Yousuf U (2020) Big data analytics and computational intelligence for cyber\u2013physical systems: recent trends and state of the art applications. Future Gener Comput Syst 105:766\u2013778","journal-title":"Future Gener Comput Syst"},{"key":"3164_CR29","unstructured":"Yan X, Han J (2002) gspan: Graph-based substructure pattern mining. In: 2002 IEEE International Conference on Data Mining. Proc IEEE,\u00a0pp 721-724"},{"issue":"1","key":"3164_CR30","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J ACM (JACM) 23(1):31\u201342","journal-title":"J ACM (JACM)"},{"issue":"5","key":"3164_CR31","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1007\/s10618-016-0466-x","volume":"30","author":"N Talukder","year":"2016","unstructured":"Talukder N, Zaki MJ (2016) A distributed approach for graph mining in massive networks. Data Min Knowl Disc 30(5):1024\u20131052","journal-title":"Data Min Knowl Disc"},{"issue":"8","key":"3164_CR32","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1093\/comjnl\/bxv118","volume":"59","author":"X Zhao","year":"2016","unstructured":"Zhao X, Chen Y, Xiao C, Ishikawa Y, Tang J (2016) Frequent subgraph mining based on Pregel. Comput J 59(8):1113\u20131128","journal-title":"Comput J"},{"issue":"3","key":"3164_CR33","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M Kuramochi","year":"2005","unstructured":"Kuramochi M, Karypis G (2005) Finding frequent patterns in a large sparse graph. Data Min Knowl Disc 11(3):243\u2013271","journal-title":"Data Min Knowl Disc"},{"issue":"11","key":"3164_CR34","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1007\/s00607-015-0446-9","volume":"97","author":"S Shahrivari","year":"2015","unstructured":"Shahrivari S, Jalili S (2015) Distributed discovery of frequent subgraphs of a network using MapReduce. Computing 97(11):1101\u20131120","journal-title":"Computing"},{"key":"3164_CR35","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1016\/j.future.2017.03.013","volume":"105","author":"J Li","year":"2020","unstructured":"Li J, Liu Y, Pan J, Zhang P, Chen W, Wang L (2020) Map-balance-reduce: an improved parallel programming model for load balancing of MapReduce. Future Gener Comput Syst 105:993\u20131001","journal-title":"Future Gener Comput Syst"},{"issue":"3","key":"3164_CR36","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/TKDE.2014.2345408","volume":"27","author":"MA Bhuiyan","year":"2014","unstructured":"Bhuiyan MA, Al Hasan M (2014) An iterative MapReduce based frequent subgraph mining algorithm. IEEE Trans Knowl Data Eng 27(3):608\u2013620","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3164_CR37","unstructured":"Aridhi S, d\u2019Orazio L, Maddouri M, Mephu E (2014) A novel\u00a0mapreduce-based approach for distributed frequent subgraph mining. Reconnaissance de Formes et Intelligence Artificielle (RFIA)"},{"key":"3164_CR38","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.procs.2016.06.085","volume":"89","author":"A Dhiman","year":"2016","unstructured":"Dhiman A, Jain SK (2016) Optimizing frequent subgraph mining for single large graph. Procedia Comput Sci 89:378\u2013385","journal-title":"Procedia Comput Sci"},{"issue":"1","key":"3164_CR39","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1186\/s13040-018-0181-9","volume":"11","author":"A Mrzic","year":"2018","unstructured":"Mrzic A, Meysman P, Bittremieux W, Moris P, Cule B, Goethals B, Laukens K (2018) Grasping frequent subgraph mining for bioinformatics applications. BioData Min 11(1):20","journal-title":"BioData Min"},{"key":"3164_CR40","doi-asserted-by":"crossref","unstructured":"Nabti CE (2017) Subgraph Isomorphism Search in Massive Graph Data. Doctoral dissertation, University of de Lyon","DOI":"10.5220\/0005875002040213"},{"issue":"2","key":"3164_CR41","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10115-010-0376-y","volume":"28","author":"Y Jia","year":"2011","unstructured":"Jia Y, Zhang J, Huan J (2011) An efficient graph-mining method for complicated and noisy data with real-world applications. Knowl Inf Syst 28(2):423\u2013447","journal-title":"Knowl Inf Syst"},{"key":"3164_CR42","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.knosys.2011.12.002","volume":"27","author":"N Acosta-Mendoza","year":"2012","unstructured":"Acosta-Mendoza N, Gago-Alonso A, Medina-Pagola JE (2012) Frequent approximate subgraphs as features for graph-based image classification. Knowl Based Syst 27:381\u2013392","journal-title":"Knowl Based Syst"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03164-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03164-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03164-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T10:33:13Z","timestamp":1668853993000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03164-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,6]]},"references-count":42,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["3164"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03164-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,6]]},"assertion":[{"value":"28 December 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}