{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:07:36Z","timestamp":1725487656669},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441236"},{"type":"electronic","value":"9783540461456"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46145-0_18","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:20:28Z","timestamp":1184588428000},"page":"181-190","source":"Crossref","is-referenced-by-count":2,"title":["The Closed Keys Base of Frequent Itemsets"],"prefix":"10.1007","author":[{"given":"Viet Phan","family":"Luong","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami, \u201cMining Association Rules between Sets of Items in Large Databases\u201d, in Proc. of the 1993 ACM SIGMOD Int\u2019l Conf. on Management of Data, May 1993, pp. 207\u2013216.","DOI":"10.1145\/170036.170072"},{"key":"18_CR2","unstructured":"R. Agrawal, R. Srikant, \u201cFast Algorithms for Mining Association Rules in Large Databases\u201d, Proc. of the 20th Int\u2019l Conference on Very Large Data Bases (VLDB), juin 1994, pp. 478\u2013499."},{"key":"18_CR3","unstructured":"C. C. Aggarwal, P.S. Yu, \u201cOnline Generation of Association Rules\u201d, in Proc. of the Int\u2019l Conference on Data Engineering, Orlando, Florida, Feb. 1998."},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y. Bastide","year":"2000","unstructured":"Y. Bastide, R. Taouil, N. Pasquier, G. Stumme and L. Lakhal, \u201cMining frequent patterns with counting inference\u201d ACM SIGKDD Explorations, vol. 2(2), December 2000, pp. 66\u201375.","journal-title":"ACM SIGKDD Explorations"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"A. Bykowski and C. Rigotti, \u201cA condensed representation to find frequent patterns\u201d, in Proc. of the 12th ACM SIGACT-SIGMOD-SIGART PODS\u201901, May, 2001.","DOI":"10.1145\/375551.375604"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"B. Ganter, R. Wille, \u201cFormal concept Analysis: Mathematical Foundations\u201d, Springer, 1999.","DOI":"10.1007\/978-3-642-59830-2"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"M. Kryszkiewics, \u201cClosed set based discovery of representative association rules\u201d, in Proc. of IDA\u201901, Springer, September 2001.","DOI":"10.1007\/3-540-44816-0_35"},{"key":"18_CR8","unstructured":"M. Kryszkiewics, \u201cConcise Representation of Frequent Patterns based on Disjunction-free Generators\u201d, in Proc. of the 2001 IEEE International Conference on Data Mining (ICDM\u201901), 29-Nov.\u20132-Dec. 2001, San Jose, California, USA, pp. 305\u2013312."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, \u201cDiscovering frequent closed itemsets for association rules\u201d, Proc. of the 7th Int\u2019l Conf. on Database Theory (ICDT), jan. 1999, pp. 398\u2013416.","DOI":"10.1007\/3-540-49257-7_25"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, \u201cEfficient mining of association rules using closed itemset lattices\u201d, Information Systems, 24(1), 1999, pp. 25\u201346.","journal-title":"Information Systems"},{"key":"18_CR11","unstructured":"J. Pei, J. Han, R. Mao, \u201cCLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets\u201d, in Proc. Workshop on Reasearch Issues on Data Mining and Knowledge Discovery (DMKD), May 2000, p. 21\u201330."},{"key":"18_CR12","unstructured":"V. Phan-Luong, \u201cThe Representative Basis for Association Rules\u201d, in Proc. of the 2001 IEEE International Conference on Data Mining (ICDM\u201901), 29-Nov.\u20132-Dec. 2001, San Jose, California, USA, poster paper pp. 639\u2013640."},{"key":"18_CR13","unstructured":"V. Phan-Luong, \u201cReasoning on Association Rules\u201d, 17e Journ\u00e9es Bases de Donn\u00e9es Avanc\u00e9es (BDA\u20192001), C\u00e9padu\u00e8s Edition, pp. 299\u2013310."},{"key":"18_CR14","unstructured":"M.J Zaki, C.J. Hsiao, \u201cCHARM: An efficient algorithm for closed association rules mining\u201d, Technical report 99-10, Computer Science Dept., Rensselaer Polytechnic Institute, Oct. 1999."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"M.J Zaki, \u201cGenerating non-redundant association rules\u201d, proc. of the 6th ACM SIGMOD Int\u2019l Conf. on Knowledge Discovery and Data Mining KDD 2000 Boston, MA, August 2000, pp. 34\u201343.","DOI":"10.1145\/347090.347101"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46145-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:30:17Z","timestamp":1556667017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46145-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441236","9783540461456"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-46145-0_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}