{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:30:03Z","timestamp":1725492603070},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405368"},{"type":"electronic","value":"9783540450733"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45073-4_11","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T09:30:06Z","timestamp":1191922206000},"page":"131-139","source":"Crossref","is-referenced-by-count":1,"title":["MaxDomino: Efficiently Mining Maximal Sets"],"prefix":"10.1007","author":[{"given":"Krishnamoorthy","family":"Srikumar","sequence":"first","affiliation":[]},{"given":"Bharat","family":"Bhasker","sequence":"additional","affiliation":[]},{"given":"Satish K.","family":"Tripathi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In proceedings of ACM SIGMOD Conference on Management of Data. (1993) 207\u2013216. Washigton D.C.","DOI":"10.1145\/170035.170072"},{"key":"11_CR2","unstructured":"Agrawal R. et al: The Quest Data Mining System, Technical report, IBM Almaden Research Center. (1996b) Retrieved October 10, 2002 from http:\/\/www.almaden.ibm.com\/cs\/quest\/."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Aggarwal C., Prasad VVV.: Depth first generation of Long patterns. 7th International conference on Knowledge discovery and Data mining (2000)","DOI":"10.1145\/347090.347114"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases. In Intl. Conf. On Data Engineering (2001)","DOI":"10.1109\/ICDE.2001.914857"},{"key":"11_CR5","unstructured":"Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. RPI Technical Report. 01-1. (2001)"}],"container-title":["Lecture Notes in Computer Science","New Horizons in Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45073-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T21:51:00Z","timestamp":1550958660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45073-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405368","9783540450733"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-45073-4_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}