{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:16:58Z","timestamp":1740097018029,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319112886"},{"type":"electronic","value":"9783319112893"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11289-3_52","type":"book-chapter","created":{"date-parts":[[2014,9,4]],"date-time":"2014-09-04T21:07:33Z","timestamp":1409864853000},"page":"515-523","source":"Crossref","is-referenced-by-count":0,"title":["Subsume Concept in Erasable Itemset Mining"],"prefix":"10.1007","author":[{"given":"Giang","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Tuong","family":"Le","sequence":"additional","affiliation":[]},{"given":"Bay","family":"Vo","sequence":"additional","affiliation":[]},{"given":"Bac","family":"Le","sequence":"additional","affiliation":[]},{"given":"Phi-Cuong","family":"Trinh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"52_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994, pp. 487\u2013499 (1994)"},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between set of items in large databases. In: SIGMOD 1993, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"issue":"4","key":"52_CR3","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1002\/int.21580","volume":"28","author":"Z.H. Deng","year":"2013","unstructured":"Deng, Z.H.: Mining top-rank-k erasable itemsets by PID_lists. International Journal of Intelligent Systems\u00a028(4), 366\u2013379 (2013)","journal-title":"International Journal of Intelligent Systems"},{"issue":"4","key":"52_CR4","doi-asserted-by":"publisher","first-page":"4453","DOI":"10.1016\/j.eswa.2011.09.143","volume":"39","author":"Z.H. Deng","year":"2012","unstructured":"Deng, Z.H., Xu, X.R.: Fast mining erasable itemsets using NC_sets. Expert Systems with Applications\u00a039(4), 4453\u20134463 (2012)","journal-title":"Expert Systems with Applications"},{"key":"52_CR5","unstructured":"Deng, Z., Fang, G., Wang, Z., Xu, X.: Mining erasable itemsets. In: ICMLC 2009, pp. 67\u201373 (2009)"},{"key":"52_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-17316-5_20","volume-title":"Advanced Data Mining and Applications","author":"Z. Deng","year":"2010","unstructured":"Deng, Z., Xu, X.: An efficient algorithm for mining erasable itemsets. In: Cao, L., Feng, Y., Zhong, J. (eds.) ADMA 2010, Part I. LNCS, vol.\u00a06440, pp. 214\u2013225. Springer, Heidelberg (2010)"},{"key":"52_CR7","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD 2000, pp. 1\u201312 (2003)","DOI":"10.1145\/335191.335372"},{"key":"52_CR8","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: IEEE SMC 2013, Manchester, UK, pp. 2270\u20132274 (2013)","DOI":"10.1109\/SMC.2013.388"},{"key":"52_CR9","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. Engineering Applications of Artificial Intelligence\u00a027, 155\u2013166 (2014)","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"52_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-05476-6_8","volume-title":"Intelligent Information and Database Systems","author":"G. Nguyen","year":"2014","unstructured":"Nguyen, G., Le, T., Vo, B., Le, B.: A new approach for mining top-rank-k erasable itemsets. In: Nguyen, N.T., Attachoo, B., Trawi\u0144ski, B., Somboonviwat, K. (eds.) ACIIDS 2014, Part I. LNCS, vol.\u00a08397, pp. 73\u201382. Springer, Heidelberg (2014)"},{"key":"52_CR11","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/j.knosys.2008.03.011","volume":"21","author":"W. Song","year":"2008","unstructured":"Song, W., Yang, B., Xu, Z.: Index-BitTableFI: An improved algorithm for mining frequent itemsets. Knowledge-Based Systems\u00a021, 507\u2013513 (2008)","journal-title":"Knowledge-Based Systems"},{"issue":"2","key":"52_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s40595-013-0012-3","volume":"1","author":"T.-T. Van","year":"2014","unstructured":"Van, T.-T., Vo, B., Le, B.: IMSR_PreTree: an improved algorithm for mining sequential rules based on the prefix-tree. \u00a0Vietnam J. Computer Science\u00a01(2), 97\u2013105 (2014)","journal-title":"\u00a0Vietnam J. Computer Science"},{"key":"52_CR13","doi-asserted-by":"crossref","unstructured":"Vo, B., Coenen, F., Le, T., Hong, T.-P.: A hybrid approach for mining frequent itemsets. In: IEEE SMC 2013, Manchester, UK, pp. 4647\u20134651 (2013)","DOI":"10.1109\/SMC.2013.791"},{"key":"52_CR14","doi-asserted-by":"crossref","unstructured":"Vo, B., Le, T., Coenen, F., Hong, T.-P.: Mining frequent itemsets using the N-list and subsume concepts. International Journal of Machine Learning and Cybernetics, \n                    \n                      http:\/\/dx.doi.org\/10.1007\/s13042-014-0252-2","DOI":"10.1007\/s13042-014-0252-2"},{"issue":"3","key":"52_CR15","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"M.J. Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering\u00a012(3), 372\u2013390 (2000)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"52_CR16","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. In: SIGKDD 2003, pp. 326\u2013335 (2003)","DOI":"10.1145\/956755.956788"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence. Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11289-3_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:22:48Z","timestamp":1558974168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11289-3_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319112886","9783319112893"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11289-3_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}