{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:58:51Z","timestamp":1725861531682},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_12","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T11:50:21Z","timestamp":1468929021000},"page":"143-155","source":"Crossref","is-referenced-by-count":7,"title":["Frequent-Itemset Mining Using Locality-Sensitive Hashing"],"prefix":"10.1007","author":[{"given":"Debajyoti","family":"Bera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rameshwar","family":"Pratap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., 26\u201328 May 1993, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"12_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of 20th International Conference on Very Large Data Bases, 12\u201315 September 1994, Santiago de Chile, Chile, pp. 487\u2013499 (1994)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bera, D., Pratap, R.: Frequent-itemset mining using locality-sensitive hashing. CoRR, abs\/1603.01682 (2016)","DOI":"10.1007\/978-3-319-42634-1_12"},{"issue":"3","key":"12_CR4","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1006\/jcss.1999.1690","volume":"60","author":"AZ Broder","year":"2000","unstructured":"Broder, A.Z., Charikar, M., Frieze, A.M., Mitzenmacher, M.: Min-wise independent permutations. J. Comput. Syst. Sci. 60(3), 630\u2013659 (2000)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"12_CR5","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/69.908981","volume":"13","author":"E Cohen","year":"2001","unstructured":"Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J.D., Yang, C.: Finding interesting associations without support pruning. IEEE Trans. Knowl. Data Eng. 13(1), 64\u201378 (2001)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"12_CR6","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB 1999, Proceedings of 25th International Conference on Very Large Data Bases, 7\u201310 September 1999, Edinburgh, Scotland, UK, pp. 518\u2013529 (1999)"},{"issue":"2","key":"12_CR7","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/777943.777945","volume":"28","author":"D Gunopulos","year":"2003","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., Sharma, R.S.: Discovering all most specific sentences. ACM Trans. Database Syst. 28(2), 140\u2013174 (2003)","journal-title":"ACM Trans. Database Syst."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual Symposium on the Theory of Computing, Dallas, Texas, USA, 23\u201326 May 1998, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"issue":"3","key":"12_CR9","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Min. Knowl. Discov. 1(3), 259\u2013289 (1997)","journal-title":"Data Min. Knowl. Discov."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Pagh, R.: Locality-sensitive hashing without false negatives. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10\u201312 January 2016, pp. 1\u20139 (2016)","DOI":"10.1137\/1.9781611974331.ch1"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Park, J.S., Chen, M., Yu, P.S.: An effective hash based algorithm for mining association rules. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, San Jose, California, 22\u201325 May, pp. 175\u2013186 (1995)","DOI":"10.1145\/223784.223813"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Shrivastava, A., Li, P.: Asymmetric minwise hashing for indexing binary inner products and set containment. In: Proceedings of the 24th International Conference on World Wide Web, 2015, Florence, Italy, 18\u201322 May 2015, pp. 981\u2013991 (2015)","DOI":"10.1145\/2736277.2741285"},{"issue":"1","key":"12_CR13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1009713703947","volume":"2","author":"C Silverstein","year":"1998","unstructured":"Silverstein, C., Brin, S., Motwani, R.: Beyond market baskets: generalizing association rules to dependence rules. Data Min. Knowl. Discov. 2(1), 39\u201368 (1998)","journal-title":"Data Min. Knowl. Discov."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Wang, H., Wang, W., Yang, J., Yu, P.S.: Clustering by pattern similarity in large data sets. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison, Wisconsin, 3\u20136 June 2002, pp. 394\u2013405 (2002)","DOI":"10.1145\/564691.564737"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T07:03:30Z","timestamp":1568185410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}