{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:10:50Z","timestamp":1725487850841},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540140405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-39205-x_82","type":"book-chapter","created":{"date-parts":[[2007,7,21]],"date-time":"2007-07-21T14:23:13Z","timestamp":1185027793000},"page":"484-490","source":"Crossref","is-referenced-by-count":6,"title":["A Maximal Frequent Itemset Algorithm"],"prefix":"10.1007","author":[{"given":"Hui","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinghua","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuanxiang","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenli","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"82_CR1","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen and A.I. Verkamo: Fast Discovery of Association Rules. Advances in Knowledge Discovery and Data Mining, Chapter 12, AAAI\/MIT Press, 1995."},{"key":"82_CR2","doi-asserted-by":"crossref","unstructured":"R. Agrawal, C. Aggarwal, and V. Prasad. Depth First Generation of Long Patterns. In ACM SIGKDD Conf., Aug. 2000.","DOI":"10.1145\/347090.347114"},{"key":"82_CR3","doi-asserted-by":"crossref","unstructured":"R. J. Bayardo. Efficiently mining long patterns from databases. In ACM SIGMOD Conf., June 1998.","DOI":"10.1145\/276304.276313"},{"key":"82_CR4","doi-asserted-by":"crossref","unstructured":"D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: a maximal frequent itemset algorithm for transactional databases. In Intl. Conf. on Data Engineering, Apr. 2001.","DOI":"10.1109\/ICDE.2001.914857"},{"key":"82_CR5","doi-asserted-by":"crossref","unstructured":"K. Gouda, M. J. Zaki. Efficiently Mining Maximal Frequent Itemsets. In 1st IEEE Intl. Conf. On data mining, Nov. 2001.","DOI":"10.1109\/ICDM.2001.989514"}],"container-title":["Lecture Notes in Computer Science","Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-39205-X_82.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:21:32Z","timestamp":1619558492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39205-X_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540140405"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-39205-x_82","relation":{},"subject":[]}}