{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T02:10:09Z","timestamp":1745979009520,"version":"3.40.4"},"publisher-location":"Heidelberg","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319002927"},{"type":"electronic","value":"9783319002934"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-00293-4_27","type":"book-chapter","created":{"date-parts":[[2013,3,22]],"date-time":"2013-03-22T11:27:27Z","timestamp":1363951647000},"page":"355-366","source":"Crossref","is-referenced-by-count":2,"title":["An Approach for Mining Concurrently Closed Itemsets and Generators"],"prefix":"10.1007","author":[{"given":"Anh","family":"Tran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tin","family":"Truong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bac","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, N.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOID, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"27_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 478\u2013499 (1994)"},{"key":"27_CR3","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-28490-8_38","volume-title":"Intelligent Information and Database Systems","author":"A. Tran","year":"2012","unstructured":"Tran, A., Truong, T., Le, B.: Structures of Association Rule Set. In: Pan, J.-S., Chen, S.-M., Nguyen, N.T. (eds.) ACIIDS 2012, Part II. LNCS (LNAI), vol.\u00a07197, pp. 361\u2013370. Springer, Heidelberg (2012)"},{"key":"27_CR4","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/978-3-642-32695-0_77","volume-title":"PRICAI 2012: Trends in Artificial Intelligence","author":"A. Tran","year":"2012","unstructured":"Tran, A., Duong, H., Truong, T., Le, B.: Mining Frequent Itemsets with Dualistic Constraints. In: Anthony, P., Ishizuka, M., Lukose, D. (eds.) PRICAI 2012. LNCS (LNAI), vol.\u00a07458, pp. 807\u2013813. Springer, Heidelberg (2012)"},{"issue":"2:3","key":"27_CR5","first-page":"1","volume":"6","author":"J.L. Balcazar","year":"2010","unstructured":"Balcazar, J.L.: Redundancy, deduction schemes, and minimum-size base for association rules. Logical Methods in Computer Sciences\u00a06(2:3), 1\u201333 (2010)","journal-title":"Logical Methods in Computer Sciences"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J.: Efficiently Mining Long Patterns from Databases. In: Proceedings of the SIGMOD Conference, pp. 85\u201393 (1998)","DOI":"10.1145\/276305.276313"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A maximal frequent itemset algorithm for transactional databases. In: Proceedings of ICDE 2001, pp. 443\u2013452 (2001)","DOI":"10.1109\/ICDE.2001.914857"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J. Boulicaut","year":"2003","unstructured":"Boulicaut, J., Bykowski, A., Rigotti, C.: Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries. Data Mining and Knowledge Discovery\u00a07, 5\u201322 (2003)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/11408079_17","volume-title":"Database Systems for Advanced Applications","author":"G. Dong","year":"2005","unstructured":"Dong, G., Jiang, C., Pei, J., Li, J., Wong, L.: Mining Succinct Systems of Minimal Generators of Formal Concepts. In: Zhou, L., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol.\u00a03453, pp. 175\u2013187. Springer, Heidelberg (2005)"},{"issue":"1","key":"27_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 item set lattices. Information Systems\u00a024(1), 25\u201346 (1999)","journal-title":"Information Systems"},{"issue":"1","key":"27_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10844-005-0266-z","volume":"24","author":"N. Pasquier","year":"2005","unstructured":"Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: Generating a condensed representation for association rules. J. of Intelligent Infor. Sys.\u00a024(1), 29\u201360 (2005)","journal-title":"J. of Intelligent Infor. Sys."},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-642-03915-7_34","volume-title":"Advances in Intelligent Data Analysis VIII","author":"L. Szathmary","year":"2009","unstructured":"Szathmary, L., Valtchev, P., Napoli, A., Godin, R.: Efficient Vertical Mining of Frequent Closures and Generators. In: Adams, N.M., Robardet, C., Siebes, A., Boulicaut, J.-F. (eds.) IDA 2009. LNCS, vol.\u00a05772, pp. 393\u2013404. Springer, Heidelberg (2009)"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: Closet+: Searching for the best strategies for mining frequent closed itemsets. In: Proceedings of ACM SIGKDD 2003 (2003)","DOI":"10.1145\/956750.956779"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Gouda, K.: Fast Vertical Mining Using Diffsets. In: Proc. 9th ACM SIGKDD Int\u2019l Conf. Knowledge Discovery and Data Mining (2003)","DOI":"10.1145\/956750.956788"},{"key":"27_CR15","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, 223\u2013248 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"4","key":"27_CR16","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 Trans. Knowledge and Data Engineering\u00a017(4), 462\u2013478 (2005)","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0898-1221(92)90120-7","volume":"23","author":"R. Wille","year":"1992","unstructured":"Wille, R.: Concept lattices and conceptual knowledge systems. Computers and Math. with App.\u00a023, 493\u2013515 (1992)","journal-title":"Computers and Math. with App."}],"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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T01:29:49Z","timestamp":1745976589000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-00293-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319002927","9783319002934"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-00293-4_27","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013]]}}}