{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:49:39Z","timestamp":1725544179459},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540332060"},{"type":"electronic","value":"9783540332077"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11731139_59","type":"book-chapter","created":{"date-parts":[[2006,3,9]],"date-time":"2006-03-09T04:03:44Z","timestamp":1141877024000},"page":"504-508","source":"Crossref","is-referenced-by-count":1,"title":["Ramp: High Performance Frequent Itemset Mining with Efficient Bit-Vector Projection Technique"],"prefix":"10.1007","author":[{"given":"Shariq","family":"Bashir","sequence":"first","affiliation":[]},{"given":"Abdul Rauf","family":"Baig","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"59_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994, Santiago, Chile (1994)"},{"key":"59_CR2","unstructured":"Borgelt, C.: Efficient Implementation of Eclat and Apriori. In: IEEE ICDM 2003 Workshop FIMI 2003, Melbourne, Florida, USA (2003)"},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases. In: ICDE 2001, Heidelberg, Germany (2001)","DOI":"10.1109\/ICDE.2001.914857"},{"key":"59_CR4","unstructured":"Burdick, D., Calimlim, M., Flannick, J., Gehrke, J., Yiu, T.: MAFIA: A Performance Study of Mining Maximal Frequent Itemsets. In: IEEE ICDM 2003 Workshop FIMI 2003, Melbourne, Florida, USA (2003)"},{"key":"59_CR5","unstructured":"Fiat, A., Shporer, S.: AIM: Another Itemset Miner. In: IEEE ICDM 2003 Workshop FIMI 2003, Melbourne, Florida, USA (2003)"},{"key":"59_CR6","unstructured":"Grahne, G., Zhu, J.: Efficiently Using Prefix-trees in Mining Frequent Itemsets. In: IEEE ICDM 2003 Workshop FIMI 2003, Melbourne, Florida, USA (2003)"},{"key":"59_CR7","unstructured":"Goethals, B., Zaki, M.J. (eds.) Proc. IEEE ICDM Workshop Frequent Itemset Mining Implementations. CEUR Workshop Proc., vol. 80 (November 2003), \n                    \n                      http:\/\/CEUR-WS.org\/Vol-90"},{"key":"59_CR8","unstructured":"Liu, G., Lu, H., Yu, J.X., Wei, W., Xiao, X.: AFOPT: An Efficient Implementation of Pattern Growth Approach. In: IEEE ICDM 2003 Workshop FIMI 2003, Melbourne, Florida, USA (2003)"},{"key":"59_CR9","unstructured":"Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., Yang, D.: H-Mine: Hyper-structure mining of frequent patterns in large databases. In: ICDM 2001, San Jose, California, USA (2001)"},{"key":"59_CR10","unstructured":"Pietracaprina, A., Zandolin, D.: Mining Frequent Itemsets using Patricia Tries. In: IEEE ICDM 2003 Workshop FIMI 2003, Melbourne, Florida, USA (2003)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11731139_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:51:55Z","timestamp":1619506315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11731139_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540332060","9783540332077"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11731139_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}