{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T01:09:30Z","timestamp":1791421770330,"version":"4.3.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,7,15]],"date-time":"2005-07-15T00:00:00Z","timestamp":1121385600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2005,11]]},"DOI":"10.1007\/s10618-005-0002-x","type":"journal-article","created":{"date-parts":[[2005,7,15]],"date-time":"2005-07-15T15:49:55Z","timestamp":1121442595000},"page":"223-242","source":"Crossref","is-referenced-by-count":147,"title":["GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets"],"prefix":"10.1007","volume":"11","author":[{"given":"Karam","family":"Gouda","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed J.","family":"Zaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,7,15]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Aggarwal, C., and Prasad, V. 2000. Depth first generation of long patterns. In 7th Int'l Conference on Knowledge Discovery and Data Mining, pp. 108\u2013118.","DOI":"10.1145\/347090.347114"},{"key":"2_CR2","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, A.I. 1996. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, Fayyad, U. et al. (Eds.), Menlo Park, CA: AAAI Press, pp. 307\u2013328."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J. 1998. Efficiently mining long patterns from databases. In ACM SIGMOD Conf. on Management of Data, pp. 85\u201393.","DOI":"10.1145\/276304.276313"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Burdick, D., Calimlim, M., and Gehrke, J. 2001. MAFIA: A maximal frequent itemset algorithm for transactional databases. In IEEE Intl. Conf. on Data Engineering, pp. 443\u2013452.","DOI":"10.1109\/ICDE.2001.914857"},{"issue":"1","key":"2_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/1007730.1007744","volume":"6","author":"B. Goethals","year":"2003","unstructured":"Goethals, B., and Zaki, M. 2003. Advances in frequent itemset mining implementations: Report on FIMI'03. SIGKDD Explorations, 6(1):109\u2013117.","journal-title":"SIGKDD Explorations"},{"issue":"2","key":"2_CR6","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/777943.777945","volume":"28","author":"D. Gunopulos","year":"2003","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., and Sharma, R. 2003. Discovering all most specific sentences. ACM Transactions on Database Systems, 28(2):140\u2013174.","journal-title":"ACM Transactions on Database Systems"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., and Yin, Y. 2000. Mining frequent patterns without candidate generation. In ACM SIGMOD Conf. on Management of Data, pp. 1\u201312.","DOI":"10.1145\/342009.335372"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Lin, D.-L., and Kedem, Z.M. 1998. Pincer-search: A new algorithm for discovering the maximum frequent set. In 6th Intl. Conf. on Extending Database Technology, pp. 105\u2013119.","DOI":"10.1007\/BFb0100980"},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0304-3975(94)90036-1","volume":"129","author":"D. Yellin","year":"1994","unstructured":"Yellin, D. 1994. An algorithm for dynamic subset and intersection testing. Theoretical Computer Science, 129:397\u2013406.","journal-title":"Theoretical Computer Science"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Zaki, M.J. 2000. Generating non-redundant association rules. In 6th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pp. 34\u201343.","DOI":"10.1145\/347090.347101"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., and Gouda, K. 2003. Fast vertical mining using Diffsets. In 9th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pp. 326\u2013335.","DOI":"10.1145\/956750.956788"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., and Hsiao, C.-J. 2002. CHARM: An efficient algorithm for closed itemset mining. In 2nd SIAM International Conference on Data Mining, pp. 457\u2013473.","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-005-0002-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-005-0002-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-005-0002-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:29:38Z","timestamp":1559244578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-005-0002-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,15]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["2"],"URL":"https:\/\/doi.org\/10.1007\/s10618-005-0002-x","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7,15]]}}}