{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:28:44Z","timestamp":1781216924899,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819660070","type":"print"},{"value":"9789819660087","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-6008-7_6","type":"book-chapter","created":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T23:18:27Z","timestamp":1745450307000},"page":"70-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mining Erasable Patterns Using the Bitmap Method in Quantitative Component Databases"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7305-6492","authenticated-orcid":false,"given":"Tzung-Pei","family":"Hong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9046-4254","authenticated-orcid":false,"given":"Da","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5774-9552","authenticated-orcid":false,"given":"Wei-Ming","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1704-3408","authenticated-orcid":false,"given":"Yu-Chuan","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,21]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"6_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the Twentieth International Conference on Very Large Data Bases, Santiago, vol. 1215, pp. 487\u2013499 (1994)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"17392","DOI":"10.1109\/ACCESS.2017.2739749","volume":"5","author":"B Huynh","year":"2017","unstructured":"Huynh, B., Vo, B., Snasel, V.: An efficient parallel method for mining frequent closed sequential patterns. IEEE Access 5, 17392\u201317402 (2017)","journal-title":"IEEE Access"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Duong, H., Truong, T., Hoang, T., Lee, B.:U-HPAUSM: mining high probability average utility sequences in uncertain quantitative sequential databases. Eng. Appl. Artif. Intell. 141 (2025)","DOI":"10.1016\/j.engappai.2024.109742"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Deng, Z.H., Fang, G.D.: Mining top-rank-k frequent patterns. In: Proceedings of International Conference on Machine Learning and Cybernetics, vol. 2, pp. 851\u2013856. IEEE (2007)","DOI":"10.1109\/ICMLC.2007.4370261"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Yen, S.J., Lee, Y.S.: Mining high utility quantitative association rules. In: Proceedings of the Ninth International Conference on Data Warehousing and Knowledge Discovery, pp. 283\u2013292. Springer, Cham (2007)","DOI":"10.1007\/978-3-540-74553-2_26"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Deng, Z.H., Fang, G.D., Wang, Z.H., Xu, X.R.: Mining erasable itemsets. In: Proceedings of the Eighth International Conference on Machine Learning and Cybernetics, vol. 1, pp. 67\u201373. IEEE (2009)","DOI":"10.1109\/ICMLC.2009.5212520"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Deng, Z.H., Xu, X.R.: An efficient algorithm for mining erasable itemsets. In: Proceedings of the Sixth International Conference on Advanced Data Mining and Applications, pp. 214\u2013225. Springer, Cham (2010)","DOI":"10.1007\/978-3-642-17316-5_20"},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"4453","DOI":"10.1016\/j.eswa.2011.09.143","volume":"39","author":"ZH Deng","year":"2012","unstructured":"Deng, Z.H., Xu, X.R.: Fast mining erasable itemsets using NC_sets. Expert Syst. Appl. 39(4), 4453\u20134463 (2012)","journal-title":"Expert Syst. Appl."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.engappai.2013.09.002","volume":"27","author":"T Le","year":"2014","unstructured":"Le, T., Vo, B.: MEI: an efficient algorithm for mining erasable itemsets. Eng. Appl. Artif. Intell. 27, 155\u2013166 (2014)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Le, T., Vo, B., Coenen, F.: An efficient algorithm for mining erasable itemsets using the difference of NC-Sets. In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, pp. 2270\u20132274. IEEE (2013)","DOI":"10.1109\/SMC.2013.388"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.neucom.2016.06.045","volume":"214","author":"M Injadat","year":"2016","unstructured":"Injadat, M., Salo, F., Nassif, A.B.: Data mining techniques in social media: a survey. Neurocomputing 214, 654\u2013670 (2016)","journal-title":"Neurocomputing"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Yu, C.H., Ward, M.W., Morabito, M., Ding, W.: Crime forecasting using data mining techniques. In: Proceedings of the Eleventh IEEE International Conference on Data Mining Workshops, pp. 779\u2013786. IEEE (2011)","DOI":"10.1109\/ICDMW.2011.56"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/B978-0-08-044894-7.01318-X","volume":"7","author":"R Baker","year":"2010","unstructured":"Baker, R.: Data mining for education. Int. Encyclopedia of Educ. 7(3), 112\u2013118 (2010)","journal-title":"Int. Encyclopedia of Educ."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.22462\/04.06.2019.10","volume":"46","author":"T Ozyigit","year":"2019","unstructured":"Ozyigit, T., Yavuz, C., Egi, S.M., Pieri, M., Balestra, C., Marroni, A.: Clustering of recreational divers by their health conditions in a database of a citizen science project. Undersea Hyperbaric Med. 46, 171\u2013183 (2019)","journal-title":"Undersea Hyperbaric Med."},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"90465","DOI":"10.1109\/ACCESS.2020.2994059","volume":"8","author":"B Vo","year":"2020","unstructured":"Vo, B., et al.: Mining correlated high utility itemsets in one phase. IEEE Access 8, 90465\u201390477 (2020)","journal-title":"IEEE Access"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Hong, T.P., Chen, D., Huang, W.M., Tsai, Y.C.: Mining erasable itemsets from a product database with quantitative components. In: Proceedings of 11th Multidisciplinary International Social Networks Conference, pp. 62\u201366 (2024)","DOI":"10.1145\/3675669.3675698"},{"issue":"4","key":"6_CR18","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1002\/int.21580","volume":"28","author":"Z Deng","year":"2013","unstructured":"Deng, Z.: Mining top-rank-k erasable itemsets by PID_lists. Int. J. Intell. Syst. 28(4), 366\u2013379 (2013)","journal-title":"Int. J. Intell. Syst."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Nguyen, G., Le, T., Vo, B., Le, B.: A new approach for mining top-rank-k erasable itemsets. In: Proceedings of the Sixth Intelligent Information and Database Systems, vol. 8397, pp. 73\u201382. Springer, Cham (2014)","DOI":"10.1007\/978-3-319-05476-6_8"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.future.2017.07.035","volume":"80","author":"G Lee","year":"2018","unstructured":"Lee, G., Yun, U.: Single-pass based efficient erasable pattern mining using list data structure on dynamic incremental databases. Futur. Gener. Comput. Syst. 80, 12\u201328 (2018)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.engappai.2016.03.003","volume":"52","author":"G Lee","year":"2016","unstructured":"Lee, G., Yun, U., Ryang, H., Kim, D.: Erasable itemset mining over incremental databases with weight conditions. Eng. Appl. Artif. Intell. 52, 213\u2013234 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"38545","DOI":"10.1109\/ACCESS.2022.3165656","volume":"10","author":"TP Hong","year":"2022","unstructured":"Hong, T.P., Chiu, C.C., Su, J.H., Chen, C.H.: Applicable metamorphic testing for erasable-itemset mining. IEEE Access 10, 38545\u201338554 (2022)","journal-title":"IEEE Access"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"106029","DOI":"10.1109\/ACCESS.2021.3100584","volume":"9","author":"TP Hong","year":"2021","unstructured":"Hong, T.P., Huang, W.M., Lan, G.C., Chiang, M.C., Lin, J.C.W.: A bitmap approach for mining erasable itemsets. IEEE Access 9, 106029\u2013106038 (2021)","journal-title":"IEEE Access"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Li, H., Chen, H.: Improve frequent closed itemsets mining over data stream with bitmap. In: Proceedings of the Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel\/Distributed Computing, pp. 399\u2013404. IEEE (2008)","DOI":"10.1109\/SNPD.2008.31"},{"issue":"3","key":"6_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1839490.1839493","volume":"4","author":"J Chen","year":"2010","unstructured":"Chen, J., Xiao, K.: BISC: A bitmap itemset support counting approach for efficient frequent itemset mining. ACM Trans. Knowl. Discov. Data 4(3), 1\u201337 (2010)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"De Alwis, B., Malinga, S., Pradeeban, K., Weerasiri, D., Perera, S.: Horizontal format data mining with extended bitmaps. In: Proceedings of the International Conference of Soft Computing and Pattern Recognition, pp. 220\u2013223. IEEE (2010)","DOI":"10.1109\/SOCPAR.2010.5686156"},{"issue":"1","key":"6_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/ijdwm.2014010101","volume":"10","author":"W Song","year":"2014","unstructured":"Song, W., Liu, Y., Li, J.: BAHUI: fast and memory efficient mining of high utility itemsets based on bitmap. Int. J. Data Warehouse. Min. 10(1), 1\u201315 (2014)","journal-title":"Int. J. Data Warehouse. Min."},{"key":"6_CR28","unstructured":"IBM Quest Data Mining Projection, Quest synthetic data generation code (1996). https:\/\/github.com\/zakimjz\/IBMGenerator"},{"key":"6_CR29","unstructured":"Frequent Itemsets Mining Dataset Repository. http:\/\/fimi.cs.helsinki.fi\/data\/"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-6008-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T05:20:26Z","timestamp":1778649626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-6008-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819660070","9789819660087"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-6008-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ACIIDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Intelligent Information and Database Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kitakyushu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"23 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aciids2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aciids.pwr.edu.pl\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}