{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:30:54Z","timestamp":1775010654925,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319419190","type":"print"},{"value":"9783319419206","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41920-6_15","type":"book-chapter","created":{"date-parts":[[2016,6,26]],"date-time":"2016-06-26T21:11:43Z","timestamp":1466975503000},"page":"199-213","source":"Crossref","is-referenced-by-count":52,"title":["EFIM-Closed: Fast and Memory Efficient Discovery of Closed High-Utility Itemsets"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Fournier-Viger","sequence":"first","affiliation":[]},{"given":"Souleymane","family":"Zida","sequence":"additional","affiliation":[]},{"given":"Jerry Chun-Wei","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Cheng-Wei","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Vincent S.","family":"Tseng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"key":"15_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. Int. Conf. Very Large Databases, pp. 487\u2013499 (1994)"},{"issue":"12","key":"15_CR2","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed, C.F., Tanbeer, S.K., Jeong, B.-S., Lee, Y.-K.: Efficient tree structures for high-utility pattern mining in incremental databases. IEEE Transactions on Knowledge and Data Engineering 21(12), 1708\u20131721 (2009)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"15_CR3","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. In: Proc. 21st Intern. Symp. on Methodologies for Intell. Syst., pp. 83\u201392 (2014)","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-642-53914-5_10","volume-title":"Advanced Data Mining and Applications","author":"P Fournier-Viger","year":"2013","unstructured":"Fournier-Viger, P., Gomariz, A., Gueniche, T., Mwamikazi, E., Thomas, R.: TKS: Efficient mining of top-K sequential patterns. In: Motoda, H., Wu, Z., Cao, L., Zaiane, O., Yao, M., Wang, W. (eds.) ADMA 2013, Part I. LNCS, vol. 8346, pp. 109\u2013120. Springer, Heidelberg (2013)"},{"key":"15_CR5","unstructured":"Fournier-Viger, P., Gomariz, A., Gueniche, T., Soltani, A., Wu., C., Tseng, V. S.: SPMF: a Java Open-Source Pattern Mining Library. Journal of Machine Learning Research (JMLR) 15, 3389\u20133393 (2014)"},{"issue":"1","key":"15_CR6","first-page":"85","volume":"38","author":"GC Lan","year":"2014","unstructured":"Lan, G.C., Hong, T.P., Tseng, V.S.: An efficient projection-based indexing approach for mining high utility itemsets. IEEE Transactions on Knowledge and Data Engineering 38(1), 85\u2013107 (2014)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Song, W., Liu, Y., Li, J.: BAHUI: Fast and memory efficient mining of high utility itemsets based on bitmap. Intern. Journal of Data Warehousing and Mining 10(1), 1\u201315 (2014)","DOI":"10.4018\/ijdwm.2014010101"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: Proc. 22nd ACM Intern. Conf. Info. and Know. Management, pp. 55\u201364 (2012)","DOI":"10.1145\/2396761.2396773"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1007\/11430919_79","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y Liu","year":"2005","unstructured":"Liu, Y., Liao, W., Choudhary, A.: A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets. In: Ho, T.B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 689\u2013695. Springer, Heidelberg (2005)"},{"issue":"8","key":"15_CR10","doi-asserted-by":"crossref","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 Transactions on Knowledge and Data Engineering 25(8), 1772\u20131786 (2013)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"3","key":"15_CR11","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1109\/TKDE.2014.2345377","volume":"27","author":"V Tseng","year":"2015","unstructured":"Tseng, V., Wu, C., Fournier-Viger, P., Yu, P.: Efficient algorithms for mining the concise and lossless representation of closed+ high utility itemsets. IEEE Transactions on Knowledge and Data Engineering 27(3), 726\u2013739 (2015)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: LCM ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Proc. ICDM 2004 Workshop on Frequent Itemset Mining Implementations. CEUR (2004)","DOI":"10.1145\/1133905.1133916"},{"issue":"8","key":"15_CR13","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1109\/TKDE.2007.1043","volume":"19","author":"J Wang","year":"2007","unstructured":"Wang, J., Han, J., Li, C.: Frequent closed sequence mining without candidate maintenance. IEEE Transactions on Knowledge and Data Engineering 19(8), 1042\u20131056 (2007)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"8","key":"15_CR14","first-page":"3861","volume":"41","author":"U Yun","year":"2014","unstructured":"Yun, U., Ryang, H., Ryu, K.H.: High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates. IEEE Transactions on Knowledge and Data Engineering 41(8), 3861\u20133878 (2014)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-319-21024-7_11","volume-title":"Machine Learning and Data Mining in Pattern Recognition","author":"S Zida","year":"2015","unstructured":"Zida, S., Fournier-Viger, P., Wu, C.-W., Lin, J.C.-W., Tseng, V.S.: Efficient mining of high-utility sequential rules. In: Perner, P. (ed.) MLDM 2015. LNCS, vol. 9166, pp. 157\u2013171. Springer, Heidelberg (2015)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41920-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T02:59:08Z","timestamp":1568084348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41920-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319419190","9783319419206"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41920-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}