{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:30:03Z","timestamp":1725550203236},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120893"},{"type":"electronic","value":"9783642120909"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12090-9_18","type":"book-chapter","created":{"date-parts":[[2010,3,15]],"date-time":"2010-03-15T14:44:21Z","timestamp":1268664261000},"page":"207-216","source":"Crossref","is-referenced-by-count":1,"title":["Mining the Most Generalization Association Rules"],"prefix":"10.1007","author":[{"given":"Bay","family":"Vo","sequence":"first","affiliation":[]},{"given":"Bac","family":"Le","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: 1st International Conference on Computational Logic, pp. 972\u2013986 (2000)","DOI":"10.1007\/3-540-44957-4_65"},{"key":"18_CR2","unstructured":"Bay, V., Bac, L.: Fast algorithm for mining minimal generators of frequent closed itemsets and their applications. In: The IEEE 39th International Conference on Computers & Industrial Engineering, Troyes, France, July 6\u20138,2009, pp. 1407\u20131411 (2009)"},{"issue":"10","key":"18_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 Trans. Knowl. Data Eng.\u00a017(10), 1347\u20131362 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"18_CR4","unstructured":"http:\/\/fimi.cs.helsinki.fi\/data\/ (Download on April 2005)"},{"key":"18_CR5","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":"18_CR6","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.datak.2008.02.001","volume":"66","author":"A.J.T. Lee","year":"2008","unstructured":"Lee, A.J.T., Wang, C.S., Weng, W.Y., Chen, J.A., Wu, H.W.: An Efficient Algorithm for Mining Closed Inter-transaction Itemsets. Data & Knowledge Engineering\u00a066, 68\u201391 (2008)","journal-title":"Data & Knowledge Engineering"},{"issue":"1","key":"18_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":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Proc. Of the 5th International Conference on Database Theory","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering Frequent Closed Itemsets for Association Rules. In: Proc. Of the 5th International Conference on Database Theory, Jerusalem, Israel. LNCS, pp. 398\u2013416. Springer, Heidelberg (1999)"},{"issue":"1","key":"18_CR9","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":"18_CR10","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":"18_CR11","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":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-540-30214-8_2","volume-title":"Proc. of the 7th International Conference on 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: Proc. of the 7th International Conference on Discovery Science. LNCS, pp. 16\u201331. Springer, Padova (2004)"},{"key":"18_CR13","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.1007\/3-540-36175-8"},{"key":"18_CR14","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":"4","key":"18_CR15","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"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Mining Non-Redundant Association Rules, Data Mining and Knowledge Discovery. In: Kluwer Academic Publishers. Manufactured in the Netherlands, pp. 223\u2013248 (2004)","DOI":"10.1023\/B:DAMI.0000040429.96086.c7"},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/1147234.1147248","volume":"8","author":"S.B. Yahia","year":"2006","unstructured":"Yahia, S.B., Hamrouni, T., Nguifo, E.M.: Frequent Closed Itemset based Algorithms: A thorough Structural and Analytical Survey. ACM SIGKDD Explorations Newsletter\u00a08(1), 93\u2013104 (2006)","journal-title":"ACM SIGKDD Explorations Newsletter"}],"container-title":["Studies in Computational Intelligence","Advances in Intelligent Information and Database Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12090-9_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:47:38Z","timestamp":1606186058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12090-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120893","9783642120909"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12090-9_18","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2010]]}}}