{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T23:40:25Z","timestamp":1736120425037,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304623"},{"type":"electronic","value":"9783540316527"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11589990_129","type":"book-chapter","created":{"date-parts":[[2005,11,26]],"date-time":"2005-11-26T06:28:03Z","timestamp":1132986483000},"page":"1001-1004","source":"Crossref","is-referenced-by-count":1,"title":["Mining with Constraints by Pruning and Avoiding Ineffectual Processing"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"El-Hajj","sequence":"first","affiliation":[]},{"given":"Osmar R.","family":"Za\u00efane","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"129_CR1","doi-asserted-by":"crossref","unstructured":"Bucila, C., Gehrke, J., Kifer, D., White, W.: Dualminer: A dual-pruning algorithm for itemsets with constraints. In: SIGKDD 2002, August 2002, pp. 42\u201351 (2002)","DOI":"10.1145\/775047.775054"},{"key":"129_CR2","doi-asserted-by":"crossref","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: Mafia: A maximal frequent itemset algorithm for transactional databases. In: ICDE, pp. 443\u2013452 (2001)","DOI":"10.1109\/ICDE.2001.914857"},{"key":"129_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45228-7_37","volume-title":"Data Warehousing and Knowledge Discovery","author":"M. El-Hajj","year":"2003","unstructured":"El-Hajj, M., Za\u00efane, O.R.: Non recursive generation of frequent k-itemsets from frequent pattern tree representations. In: Kambayashi, Y., Mohania, M., W\u00f6\u00df, W. (eds.) DaWaK 2003. LNCS, vol.\u00a02737. Springer, Heidelberg (2003)"},{"key":"129_CR4","doi-asserted-by":"crossref","unstructured":"El-Hajj, M., Za\u00efane, O.R.: Cofi approach for mining frequent itemsets revisited. In: DMKD 2004, June 2004, pp. 70\u201375 (2004)","DOI":"10.1145\/1008694.1008706"},{"key":"129_CR5","unstructured":"Goethals, B., Zaki, M.: Advances in frequent itemset mining implementations: Introduction to fimi03. In: FIMI 2003 in conjunction with IEEE-ICDM (2003)"},{"key":"129_CR6","unstructured":"IBM_Almaden. Quest synthetic data generation code, http:\/\/www.almaden.ibm.com\/cs\/quest\/syndata.html."}],"container-title":["Lecture Notes in Computer Science","AI 2005: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11589990_129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T23:06:10Z","timestamp":1736118370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11589990_129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304623","9783540316527"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11589990_129","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}