{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:01:59Z","timestamp":1786978919229,"version":"3.56.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032022141","type":"print"},{"value":"9783032022158","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T00:00:00Z","timestamp":1755561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T00:00:00Z","timestamp":1755561600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-02215-8_7","type":"book-chapter","created":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T17:29:40Z","timestamp":1755624580000},"page":"102-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Enhanced FP-Growth Algorithm with\u00a0Hybrid Adaptive Support Threshold for\u00a0Association Rule Mining"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1949-7048","authenticated-orcid":false,"given":"Kanda Runapongsa","family":"Saikaew","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7541-9127","authenticated-orcid":false,"given":"Carson K.","family":"Leung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9257-6415","authenticated-orcid":false,"given":"Kritbodin","family":"Phiwhorm","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,19]]},"reference":[{"key":"7_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994, pp. 487\u2013499 (1994)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Brijs, T., et al.: Using association rules for product assortment decisions: a case study. In: ACM KDD 1999, pp. 254\u2013260 (1999)","DOI":"10.1145\/312129.312241"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Capillar, E., et al.: Bitwise vertical mining of minimal rare patterns. In: DaWaK 2023. LNCS, vol. 14148, pp.\u00a0135\u2013141 (2023)","DOI":"10.1007\/978-3-031-39831-5_13"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Czubryt, T.J., et al.: Q-VIPER: quantitative vertical bitwise algorithm to mine frequent patterns. In: DaWaK 2022. LNCS, vol. 13428, pp.\u00a0219\u2013233 (2022)","DOI":"10.1007\/978-3-031-12670-3_19"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-642-37487-6_33","volume-title":"Database Systems for Advanced Applications","author":"CK-S Leung","year":"2013","unstructured":"Leung, C.K.-S., Hayduk, Y.: Mining frequent patterns from uncertain data with MapReduce for big data analytics. In: Meng, W., Feng, L., Bressan, S., Winiwarter, W., Song, W. (eds.) DASFAA 2013. LNCS, vol. 7825, pp. 440\u2013455. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37487-6_33"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Madill, E.W.R., et al.: Enhanced sliding window-based periodic pattern mining from dynamic streams. In: DaWaK 2022. LNCS, vol. 13428, pp.\u00a0234\u2013240 (2022)","DOI":"10.1007\/978-3-031-12670-3_20"},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10489-024-06137-y","volume":"55","author":"RA Rizvee","year":"2025","unstructured":"Rizvee, R.A., et al.: A tree-based framework to mine top-k closed sequential patterns. Appl. Intell. 55(3), 221 (2025)","journal-title":"Appl. Intell."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Han, J., et al.: Mining frequent patterns without candidate generation. In: ACM SIGMOD 2000, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-021-00538-3","volume":"8","author":"E Hikmawati","year":"2021","unstructured":"Hikmawati, E., Maulidevi, N.U., Surendro, K.: Minimum threshold determination method based on dataset characteristics in association rule mining. J. Big Data 8(1), 1\u201317 (2021). https:\/\/doi.org\/10.1186\/s40537-021-00538-3","journal-title":"J. Big Data"},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.56705\/ijodas.v5i2.134","volume":"5","author":"M Ogedengbe","year":"2024","unstructured":"Ogedengbe, M., et al.: Adaptive minimum support threshold for association rule mining. Indonesian J. Data Sci. 5(2), 101\u2013108 (2024)","journal-title":"Indonesian J. Data Sci."},{"key":"7_CR11","unstructured":"Grahne, G., Zhu, J.: High performance mining of maximal frequent itemsets. In: SIAM SDM 2003 Workshop on HPDM (2003)"},{"key":"7_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.105151","volume":"115","author":"M Ganaie","year":"2022","unstructured":"Ganaie, M., et al.: Ensemble deep learning: a review. Eng. Appl. Artif. Intell. 115, 105151 (2022)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"7_CR13","volume":"7","author":"E Kaya","year":"2022","unstructured":"Kaya, E., Guneyi, E.: Optimizing ensemble weights and hyperparameters of machine learning models for regression problems. Mach. Learn. Appl. 7, 100251 (2022)","journal-title":"Mach. Learn. Appl."},{"key":"7_CR14","unstructured":"Kelly, M., et al.: The UCI machine learning repository (2025). https:\/\/archive.ics.uci.edu"},{"key":"7_CR15","unstructured":"Goethals, B., Zaki, M.: Proceedings of IEEE ICDM Workshop on FIMI 2003 (2003). https:\/\/ceur-ws.org\/Vol-90\/"}],"container-title":["Lecture Notes in Computer Science","Big Data Analytics and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-02215-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T16:03:57Z","timestamp":1784995437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-02215-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,19]]},"ISBN":["9783032022141","9783032022158"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-02215-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,19]]},"assertion":[{"value":"19 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare. We acknowledge the use of AI-assisted tools (Claude and Gemini) for grammar checking, proofreading, and language refinement. However, all scientific content, analyses, and conclusions presented in this paper were verified and approved by the authors.","order":1,"name":"Ethics","label":"Disclosure of Interests","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"DaWaK","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Big Data Analytics and Knowledge Discovery","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangkok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dawak2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dexa.org\/2025\/dawak2025.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}