{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T05:59:52Z","timestamp":1768715992229,"version":"3.49.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T00:00:00Z","timestamp":1649721600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T00:00:00Z","timestamp":1649721600000},"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,1]]},"DOI":"10.1007\/s10489-022-03385-8","type":"journal-article","created":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T21:02:51Z","timestamp":1649797371000},"page":"49-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["UGMINE: utility-based graph mining"],"prefix":"10.1007","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9543-4503","authenticated-orcid":false,"given":"Md. Tanvir","family":"Alam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6101-4591","authenticated-orcid":false,"given":"Chowdhury Farhan","family":"Ahmed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Ashraful","family":"Islam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7541-9127","authenticated-orcid":false,"given":"Carson K.","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,12]]},"reference":[{"issue":"12","key":"3385_CR1","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed CF, Tanbeer SK, Jeong B, Lee Y (2009) Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans Knowl Data Eng 21(12):1708\u20131721","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"3385_CR2","doi-asserted-by":"publisher","first-page":"676","DOI":"10.4218\/etrij.10.1510.0066","volume":"32","author":"CF Ahmed","year":"2010","unstructured":"Ahmed CF, Tanbeer SK, Jeong BS (2010) A novel approach for mining high-utility sequential patterns in sequence databases. ETRI J 32(5):676\u2013686","journal-title":"ETRI J"},{"issue":"2","key":"3385_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10489-009-0188-5","volume":"34","author":"CF Ahmed","year":"2011","unstructured":"Ahmed CF, Tanbeer SK, Jeong BS, Lee YK (2011) HUC-Prune: an efficient candidate pruning technique to mine high utility patterns. Appl Intell 34(2):181\u2013198","journal-title":"Appl Intell"},{"key":"3385_CR4","doi-asserted-by":"crossref","unstructured":"Bogdanov P, Mongiov\u00ec M, Singh AK (2011) Mining heavy subgraphs in time-evolving networks. In: 2011 IEEE 11th international conference on data mining. IEEE, pp 81\u201390","DOI":"10.1109\/ICDM.2011.101"},{"key":"3385_CR5","doi-asserted-by":"crossref","unstructured":"Cai C, Fu A, Cheng C, Kwong W (1998) Mining association rules with weighted items. In: IDEAS\u201998, pp 68\u201377","DOI":"10.1109\/IDEAS.1998.694360"},{"issue":"2","key":"3385_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/TKDE.2018.2830336","volume":"31","author":"Y Chen","year":"2019","unstructured":"Chen Y, Zhao X, Lin X, Wang Y, Guo D (2019) Efficient mining of frequent patterns on uncertain graphs. IEEE Trans Knowl Data Eng 31(2):287\u2013300","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"3385_CR7","doi-asserted-by":"publisher","first-page":"9.1","DOI":"10.1145\/3473042","volume":"13","author":"MES Chowdhury","year":"2022","unstructured":"Chowdhury MES, Ahmed CF, Leung CK (2022) A new approach for mining correlated frequent subgraphs. ACM Trans Manag Inf Syst 13(1):9.1\u20139.28","journal-title":"ACM Trans Manag Inf Syst"},{"key":"3385_CR8","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu CW, Zida S, Tseng VS (2014) Fhm: Faster high-utility itemset mining using estimated utility co-occurrence pruning. In: International symposium on methodologies for intelligent systems. Springer, pp 83\u201392","DOI":"10.1007\/978-3-319-08326-1_9"},{"issue":"3","key":"3385_CR9","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1109\/TCYB.2019.2896267","volume":"50","author":"W Gan","year":"2020","unstructured":"Gan W, Lin JCW, Fournier-Viger P, Chao HC, Philip SY (2020) Huopm: High-utility occupancy pattern mining. IEEE Tran Cyber 50(3):1195\u20131208","journal-title":"IEEE Tran Cyber"},{"issue":"2","key":"3385_CR10","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1109\/TCYB.2020.2970176","volume":"51","author":"W Gan","year":"2020","unstructured":"Gan W, Lin JCW, Zhang J, Fournier-Viger P, Chao HC, Yu PS (2020) Fast utility mining on sequence data. IEEE Tran Cyber 51(2):487\u2013500","journal-title":"IEEE Tran Cyber"},{"key":"3385_CR11","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. In: Data mining and knowledge discovery, vol 8. Springer, pp 53\u201387","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"3385_CR12","doi-asserted-by":"crossref","unstructured":"Islam MA, Ahmed CF, Leung CK, Hoi CS (2018) WFSM-MaxPWS: an efficient approach for mining weighted frequent subgraphs from edge-weighted graph databases. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, pp 664\u2013676","DOI":"10.1007\/978-3-319-93040-4_52"},{"key":"3385_CR13","doi-asserted-by":"crossref","unstructured":"Jiang C, Coenen F, Zito M (2010) Frequent sub-graph mining on edge weighted graphs. In: International conference on data warehousing and knowledge discovery. Springer, pp 77\u201388","DOI":"10.1007\/978-3-642-15105-7_7"},{"key":"3385_CR14","doi-asserted-by":"crossref","unstructured":"Khare A, Goyal V, Baride S, Prasad SK, McDermott M, Shah D (2017) Distributed algorithm for high-utility subgraph pattern mining over big data platforms. In: 2017 IEEE 24th international conference on high performance computing (HiPC). IEEE, pp 263\u2013272","DOI":"10.1109\/HiPC.2017.00038"},{"key":"3385_CR15","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: Proceedings 2001 IEEE International Conference on Data Mining. IEEE, pp 313\u2013320","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"2","key":"3385_CR16","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s10489-014-0530-4","volume":"41","author":"GC Lan","year":"2014","unstructured":"Lan GC, Hong TP, Lee HY (2014) An efficient approach for finding weighted sequential patterns from sequence databases. Appl Intell 41(2):439\u2013452","journal-title":"Appl Intell"},{"key":"3385_CR17","doi-asserted-by":"crossref","unstructured":"Lan GC, Hong TP, Lee HY, Wang SL, Tsai CW (2013) Enhancing the efficiency in mining weighted frequent itemsets. In: 2013 IEEE International conference on systems, man, and cybernetics, pp 1104\u20131108","DOI":"10.1109\/SMC.2013.192"},{"key":"3385_CR18","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"},{"issue":"6","key":"3385_CR19","doi-asserted-by":"publisher","first-page":"7419","DOI":"10.1016\/j.eswa.2010.12.082","volume":"38","author":"CW Lin","year":"2011","unstructured":"Lin CW, Hong TP, Lu WH (2011) An effective tree structure for mining high utility itemsets. Expert Syst Appl 38(6):7419\u20137424","journal-title":"Expert Syst Appl"},{"issue":"3","key":"3385_CR20","first-page":"60.1","volume":"16","author":"JCW Lin","year":"2021","unstructured":"Lin JCW, Djenouri Y, Srivastava G, Li Y, Yu PS (2021) Scalable mining of high-utility sequential patterns with three-tier MapReduce model. ACM Trans Knowl Discov Data 16(3):60.1\u201360.26","journal-title":"ACM Trans Knowl Discov Data"},{"key":"3385_CR21","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao WK, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: PAKDD. Springer, pp 689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"3385_CR22","doi-asserted-by":"crossref","unstructured":"Malliaros FD, Skianis K (2015) Graph-based term weighting for text categorization. In: IEEE\/ACM International conference on advances in social networks analysis and mining, pp 1473\u20131479","DOI":"10.1145\/2808797.2808872"},{"key":"3385_CR23","doi-asserted-by":"publisher","first-page":"6785","DOI":"10.1007\/s10489-021-02204-w","volume":"51","author":"M Nouioua","year":"2021","unstructured":"Nouioua M, Fournier-Viger P, Wu CW, Lin JCW, Gan W (2021) FHUQI-Miner: Fast high utility quantitative itemset mining. Appl Intell 51:6785\u20136809","journal-title":"Appl Intell"},{"key":"3385_CR24","unstructured":"Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu MC (2001) PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In: Proceedings 17th international conference on data engineering. IEEE, pp 215\u2013224"},{"key":"3385_CR25","doi-asserted-by":"crossref","unstructured":"Pramanik S, Goswami A (2021) Discovery of closed high utility itemsets using a fast nature-inspired ant colony algorithm. Appl Intell:1\u201317","DOI":"10.1007\/s10489-021-02922-1"},{"key":"3385_CR26","unstructured":"Preti G, Lissandrini M, Mottin D, Velegrakis Y (2018) Beyond frequencies: Graph pattern mining in multi-weighted graphs. In: EDBT, pp 169\u2013180"},{"key":"3385_CR27","doi-asserted-by":"crossref","unstructured":"Rozenshtein P, Gionis A (2019) Mining temporal networks. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. ACM, pp 3225\u20133226","DOI":"10.1145\/3292500.3332295"},{"issue":"3","key":"3385_CR28","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1007\/s10489-018-1316-x","volume":"49","author":"K Singh","year":"2019","unstructured":"Singh K, Singh SS, Kumar A, Biswas B (2019) TKEH: an efficient algorithm for mining top-k high utility itemsets. Appl Intell 49(3):1078\u20131097","journal-title":"Appl Intell"},{"key":"3385_CR29","doi-asserted-by":"crossref","unstructured":"Singh K, Singh SS, Kumar A, Shakya HK, Biswas B (2018) CHN: an efficient algorithm for mining closed high utility itemsets with negative utility. IEEE Trans Knowl Data Eng:1\u20131","DOI":"10.1109\/TKDE.2018.2882421"},{"key":"3385_CR30","doi-asserted-by":"crossref","unstructured":"Song W, Zheng C, Huang C, Liu L (2021) Heuristically mining the top-k high-utility itemsets with cross-entropy optimization. Appl Intell:1\u201316","DOI":"10.1007\/s10489-021-02576-z"},{"key":"3385_CR31","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R (1996) Mining sequential patterns: Generalizations and performance improvements. In: International conference on extending database technology. Springer, pp 1\u201317","DOI":"10.1007\/BFb0014140"},{"key":"3385_CR32","unstructured":"Srikant R, Vu Q, Agrawal R (1997) Mining association rules with item constraints. In: KDD\u201997, pp 67\u201373"},{"key":"3385_CR33","doi-asserted-by":"crossref","unstructured":"Tao F, Murtagh F, Farid M (2003) Weighted association rule mining using weighted support and significance framework. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, pp 661\u2013666","DOI":"10.1145\/956750.956836"},{"issue":"2","key":"3385_CR34","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TKDE.2018.2833478","volume":"31","author":"T Truong","year":"2019","unstructured":"Truong T, Duong H, Le B, Fournier-Viger P (2019) Efficient vertical mining of high average-utility itemsets based on novel upper-bounds. IEEE Trans Knowl Data Eng 31(2):301\u2013314","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3385_CR35","doi-asserted-by":"crossref","unstructured":"Tung N, Nguyen LT, Nguyen TD, Vo B (2021) An efficient method for mining multi-level high utility itemsets. Appl Intell:1\u201322","DOI":"10.1007\/s10489-021-02681-z"},{"issue":"4","key":"3385_CR36","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1016\/j.eswa.2012.08.065","volume":"40","author":"B Vo","year":"2013","unstructured":"Vo B, Coenen F, Le B (2013) A new method for mining frequent weighted itemsets based on WIT-trees. Expert Syst Appl 40(4):1256\u20131264","journal-title":"Expert Syst Appl"},{"issue":"3","key":"3385_CR37","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10115-007-0103-5","volume":"14","author":"N Wale","year":"2008","unstructured":"Wale N, Watson IA, Karypis G (2008) Comparison of descriptor spaces for chemical compound retrieval and classification. Knowl Inf Syst 14(3):347\u2013375","journal-title":"Knowl Inf Syst"},{"issue":"4","key":"3385_CR38","first-page":"43:1","volume":"11","author":"JZ Wang","year":"2020","unstructured":"Wang JZ, Chen YC, Shih WY, Yang L, Liu YS, Huang JL (2020) Mining high-utility temporal patterns on time interval\u2013based data. ACM Trans Intell Syst Technol (TIST) 11(4):43:1\u201343:31","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"issue":"5","key":"3385_CR39","first-page":"55:1","volume":"9","author":"JZ Wang","year":"2018","unstructured":"Wang JZ, Huang JL (2018) On incremental high utility sequential pattern mining. ACM Trans Intell Syst Technol (TIST) 9(5):55:1\u201355:26","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"key":"3385_CR40","doi-asserted-by":"crossref","unstructured":"Wang W, Yang J, Yu PS (2000) Efficient mining of weighted association rules (WAR). In: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, pp 270\u2013274","DOI":"10.1145\/347090.347149"},{"issue":"6","key":"3385_CR41","doi-asserted-by":"publisher","first-page":"58.1","DOI":"10.1145\/3363571","volume":"13","author":"JMT Wu","year":"2019","unstructured":"Wu JMT, Lin JCW, Tamrakar A (2019) High-utility itemset mining with effective pruning strategies. ACM Trans Knowl Discov Data 13(6):58.1\u201358.22","journal-title":"ACM Trans Knowl Discov Data"},{"key":"3385_CR42","unstructured":"Yan X (2002) Han, j.: gspan: graph-based substructure pattern mining. In: ICDM. IEEE, pp 721\u2013724"},{"key":"3385_CR43","doi-asserted-by":"crossref","unstructured":"Yang J, Su W, Li S, Dalkilic MM (2012) WIGM: discovery of subgraph patterns in a large weighted graph. In: Proceedings of the 2012 SIAM International Conference on Data Mining. SIAM, pp 1083\u20131094","DOI":"10.1137\/1.9781611972825.93"},{"key":"3385_CR44","doi-asserted-by":"crossref","unstructured":"Yin J, Zheng Z, Cao L (2012) USpan: an efficient algorithm for mining high utility sequential patterns. In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 660\u2013668","DOI":"10.1145\/2339530.2339636"},{"issue":"2","key":"3385_CR45","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.knosys.2007.04.002","volume":"21","author":"U Yun","year":"2008","unstructured":"Yun U (2008) A new framework for detecting weighted sequential patterns in large sequence databases. Knowl-Based Syst 21(2):110\u2013122","journal-title":"Knowl-Based Syst"},{"key":"3385_CR46","doi-asserted-by":"crossref","unstructured":"Yun U, Leggett JJ (2006) WSpan: Weighted sequential pattern mining in large sequence databases. In: 2006 3rd international IEEE conference intelligent systems, pp 512\u2013517","DOI":"10.1109\/IS.2006.348472"},{"key":"3385_CR47","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ins.2020.07.043","volume":"543","author":"H Kim","year":"2021","unstructured":"Kim H, Yun U, Baek Y, Kim J, Vo B, Yoon E, Fujita H (2021) Efficient list based mining of high average utility patterns with maximum average pruning strategies. Inf Sci 543:85\u2013105","journal-title":"Inf Sci"},{"key":"3385_CR48","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.ins.2019.10.033","volume":"513","author":"W Gan","year":"2020","unstructured":"Gan W, Lin JCW, Zhang J, Chao HC, Fujita H, Yu PS (2020) ProUM: Projection-based utility mining on sequence data. Inf Sci 513:222\u2013240","journal-title":"Inf Sci"},{"key":"3385_CR49","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ins.2021.01.060","volume":"568","author":"T Truong","year":"2021","unstructured":"Truong T, Duong H, Le B, Fournier-Viger P, Yun U, Fujita H (2021) Efficient algorithms for mining frequent high utility sequences with constraints. Inf Sci 568:239\u2013264","journal-title":"Inf Sci"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03385-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03385-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03385-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T04:30:36Z","timestamp":1672720236000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03385-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,12]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["3385"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03385-8","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,12]]},"assertion":[{"value":"13 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}