{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T17:40:18Z","timestamp":1736617218723,"version":"3.32.0"},"reference-count":15,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Experimental & Theoretical Artificial Intelligence"],"published-print":{"date-parts":[[2006,12]]},"DOI":"10.1080\/09528130600975758","type":"journal-article","created":{"date-parts":[[2006,10,20]],"date-time":"2006-10-20T19:03:24Z","timestamp":1161371004000},"page":"481-499","source":"Crossref","is-referenced-by-count":2,"title":["An algorithm for discovering the frequent closed itemsets in a large database"],"prefix":"10.1080","volume":"18","author":[{"given":"Ningthoujam","family":"Gourakishwar Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanasam","family":"Ranbir Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anjana K.","family":"Mahanta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bhanu","family":"Prasad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","volume-title":"Sequential and Parallel Algorithms,","author":"Adamo J-M","year":"2000","edition":"1"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"CIT0003","first-page":"478","volume-title":"Proceedings of the 20th International Conference on Very Lagre Data Bases","author":"Agrawal R","year":"1994"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276313"},{"key":"CIT0005","doi-asserted-by":"crossref","unstructured":"Burdick, D, Calimlim, M and Gehrke, J. 2001. MAFIA: a maximal frequent itemset algorithm for transactional databases. Proceedings of the 17th International Conference on Data Engineering. April2001. pp.443\u2013452.","DOI":"10.1109\/ICDE.2001.914857"},{"key":"CIT0006","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order,","author":"Davey BA","year":"2002","edition":"2"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"volume-title":"Technical Report: TR1997-742","year":"1997","author":"Lin DI","key":"CIT0008"},{"key":"CIT0009","doi-asserted-by":"crossref","unstructured":"Pasquier, N, Bastide, Y, Taouil, R and Lakhal, L. 1999. Discovering frequent closed itemsets for association rules. Proceedings of the 7th International Conference on Database Theory. January1999. pp.398\u2013416.","DOI":"10.1007\/3-540-49257-7_25"},{"key":"CIT0010","first-page":"21","volume-title":"Proceedings of the 2000 ACM SIGMOD International Workshop on Data Mining and Knowledge Discovery","author":"Pei J","year":"2000"},{"key":"CIT0011","unstructured":"Savasere, A, Omiecinski, E and Navathe, S. 1995. An efficient algorithm for mining association rules in large databases. Proceedings of the 21th International Conference on Very Large Data Bases. September1995. pp.432\u2013444."},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"CIT0013","doi-asserted-by":"crossref","unstructured":"Zaki, MJ. 2000b. Generating non-redundant association rules. Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. August2000b. pp.34\u201343.","DOI":"10.1145\/347090.347101"},{"key":"CIT0014","doi-asserted-by":"crossref","unstructured":"Zaki, MJ and Gauda, K. 2003. Fast vertical mining using diffsets. Proceedings of the 9th International Conference on Knowledge Discovery and Data Mining. August2003. pp.326\u2013335.","DOI":"10.1145\/956755.956788"},{"key":"CIT0015","doi-asserted-by":"crossref","unstructured":"Zaki, MJ and Hsiao, C-J. 2002. CHARM: an efficient algorithm for closed itemset mining. Proceedings of the 2nd SIAM International Conference on Data Mining. April2002. pp.457\u2013474.","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Journal of Experimental & Theoretical Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/09528130600975758","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T17:01:22Z","timestamp":1736614882000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/09528130600975758"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1080\/09528130600975758"],"URL":"https:\/\/doi.org\/10.1080\/09528130600975758","relation":{},"ISSN":["0952-813X","1362-3079"],"issn-type":[{"type":"print","value":"0952-813X"},{"type":"electronic","value":"1362-3079"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}