{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:31:10Z","timestamp":1760596270876,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T00:00:00Z","timestamp":1467590400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T00:00:00Z","timestamp":1467590400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1029166","IIS-1343639"],"award-info":[{"award-number":["CCF-1029166","IIS-1343639"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1409601","CNS-0910952"],"award-info":[{"award-number":["CCF-1409601","CNS-0910952"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["III 1213038"],"award-info":[{"award-number":["III 1213038"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"crossref","award":["DE-SC0007456","DE-SC0014330"],"award-info":[{"award-number":["DE-SC0007456","DE-SC0014330"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-14-1-0215"],"award-info":[{"award-number":["N00014-14-1-0215"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10115-016-0962-8","type":"journal-article","created":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T19:46:04Z","timestamp":1467661564000},"page":"969-997","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["SILVERBACK+: scalable association mining via fast list intersection for columnar social data"],"prefix":"10.1007","volume":"50","author":[{"given":"Yusheng","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengzhang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diana","family":"Palsetia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goce","family":"Trajcevski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankit","family":"Agrawal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alok","family":"Choudhary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,4]]},"reference":[{"key":"962_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. In: SIGMOD\u201993. ACM, pp\u00a0207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"962_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the VLDB Endow, VLDB\u201994, pp\u00a0487\u2013499"},{"key":"962_CR3","unstructured":"Bayardo RJ Jr (1998) Efficiently mining long patterns from databases. In: SIGMOD\u201998. ACM, New York, NY, USA, pp 85\u201393"},{"key":"962_CR4","first-page":"422","volume-title":"Space\/time trade-offs in hash coding with allowable errors","author":"BH Bloom","year":"1970","unstructured":"Bloom BH (1970) Space\/time trade-offs in hash coding with allowable errors, vol 13. ACM, New York, pp 422\u2013426"},{"issue":"3","key":"962_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s00778-005-0163-7","volume":"15","author":"H Cao","year":"2006","unstructured":"Cao H, Wolfson O, Trajcevski G (2006) Spatio-temporal data reduction with deterministic error bounds. VLDB J 15(3):211\u2013228","journal-title":"VLDB J"},{"key":"962_CR6","unstructured":"Chang F, Dean J, Ghemawat S, Hsieh WC, Wallach DA, Burrows M, Chandra T, Fikes A, Gruber RE (2006) Bigtable: a distributed storage system for structured data. In: OSDI\u201906. USENIX Association, pp\u00a015\u201315"},{"issue":"2","key":"962_CR7","doi-asserted-by":"crossref","first-page":"429","DOI":"10.25300\/MISQ\/2014\/38.2.05","volume":"38","author":"J Chen","year":"2014","unstructured":"Chen J, Stallaer J (2014) An economic analysis of online advertising using behavioral targeting. MIS Quarterly 38(2):429\u2013449","journal-title":"MIS Quarterly"},{"key":"962_CR8","doi-asserted-by":"crossref","unstructured":"Chung S, Luo C (2003) Parallel mining of maximal frequent itemsets from databases. In: ICTAI\u201903, pp\u00a0134\u2013139","DOI":"10.1109\/TAI.2003.1250181"},{"key":"962_CR9","doi-asserted-by":"crossref","unstructured":"Cohen E, Datar M, Fujiwara S, Gionis A, Indyk P, Motwani R, Ullman JD, Yang C ( 2001) Finding interesting associations without support pruning, vol\u00a013. IEEE, pp\u00a064\u201378","DOI":"10.1109\/69.908981"},{"issue":"2","key":"962_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1366102.1366106","volume":"33","author":"G Cormode","year":"2008","unstructured":"Cormode G, Garofalakis MN (2008) Approximate continuous querying over distributed streams. ACM Trans Database Syst 33(2):1\u201339","journal-title":"ACM Trans Database Syst"},{"issue":"9","key":"962_CR11","doi-asserted-by":"publisher","first-page":"1982","DOI":"10.1109\/TKDE.2012.149","volume":"25","author":"V Grupcev","year":"2013","unstructured":"Grupcev V, Yuan Y, Tu Y-C, Huang J, Chen S, Pandit S, Weng M (2013) Approximate algorithms for computing spatial distance histograms with accuracy guarantees. IEEE Trans Knowl Data Eng 25(9):1982\u20131996","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"962_CR12","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: SIGMOD\u201900. ACM, pp\u00a01\u201312","DOI":"10.1145\/342009.335372"},{"key":"962_CR13","unstructured":"Hofmann T, Buhmann J (1997) Pairwise data clustering by deterministic annealing, vol 19. IEEE, pp 1\u201314"},{"key":"962_CR14","doi-asserted-by":"crossref","unstructured":"Kallman R, Kimura H, Natkins J, Pavlo A, Rasin A, Zdonik S, Jones EPC, Madden S, Stonebraker M, Zhang Y, Hugg J, Abadi DJ (2008) H-store: a high-performance, distributed main memory transaction processing system, vol\u00a01, VLDB Endowment, pp\u00a01496\u20131499","DOI":"10.14778\/1454159.1454211"},{"key":"962_CR15","doi-asserted-by":"crossref","unstructured":"Kendall M (1938) A new measure of rank correlation, vol\u00a030. Biometrika Trust, pp 81\u201393","DOI":"10.1093\/biomet\/30.1-2.81"},{"key":"962_CR16","doi-asserted-by":"crossref","unstructured":"Kimura N, Latifi S (2005) A survey on data compression in wireless sensor networks. In: ITCC (2), pp\u00a08\u201313","DOI":"10.1109\/ITCC.2005.43"},{"key":"962_CR17","unstructured":"Kumar A, Grupcev V, Yuan Y, Huang J, Tu YC, Shen G (2014) Computing spatial distance histograms for large scientific data sets on-the-fly, vol\u00a026. IEEE, pp\u00a02410\u20132424"},{"key":"962_CR18","first-page":"35","volume-title":"Cassandra: a decentralized structured storage system","author":"A Lakshman","year":"2010","unstructured":"Lakshman A, Malik P (2010) Cassandra: a decentralized structured storage system, vol 44. ACM, New York, pp 35\u201340"},{"key":"962_CR19","unstructured":"Lan B, Ooi BC, Tan K-L (2002) Efficient indexing structures for mining frequent patterns. In: ICDE\u201902, pp\u00a0453\u2013462"},{"key":"962_CR20","doi-asserted-by":"crossref","unstructured":"Lee J, Bengio S, Kim S, Lebanon G, Singer Y (2014) Local collaborative ranking. In: Proceedings of the 23rd international conference on World Wide Web. In: WWW\u201914. ACM, New York, NY, USA, pp 85\u201396","DOI":"10.1145\/2566486.2567970"},{"key":"962_CR21","doi-asserted-by":"crossref","unstructured":"Li H, Wang Y, Zhang D, Zhang M, Chang E (2008) Pfp: parallel fp-growth for query recommendation. In: RecSys\u201908, pp\u00a0107\u2013114","DOI":"10.1145\/1454008.1454027"},{"key":"962_CR22","doi-asserted-by":"crossref","unstructured":"Lin M-Y, Lee P-Y, Hsueh S-C ( 2012) Apriori-based frequent itemset mining algorithms on mapreduce. In: ICUIMC\u201912","DOI":"10.1145\/2184751.2184842"},{"key":"962_CR23","unstructured":"Ozkural E, Aykanat C (2004) A space optimization for FP-growth. In: FIMI"},{"key":"962_CR24","volume-title":"Fundamental data compression","author":"IM Pu","year":"2006","unstructured":"Pu IM (2006) Fundamental data compression. Elsevier, Amsterdam"},{"issue":"3","key":"962_CR25","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10844-006-0018-8","volume":"29","author":"L Qiu","year":"2007","unstructured":"Qiu L, Li Y, Wu X (2007) Preserving privacy in association rule mining with Bloom filters. J Intell Inf Syst 29(3):253\u2013278","journal-title":"J Intell Inf Syst"},{"key":"962_CR26","unstructured":"Sparse matrices (2014) \n                    http:\/\/docs.scipy.org\/doc\/scipy\/reference\/sparse.html"},{"key":"962_CR27","volume-title":"Introduction to data mining","author":"P-N Tan","year":"2005","unstructured":"Tan P-N, Steinbach M, Kumar V (2005) Introduction to data mining, 1st edn. Addison Wesley, Reading","edition":"1"},{"key":"962_CR28","volume-title":"Interaction effects in multiple regression","author":"R Turrisi","year":"2003","unstructured":"Turrisi R, Jaccard J (2003) Interaction effects in multiple regression, vol 72. Sage, London"},{"key":"962_CR29","first-page":"37","volume-title":"Random sampling with a reservoir","author":"JS Vitter","year":"1985","unstructured":"Vitter JS (1985) Random sampling with a reservoir, vol 11. ACM, New York, pp 37\u201357"},{"key":"962_CR30","doi-asserted-by":"crossref","unstructured":"Xie Y, Chen Z, Zhang K, Patwary M, Cheng Y, Liu H, Agrawal A, Choudhary A ( 2013) Graphical modeling of macro behavioral targeting in social networks. In: SDM, pp\u00a0740\u2013748","DOI":"10.1137\/1.9781611972832.82"},{"key":"962_CR31","doi-asserted-by":"crossref","unstructured":"Xie Y, Cheng Y, Honbo D, Zhang K, Agrawal A, Choudhary AN, Gao Y, Gou J (2012) Probabilistic macro behavioral targeting. In: DUBMMSM, pp\u00a07\u201310","DOI":"10.1145\/2390131.2390135"},{"key":"962_CR32","doi-asserted-by":"crossref","unstructured":"Xie Y, Palsetia D, Trajcevski G, Agrawal A, Choudhary AN (2014) Silverback: scalable association mining for temporal data in columnar probabilistic databases. In: ICDE, pp\u00a01072\u20131083","DOI":"10.1109\/ICDE.2014.6816724"},{"key":"962_CR33","unstructured":"Ye Y, Chiang C-C (2006) A parallel apriori algorithm for frequent itemsets mining. In: SERA\u201906. IEEE, pp\u00a087\u201394"},{"key":"962_CR34","first-page":"372","volume-title":"Scalable algorithms for association mining","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining, vol 12. IEEE Educational Activities Department, Piscataway, pp 372\u2013390"},{"key":"962_CR35","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Parthasarathy S, Li W (1997) A localized algorithm for parallel association mining. In: SPAA\u201997, pp\u00a0321\u2013330","DOI":"10.1145\/258492.258524"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0962-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-016-0962-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0962-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0962-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T08:01:53Z","timestamp":1589443313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-016-0962-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,4]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["962"],"URL":"https:\/\/doi.org\/10.1007\/s10115-016-0962-8","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2016,7,4]]},"assertion":[{"value":"22 December 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2016","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2016","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}