{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:48:32Z","timestamp":1757616512982,"version":"3.44.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T00:00:00Z","timestamp":1712880000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T00:00:00Z","timestamp":1712880000000},"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":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s41060-024-00538-5","type":"journal-article","created":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T09:01:45Z","timestamp":1712912505000},"page":"1413-1424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An efficient join operations for utility list-based high-utility mining approaches using hybrid search technique"],"prefix":"10.1007","volume":"20","author":[{"given":"Rashmin","family":"Gajera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suresh","family":"Patel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khushbu","family":"Madhani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayush","family":"Solanki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,12]]},"reference":[{"issue":"1","key":"538_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: Current status and future directions. Data Min. Knowl. Discov. 15(1), 55\u201386 (2007)","journal-title":"Data Min. Knowl. Discov."},{"key":"538_CR2","unstructured":"Agrawal, R.S., Rakesh: Fast algorithms for mining association rules. In: Proceedings of 20th International Conference on Very Large Data Bases, VLDB, Vol. 1215, pp. 487\u2013499 (1994)"},{"key":"538_CR3","doi-asserted-by":"crossref","unstructured":"Liu, Y., Liao, W.-K., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: Pacific\u2013Asia Conference on Knowledge Discovery and Data Mining, Vol. 3518, pp. 689\u2013695 (2005)","DOI":"10.1007\/11430919_79"},{"issue":"3","key":"538_CR4","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.datak.2005.10.004","volume":"59","author":"H Hamilton","year":"2006","unstructured":"Hamilton, H., Hong, Y.: Mining itemset utilities from transaction databases. Data Knowl. Eng. 59(3), 603\u2013626 (2006)","journal-title":"Data Knowl. Eng."},{"issue":"2","key":"538_CR5","doi-asserted-by":"publisher","first-page":"395","DOI":"10.3233\/IDA-160811","volume":"20","author":"H Ryang","year":"2016","unstructured":"Ryang, H., Yun, U., Ryu, K.: Fast algorithm for high utility pattern mining with the sum of item quantities. Intell. Data Anal. 20(2), 395\u2013415 (2016)","journal-title":"Intell. Data Anal."},{"issue":"2","key":"538_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. ACM SIGMOD Rec. 29(2), 1\u201312 (2000)","journal-title":"ACM SIGMOD Rec."},{"issue":"11","key":"538_CR7","doi-asserted-by":"publisher","first-page":"3317","DOI":"10.1016\/j.patcog.2007.02.003","volume":"40","author":"J Hu","year":"2007","unstructured":"Hu, J., Mojsilovic, A.: High-utility pattern mining: a method for discovery of high-utility item sets. Pattern Recognit. 40(11), 3317\u20133324 (2007)","journal-title":"Pattern Recognit."},{"issue":"4","key":"538_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.17762\/ijritcc.v10i4.5524","volume":"10","author":"S Malla","year":"2022","unstructured":"Malla, S., Janaki, M., Reddy, R.M.V., Awatef, B.: A study on fish classification techniques using convolutional neural networks on highly challenged underwater images. Int. J. Recent Innov. Trends Comput. Commun. 10(4), 1\u20139 (2022)","journal-title":"Int. J. Recent Innov. Trends Comput. Commun."},{"key":"538_CR9","doi-asserted-by":"publisher","unstructured":"Tseng, V., Wu, C.-W., Shie, B.-E., Yu, P.: Up-growth: An efficient algorithm for high utility itemset mining (2010). https:\/\/doi.org\/10.1145\/1835804.1835839","DOI":"10.1145\/1835804.1835839"},{"key":"538_CR10","doi-asserted-by":"crossref","unstructured":"Qu, J.-F., Liu, M., Philippe, F.-V.: Efficient algorithms for high utility itemset mining without candidate generation. 51, 131\u2013160 (2019)","DOI":"10.1007\/978-3-030-04921-8_5"},{"issue":"1","key":"538_CR11","first-page":"1","volume":"12","author":"SF Shady","year":"2021","unstructured":"Shady, S.F.: Approaches to teaching a biomaterials laboratory course online. JOEE 12(1), 1\u20135 (2021)","journal-title":"JOEE"},{"key":"538_CR12","doi-asserted-by":"crossref","unstructured":"Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp. 55\u201364 (2012)","DOI":"10.1145\/2396761.2396773"},{"key":"538_CR13","unstructured":"Shen, Y.-D., Zhang, Z., Yang, Q.: Objective-oriented utility-based association mining. In: 2002 IEEE International Conference on Data Mining, pp. 426\u2013433 (2002)"},{"key":"538_CR14","doi-asserted-by":"crossref","unstructured":"Yao, H., Hamilton, H.J., Butz, C.J.: A foundational approach to mining itemset utilities from databases. In: Proceedings Of the 4th SIAM ICDM, pp. 482\u2013486 (2004)","DOI":"10.1137\/1.9781611972740.51"},{"key":"538_CR15","doi-asserted-by":"publisher","unstructured":"Ryang, H., Yun, U., Ryu, K.: Fast algorithm for high utility pattern mining with the sum of item quantities. Intell. Data Anal. 20, 395\u2013415 (2016). https:\/\/doi.org\/10.3233\/IDA-160811","DOI":"10.3233\/IDA-160811"},{"key":"538_CR16","doi-asserted-by":"crossref","unstructured":"Ahmed, C.F., Tanbeer, S.K., Jeong, B.-S., Lee, Y.-K.: An efficient candidate pruning technique for high utility pattern mining. In: Pacific\u2013Asia Conference on Knowledge Discovery and Data Mining, pp. 749\u2013756 (2009)","DOI":"10.1007\/978-3-642-01307-2_76"},{"issue":"8","key":"538_CR17","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2013","unstructured":"Tseng, V.S., Shie, B.-E., Wu, C.-W., Yu, P.S.: Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans. Knowl. Data Eng. 25(8), 1772\u20131786 (2013). https:\/\/doi.org\/10.1109\/TKDE.2012.59","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"538_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10489-013-0443-7","volume":"40","author":"W Song","year":"2014","unstructured":"Song, W., Liu, Y., Li, J.: Mining high utility itemsets by dynamically pruning the tree structure. Appl. Intell. 40(1), 29\u201343 (2014). https:\/\/doi.org\/10.1007\/s10489-013-0443-7","journal-title":"Appl. Intell."},{"key":"538_CR19","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Wu, C.-W., Zida, S., Tseng, V.S.: Fhm: faster high-utility itemset mining using estimated utility co-occurrence pruning, pp. 83\u201392 (2014)","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"538_CR20","doi-asserted-by":"crossref","unstructured":"Peng, A.Y., Koh, Y.S., Riddle, P.: mhuiminer: a fast high utility itemset mining algorithm for sparse datasets, pp. 196\u2013207 (2017)","DOI":"10.1007\/978-3-319-57529-2_16"},{"issue":"7","key":"538_CR21","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1007\/s10489-017-1057-2","volume":"48","author":"Q-H Duong","year":"2018","unstructured":"Duong, Q.-H., Fournier-Viger, P., Ramampiaro, H., N\u00f8rv\u00e5g, K., Dam, T.-L.: Efficient high utility itemset mining using buffered utility-lists. Appl. Intell. 48(7), 1859\u20131877 (2018). https:\/\/doi.org\/10.1007\/s10489-017-1057-2","journal-title":"Appl. Intell."},{"issue":"4","key":"538_CR22","first-page":"224","volume":"10","author":"S Patel","year":"2022","unstructured":"Patel, S., Shah, S., Patel, M.: An efficient high utility itemset mining approach using predicted utility co-exist pruning. Int. J. Intell. Syst. Appl. Eng. 10(4), 224\u2013230 (2022)","journal-title":"Int. J. Intell. Syst. Appl. Eng."},{"key":"538_CR23","doi-asserted-by":"publisher","first-page":"2947","DOI":"10.1007\/s10115-021-01614-z","volume":"63","author":"W Song","year":"2021","unstructured":"Song, W., Liu, L., Huang, C.: Generalized maximal utility for mining high average-utility itemsets. Knowl. Inf. Syst. 63, 2947\u20132967 (2021). https:\/\/doi.org\/10.1007\/s10115-021-01614-z","journal-title":"Knowl. Inf. Syst."},{"key":"538_CR24","doi-asserted-by":"publisher","first-page":"144245","DOI":"10.1109\/ACCESS.2019.2945840","volume":"7","author":"I Yildirim","year":"2019","unstructured":"Yildirim, I., Celik, M.: An efficient tree-based algorithm for mining high average-utility itemset. IEEE Access 7, 144245\u2013144263 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2945840","journal-title":"IEEE Access"},{"key":"538_CR25","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00354-019-00078-8","volume":"38","author":"I Yildirim","year":"2020","unstructured":"Yildirim, I., Celik, M.: Mining high-average utility itemsets with positive and negative external utilities. New Gener. Comput. 38, 153\u2013186 (2020). https:\/\/doi.org\/10.1007\/s00354-019-00078-8","journal-title":"New Gener. Comput."},{"key":"538_CR26","doi-asserted-by":"publisher","first-page":"6450","DOI":"10.1007\/s10489-021-02751-2","volume":"52","author":"JM Wu","year":"2022","unstructured":"Wu, J.M., Li, Z., Srivastava, G.E.A.: Analytics of high average-utility patterns in the industrial internet of things. Appl. Intell. 52, 6450\u20136463 (2022). https:\/\/doi.org\/10.1007\/s10489-021-02751-2","journal-title":"Appl. Intell."},{"issue":"2","key":"538_CR27","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.: Efficient vertical mining of high average-utility itemsets based on novel upper-bounds. IEEE Trans. Knowl. Data Eng. 31(2), 301\u2013314 (2019). https:\/\/doi.org\/10.1109\/TKDE.2018.2833478","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"538_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-023-07971-x","author":"MJK Kumar","year":"2023","unstructured":"Kumar, M.J.K., Rana, D.: Hauopm: High average utility occupancy pattern mining. Arab. J. Sci. Eng. (2023). https:\/\/doi.org\/10.1007\/s13369-023-07971-x","journal-title":"Arab. J. Sci. Eng."},{"key":"538_CR29","doi-asserted-by":"crossref","unstructured":"Patel, S., Shah, S.M., Patel, M.N.: An efficient search space exploration technique for high utility itemset mining. In: International Conference On Machine Learning and Data Engineering (2023)","DOI":"10.1016\/j.procs.2023.01.074"},{"key":"538_CR30","doi-asserted-by":"publisher","unstructured":"Fournier-Viger, P., et al.: The spmf open-source data mining library version. 2, 9853 (2016). https:\/\/doi.org\/10.1007\/978-3-319-46131-1_8","DOI":"10.1007\/978-3-319-46131-1_8"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-024-00538-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-024-00538-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-024-00538-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T19:08:08Z","timestamp":1757099288000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-024-00538-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,12]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["538"],"URL":"https:\/\/doi.org\/10.1007\/s41060-024-00538-5","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"type":"print","value":"2364-415X"},{"type":"electronic","value":"2364-4168"}],"subject":[],"published":{"date-parts":[[2024,4,12]]},"assertion":[{"value":"6 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}