{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T09:12:55Z","timestamp":1780650775836,"version":"3.54.1"},"publisher-location":"Heidelberg","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319002927","type":"print"},{"value":"9783319002934","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-00293-4_29","type":"book-chapter","created":{"date-parts":[[2013,3,22]],"date-time":"2013-03-22T11:27:27Z","timestamp":1363951647000},"page":"379-390","source":"Crossref","is-referenced-by-count":7,"title":["Mining Frequent Weighted Closed Itemsets"],"prefix":"10.1007","author":[{"given":"Bay","family":"Vo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nhu-Y","family":"Tran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Duong-Ha","family":"Ngo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1007\/3-540-44957-4_65","volume-title":"Computational Logic - CL 2000","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 972\u2013986. Springer, Heidelberg (2000)"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Cai, C.H., Fu, A.W., Cheng, C.H., Kwong, W.W.: Mining Association Rules with Weighted Items. In: Proceedings of International Database Engineering and Applications Symposium (IDEAS 1998), pp. 68\u201377 (1998)","DOI":"10.1109\/IDEAS.1998.694360"},{"issue":"10","key":"29_CR3","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G. Grahne","year":"2005","unstructured":"Grahne, G., Zhu, J.: Fast Algorithms for Frequent Itemset Mining Using FP-Trees. IEEE Transaction on Knowledge and Data Engineering\u00a017(10), 1347\u20131362 (2005)","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Khan, M.S., Muyeba, M., Coenen, F.: A Weighted Utility Framework for Mining Association Rules. In: Proceedings of Second UKSIM European Symposium on Computer Modeling and Simulation Second UKSIM European Symposium on Computer Modeling and Simulation, pp. 87\u201392 (2008)","DOI":"10.1109\/EMS.2008.73"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Le, B., Nguyen, H., Cao, T.A., Vo, B.: A novel algorithm for mining high utility itemsets. In: The First Asian Conference on Intelligent Information and Database Systems, pp. 13\u201316 (2009) (published by IEEE)","DOI":"10.1109\/ACIIDS.2009.55"},{"issue":"2","key":"29_CR6","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1504\/IJIIDS.2011.038970","volume":"5","author":"B. Le","year":"2011","unstructured":"Le, B., Nguyen, H., Vo, B.: An Efficient Strategy for Mining High Utility Itemsets. International Journal of Intelligent Information and Database Systems\u00a05(2), 164\u2013176 (2011)","journal-title":"International Journal of Intelligent Information and Database Systems"},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"B. Lucchese","year":"2006","unstructured":"Lucchese, B., Orlando, S., Perego, R.: Fast and Memory Efficient Mining of Frequent Closed Itemsets. IEEE Transaction on Knowledge and Data Engineering\u00a018(1), 21\u201336 (2006)","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Moonestinghe, H.D.K., Fodeh, S., Tan, P.N.: Frequent Closed Itemsets Mining using Prefix Graphs with an Efficient Flow-based Pruning Strategy. In: Proceedings of 6th ICDM, Hong Kong, pp. 426\u2013435 (2006)","DOI":"10.1109\/ICDM.2006.74"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering Frequent Closed Itemsets for Association Rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient Mining of Association Rules using Closed Itemset Lattices. Information Systems\u00a024(1), 25\u201346 (1999)","journal-title":"Information Systems"},{"key":"29_CR11","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. In: Proc. of the 5th ACM-SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Dallas, Texas, USA, pp. 11\u201320 (2000)"},{"key":"29_CR12","unstructured":"Ramkumar, G.D., Ranka, S., Tsur, S.: Weighted Association Rules: Model and Algorithm. In: SIGKDD 1998, pp. 661\u2013666 (1998)"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Singh, N.G., Singh, S.R., Mahanta, A.K.: CloseMiner: Discovering Frequent Closed Itemsets using Frequent Closed Tidsets. In: Proc. of the 5th ICDM, Washington DC, USA, pp. 633\u2013636 (2005)","DOI":"10.1109\/ICDM.2005.41"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Tao, F., Murtagh, F., Farid, M.: Weighted Association Rule Mining using Weighted Support and Significance Framework. In: SIGKDD 2003, pp. 661\u2013666 (2003)","DOI":"10.1145\/956750.956836"},{"key":"29_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-30214-8_2","volume-title":"Discovery Science","author":"T. Uno","year":"2004","unstructured":"Uno, T., Asai, T., Uchida, Y., Arimura, H.: An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol.\u00a03245, pp. 16\u201331. Springer, Heidelberg (2004)"},{"issue":"1","key":"29_CR16","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1504\/IJISTA.2011.038265","volume":"10","author":"B. Vo","year":"2011","unstructured":"Vo, B., Le, B.: Mining Minimal Non-redundant Association Rules using Frequent Itemsets Lattice. Journal of Intelligent Systems Technology and Applications\u00a010(1), 92\u2013106 (2011)","journal-title":"Journal of Intelligent Systems Technology and Applications"},{"issue":"4","key":"29_CR17","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1016\/j.eswa.2012.08.065","volume":"40","author":"B. Vo","year":"2013","unstructured":"Vo, B., Coenen, F., Le, B.: A new method for mining Frequent Weighted Itemsets based on WIT-trees. Expert Systems with Applications\u00a040(4), 1256\u20131264 (2013)","journal-title":"Expert Systems with Applications"},{"issue":"10B","key":"29_CR18","first-page":"7117","volume":"8","author":"B. Vo","year":"2012","unstructured":"Vo, B., Hong, T.P., Le, B.: Mining most generalization association rules based on frequent closed itemsets. Int. J. of Innovative Computing Information and Control\u00a08(10B), 7117\u20137132 (2012)","journal-title":"Int. J. of Innovative Computing Information and Control"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 236\u2013245 (2003)","DOI":"10.1145\/956750.956779"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Wang, W., Yang, J., Yu, P.S.: Efficient Mining of Weighted Association Rules. In: SIGKDD 2003, pp. 270\u2013274 (2003)","DOI":"10.1145\/347090.347149"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Generating Non-Redundant Association Rules. In: Proc. of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, Massachusetts, USA, pp. 34\u201343 (2000)","DOI":"10.1145\/347090.347101"},{"issue":"3","key":"29_CR22","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"M.J. Zaki","year":"2004","unstructured":"Zaki, M.J.: Mining Non-Redundant Association Rules. Data Mining and Knowledge Discovery\u00a09(3), 223\u2013248 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"4","key":"29_CR23","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"M.J. Zaki","year":"2005","unstructured":"Zaki, M.J., Hsiao, C.J.: Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure. IEEE Transactions on Knowledge and Data Engineering\u00a017(4), 462\u2013478 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Studies in Computational Intelligence","Advanced Computational Methods for Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-00293-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T01:29:53Z","timestamp":1745976593000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-00293-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319002927","9783319002934"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-00293-4_29","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}