{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T05:42:16Z","timestamp":1768714936141,"version":"3.49.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T00:00:00Z","timestamp":1678233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T00:00:00Z","timestamp":1678233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10489-023-04501-y","type":"journal-article","created":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T20:26:33Z","timestamp":1679862393000},"page":"19491-19504","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A novel approach to discover frequent weighted subgraphs using the average measure"],"prefix":"10.1007","volume":"53","author":[{"given":"Ngoc-Thao","family":"Le","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bay","family":"Vo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4306-6945","authenticated-orcid":false,"given":"Bac","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,8]]},"reference":[{"key":"4501_CR1","doi-asserted-by":"publisher","first-page":"103539","DOI":"10.1016\/j.engappai.2020.103539","volume":"90","author":"LBQ Nguyen","year":"2020","unstructured":"Nguyen LBQ, Vo B, Le N-T, 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":"4501_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ins.2019.12.010","volume":"514","author":"N-T Le","year":"2020","unstructured":"Le N-T, Vo B, Nguyen LBQ, Fujita H, Le B (2020) Mining weighted subgraphs in a single large graph. Inf Sci 514:149\u2013165","journal-title":"Inf Sci"},{"key":"4501_CR3","doi-asserted-by":"crossref","unstructured":"Le N-T, Vo B, Nguyen LBQ, Le B (2022) \u201cOWGraMi: Efficient Method for Mining Weighted Subgraphs in a Single Graph\u201d, Expert Systems with Applications","DOI":"10.1016\/j.eswa.2022.117625"},{"issue":"7","key":"4501_CR4","doi-asserted-by":"publisher","first-page":"517","DOI":"10.14778\/2732286.2732289","volume":"7","author":"M Elseidy","year":"2014","unstructured":"Elseidy M, Abdelhamid E, Skiadopoulos S, Kalnis P (2014) Grami: Frequent subgraph and pattern mining in a single large graph. Proc VLDB Endowm 7(7):517\u2013528","journal-title":"Proc VLDB Endowm"},{"key":"4501_CR5","unstructured":"Yan X, Han J (2002) \u201cgspan: Graph-based substructure pattern mining,\u201d in 2002 IEEE International Conference on Data Mining, 2002. Proceedings., pp. 721\u2013724."},{"key":"4501_CR6","doi-asserted-by":"publisher","DOI":"10.5220\/0005875002040213","volume-title":"Subgraph isomorphism search in massive graph databases","author":"C Nabti","year":"2016","unstructured":"Nabti C, Seba H (2016) Subgraph isomorphism search in massive graph databases. Universit\u00e9 de Lyon, Doctoral dissertation"},{"key":"4501_CR7","doi-asserted-by":"publisher","first-page":"7593","DOI":"10.1109\/ACCESS.2018.2801261","volume":"6","author":"JC-W Lin","year":"2018","unstructured":"Lin JC-W, Ren S, Fournier-Viger P (2018) MEMU: more efficient algorithm to mine high average-utility patterns with multiple minimum average-utility thresholds. IEEE Access 6:7593\u20137609","journal-title":"IEEE Access"},{"issue":"2","key":"4501_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3362070","volume":"1","author":"W Gan","year":"2020","unstructured":"Gan W, Lin JC-W, Zhang J, Yu PS (2020) Utility mining across multi-sequences with individualized thresholds. ACM Transac Data Sci 1(2):1\u201329","journal-title":"ACM Transac Data Sci"},{"key":"4501_CR9","unstructured":"Nguyen LBQ (2022) \u201cEfficient Methods for Mining Subgraphs in a Single Large Graph,\u201d Doctoral dissertation, VSB \u2013 Technical University of Ostrava"},{"key":"4501_CR10","unstructured":"Lin JC-W, Li T, Fournier-Viger P, Zhang J, Guo X, \u201cMining of high average-utility patterns with item-level thresholds\u201d, J Int Technol, vol. 20, no. 1, pp. 187\u2013194, 2019."},{"key":"4501_CR11","first-page":"487","volume":"1215","author":"R Agrawal","year":"1994","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. Proc 20th Int Conf Large Data Bases, VLDB 1215:487\u2013499","journal-title":"Proc 20th Int Conf Large Data Bases, VLDB"},{"issue":"10","key":"4501_CR12","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":"4","key":"4501_CR13","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ, Hsiao C-J (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":"4501_CR14","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 T-P, 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":"4501_CR15","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 T-A, Hong T-P (2018) A weighted N-list-based method for mining frequent weighted itemsets. Expert Syst Appl 96:388\u2013405","journal-title":"Expert Syst Appl"},{"key":"4501_CR16","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 Z-H (2017) A novel approach for mining maximal frequent patterns. Expert Syst Appl 73:178\u2013186","journal-title":"Expert Syst Appl"},{"key":"4501_CR17","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ins.2019.05.006","volume":"495","author":"LTT Nguyen","year":"2019","unstructured":"Nguyen LTT, Vu VV, Lam MTH, Duong TTM, Manh LT, Nguyen TTT, Vo B, Fujita H (2019) An efficient method for mining high utility closed itemsets. Inf Sci 495:78\u201399","journal-title":"Inf Sci"},{"key":"4501_CR18","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.knosys.2019.03.022","volume":"175","author":"LTT Nguyen","year":"2019","unstructured":"Nguyen LTT, Nguyen P, Nguyen TDD, Vo B, Fournier-Viger P, Tseng VS (2019) Mining high-utility itemsets in dynamic profit databases. Knowled-Based Syst 175:130\u2013144","journal-title":"Knowled-Based Syst"},{"key":"4501_CR19","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ins.2018.12.070","volume":"481","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger P, Zhang Y, Lin JC-W, Fujita H, Koh YS (2019) Mining local and peak high utility itemsets. Inf Sci 481:344\u2013367","journal-title":"Inf Sci"},{"key":"4501_CR20","doi-asserted-by":"publisher","first-page":"112897","DOI":"10.1016\/j.eswa.2019.112897","volume":"141","author":"X Wang","year":"2020","unstructured":"Wang X, Xu Y, Zhan H (2020) Extending association rules with graph patterns. Expert Syst Appl 141:112897","journal-title":"Expert Syst Appl"},{"key":"4501_CR21","doi-asserted-by":"crossref","unstructured":"Nguyen LBQ, Zelinka I, Snasel V, Nguyen LTT, Vo B (2022) \u201cSubgraph mining in a large graph: A review,\u201d Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, p. e1454","DOI":"10.1002\/widm.1454"},{"key":"4501_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10489-022-03164-5","volume":"52","author":"LBQ Nguyen","year":"2022","unstructured":"Nguyen LBQ, Nguyen LTT, Vo B, Zelinka I, Lin JCW, Yun U, Nguyen HS (2022) An efficient and scalable approach for mining subgraphs in a single large graph. Appl Intell 52:1\u201315","journal-title":"Appl Intell"},{"key":"4501_CR23","doi-asserted-by":"crossref","unstructured":"Talukder N, Zaki MJ (2016) \u201cParallel graph mining with dynamic load balancing,\u201d in 2016 IEEE International Conference on Big Data (Big Data). pp. 3352\u20133359","DOI":"10.1109\/BigData.2016.7840995"},{"key":"4501_CR24","doi-asserted-by":"crossref","unstructured":"Abdelhamid E, Abdelaziz I, Kalnis P, Khayyat Z, Jamour F (2016) \u201cScalemine: Scalable parallel frequent subgraph mining in a single large graph,\u201d in SC\u201916: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. pp. 716\u2013727","DOI":"10.1109\/SC.2016.60"},{"issue":"2","key":"4501_CR25","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"},{"issue":"6","key":"4501_CR26","first-page":"e1372","volume":"10","author":"P Fournier-Viger","year":"2020","unstructured":"Fournier-Viger P et al (2020) A survey of pattern mining in dynamic graphs. Wiley Interdiscip Rev: Data Mining Knowled Discover 10(6):e1372","journal-title":"Wiley Interdiscip Rev: Data Mining Knowled Discover"},{"issue":"1","key":"4501_CR27","first-page":"e1344","volume":"10","author":"W Pedrycz","year":"2020","unstructured":"Pedrycz W (2020) The benefits and drawbacks of data mining technologies. Wiley Interdiscip Rev: Data Mining Knowled Discover 10(1):e1344","journal-title":"Wiley Interdiscip Rev: Data Mining Knowled Discover"},{"issue":"2","key":"4501_CR28","doi-asserted-by":"publisher","first-page":"90","DOI":"10.13164\/mendel.2021.2.090","volume":"27","author":"LBQ Nguyen","year":"2021","unstructured":"Nguyen LBQ, Zelinka I, Diep QB (2021) CCGraMi: An Effective Method for Mining Frequent Subgraphs in a Single Large Graph. MENDEL 27(2):90\u201399","journal-title":"MENDEL"},{"key":"4501_CR29","doi-asserted-by":"crossref","unstructured":"Nguyen LBQ, Nguyen LTT, Zelinka I, Snasel V, Nguyen HS, Vo B (2021) \u201cA Method for Closed Frequent Subgraph Mining in a Single Large Graph\u201d, IEEE Access","DOI":"10.1109\/ACCESS.2021.3133666"},{"key":"4501_CR30","doi-asserted-by":"crossref","unstructured":"Teixeira CHC, Fonseca AJ, Serafini M, Siganos G, Zaki MJ, Aboulnaga A (2015) \u201cArabesque: a system for distributed graph mining\u201d, In: Proceedings of the 25th Symposium on Operating Systems Principles, pp. 425\u2013440","DOI":"10.1145\/2815400.2815410"},{"issue":"5","key":"4501_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":"4501_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":"4501_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"},{"key":"4501_CR34","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2004) \u201cGrew-a scalable frequent subgraph discovery algorithm,\u201d in Fourth IEEE International Conference on Data Mining (ICDM\u201904). pp. 439\u2013442","DOI":"10.21236\/ADA439436"},{"key":"4501_CR35","doi-asserted-by":"crossref","unstructured":"Chen C, Yan X, Zhu F, Han J (2007) \u201cgapprox: Mining frequent approximate patterns from a massive network\u201d, In: Seventh IEEE International Conference on Data Mining (ICDM 2007). pp. 445\u2013450","DOI":"10.1109\/ICDM.2007.36"},{"key":"4501_CR36","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.entcs.2020.10.005","volume":"354","author":"A Guzm\u00e1n-Ponce","year":"2020","unstructured":"Guzm\u00e1n-Ponce A, Marcial-Romero JR, Valdovinos-Rosas RM, S\u00e1nchez-Garreta JS (2020) Weighted complete graphs for condensing data. Electron Notes Theoret Comput Sci 354:45\u201360","journal-title":"Electron Notes Theoret Comput Sci"},{"issue":"3","key":"4501_CR37","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1631\/FITEE.1900127","volume":"21","author":"N Liu","year":"2020","unstructured":"Liu N, Li D, Zhang Y, Li X (2020) Large-scale graph processing systems: a survey. Front Inform Technol Electr Eng 21(3):384\u2013404","journal-title":"Front Inform Technol Electr Eng"},{"key":"4501_CR38","unstructured":"Sun L, Huang X, Li R, Choi B, Xu J (2020) \u201cIndex-based intimate-core community search in large weighted graphs,\u201d IEEE Transactions on Knowledge and Data Engineering"},{"issue":"6","key":"4501_CR39","doi-asserted-by":"publisher","first-page":"5984","DOI":"10.1007\/s11227-020-03488-4","volume":"77","author":"T Ramalingeswara Rao","year":"2021","unstructured":"Ramalingeswara Rao T, Ghosh SK, Goswami A (2021) Mining user\u2013user communities for a weighted bipartite network using spark GraphFrames and Flink Gelly. J Supercomput 77(6):5984\u20136035","journal-title":"J Supercomput"},{"issue":"2","key":"4501_CR40","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10619-019-07259-w","volume":"39","author":"G Preti","year":"2021","unstructured":"Preti G, Lissandrini M, Mottin D, Velegrakis Y (2021) Mining patterns in graphs with multiple weights. Distrib Paral Datab 39(2):281\u2013319","journal-title":"Distrib Paral Datab"},{"key":"4501_CR41","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.knosys.2016.09.013","volume":"113","author":"JC-W Lin","year":"2016","unstructured":"Lin JC-W, Gan W, Fournier-Viger P, Hong T-P, Zhan J (2016) Efficient mining of high-utility itemsets using multiple minimum utility thresholds. Knowl-Based Syst 113:100\u2013115","journal-title":"Knowl-Based Syst"},{"issue":"19","key":"4501_CR42","doi-asserted-by":"publisher","first-page":"9051","DOI":"10.3390\/app11199051","volume":"11","author":"X Liu","year":"2021","unstructured":"Liu X, Wang X (2021) Cohesive subgraph identification in weighted bipartite graphs. Appl Sci 11(19):9051","journal-title":"Appl Sci"},{"issue":"1","key":"4501_CR43","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/s10878-021-00823-0","volume":"44","author":"MA Raayatpanah","year":"2022","unstructured":"Raayatpanah MA, Khodayifar S, Weise T, Pardalos P (2022) A novel approach to subgraph selection with multiple weights on arcs. J Comb Optim 44(1):242\u2013268","journal-title":"J Comb Optim"},{"key":"4501_CR44","doi-asserted-by":"crossref","unstructured":"Hu Y, Xiao F (2022) \u201cTime Series Forecasting Based on Fuzzy Cognitive Visibility Graph and Weighted Multi-Subgraph Similarity,\u201d IEEE Transactions on Fuzzy Systems","DOI":"10.1109\/TFUZZ.2022.3198177"},{"key":"4501_CR45","doi-asserted-by":"publisher","first-page":"108084","DOI":"10.1016\/j.asoc.2021.108084","volume":"114","author":"M-W Li","year":"2022","unstructured":"Li M-W, Xu D-Y, Geng J, Hong W-C (2022) A hybrid approach for forecasting ship motion using CNN\u2013GRU\u2013AM and GCWOA. Appl Soft Comput 114:108084","journal-title":"Appl Soft Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04501-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04501-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04501-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T05:13:37Z","timestamp":1693199617000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04501-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,8]]},"references-count":45,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["4501"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04501-y","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,8]]},"assertion":[{"value":"2 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}