{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T22:43:08Z","timestamp":1777588988390,"version":"3.51.4"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T00:00:00Z","timestamp":1546560000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the Foundation Item: Shenzhen Foundation Research Project","award":["No. JCYJ20170307151518535"],"award-info":[{"award-number":["No. JCYJ20170307151518535"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s13042-018-00918-x","type":"journal-article","created":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T13:30:36Z","timestamp":1546608636000},"page":"3003-3016","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["HashEclat: an efficient frequent itemset algorithm"],"prefix":"10.1007","volume":"10","author":[{"given":"Chunkai","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panbo","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xudong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zoe L.","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,4]]},"reference":[{"issue":"4","key":"918_CR1","first-page":"1","volume":"5","author":"J Han","year":"2006","unstructured":"Han J, Kamber M (2006) Data mining: concepts and techniques. Data Min Concepts Models Methods Algorithms Second Ed 5(4): 1\u201318","journal-title":"Data Min Concepts Models Methods Algorithms Second Ed"},{"key":"918_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings 20th international conference very large data bases, VLDB vol, pp\u00a0487\u2013499"},{"issue":"2","key":"918_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"Jiawei Han","year":"2000","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: ACM sigmod record, pp\u00a01\u201312","journal-title":"ACM SIGMOD Record"},{"issue":"3","key":"918_CR4","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"918_CR5","doi-asserted-by":"crossref","unstructured":"Heaton J (2016) Comparing dataset characteristics that favor the Apriori, Eclat or FP-growth frequent itemset mining algorithms. In: Southeast con, pp\u00a01\u20137","DOI":"10.1109\/SECON.2016.7506659"},{"issue":"6227","key":"918_CR6","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1126\/science.1260364","volume":"347","author":"PM Preiss","year":"2015","unstructured":"Preiss PM, Ma R, Tai ME, Lukin A, Rispoli M, Zupancic P, Greiner M (2015) Strongly correlated quantum walks in optical lattices. Science 347(6227):1229\u20131233","journal-title":"Science"},{"key":"918_CR7","unstructured":"Zaki MJ, Gouda K (2003) Fast vertical mining using diffsets. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp\u00a0326\u2013335"},{"issue":"5","key":"918_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.14257\/ijdta.2016.9.5.26","volume":"9","author":"Z Ma","year":"2016","unstructured":"Ma Z, Yang J, Zhang T, Liu F (2016) An improved eclat algorithm for mining association rules based on increased search strategy. Int J Database Theory Appl 9(5):251\u2013266","journal-title":"Int J Database Theory Appl"},{"issue":"4","key":"918_CR9","first-page":"1323","volume":"27","author":"ZY Xiong","year":"2010","unstructured":"Xiong ZY, Chen PE, Zhang YF (2010) Improvement of eclat algorithm for association rules based on hash boolean matrix. Appl Res Comput 27(4):1323\u20131325","journal-title":"Appl Res Comput"},{"issue":"40\u201342","key":"918_CR10","doi-asserted-by":"publisher","first-page":"3795","DOI":"10.1016\/j.tcs.2010.06.002","volume":"411","author":"H Cohen","year":"2010","unstructured":"Cohen H, Porat E (2010) Fast set intersection and two-patterns matching. Theor Comput Sci 411(40\u201342):3795\u20133800","journal-title":"Theor Comput Sci"},{"issue":"2","key":"918_CR11","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1109\/TCYB.2017.2653223","volume":"48","author":"X Wang","year":"2018","unstructured":"Wang X, Wang R, Xu C (2018) Discovering the relationship between generalization and uncertainty by incorporating complexity of classification. IEEE Trans Cybern 48(2):703\u2013715","journal-title":"IEEE Trans Cybern"},{"issue":"6","key":"918_CR12","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1109\/TFUZZ.2017.2717803","volume":"25","author":"R Wang","year":"2017","unstructured":"Wang R, Wang X, Kwong S et al (2017) Incorporating diversity and informativeness in multiple-instance active learning. IEEEE Trans Fuzzy Syst 25(6):1460\u20131475","journal-title":"IEEEE Trans Fuzzy Syst"},{"key":"918_CR13","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-642-40328-6_32","volume":"8096","author":"E Cohen","year":"2013","unstructured":"Cohen E, Kaplan H (2013) What you can do with coordinated samples. Lect Notes Comput Sci 8096:452\u2013467","journal-title":"Lect Notes Comput Sci"},{"issue":"1","key":"918_CR14","doi-asserted-by":"publisher","first-page":"646","DOI":"10.14778\/1687627.1687701","volume":"2","author":"E Cohen","year":"2009","unstructured":"Cohen E, Kaplan H, Sen S (2009) Coordinated weighted sampling for estimating aggregates over multiple weight assignments. Proc VLDB Endow 2(1):646\u2013657","journal-title":"Proc VLDB Endow"},{"key":"918_CR15","unstructured":"Teschner M, Heidelberger B, M\u00fcller M, Pomerantes D, Gross MH (2003) Optimized spatial hashing for collision detection of deformable objects. In: Vmv, pp\u00a047\u201354"},{"issue":"3","key":"918_CR16","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1006\/jcss.1999.1690","volume":"60","author":"AZ Broder","year":"2000","unstructured":"Broder AZ, Charikar M, Frieze AM, Mitzenmacher M (2000) Min-wise independent permutations. J Comput Syst Sci 60(3):630\u2013659","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"918_CR17","doi-asserted-by":"publisher","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 et al (2001) Finding interesting associations without support pruning. IEEE Trans Knowl Data Eng 13(1):64\u201378","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"918_CR18","doi-asserted-by":"crossref","unstructured":"Pagh R, St\u00f6ckel M, Woodruff DP (2014) Is min-wise hashing optimal for summarizing set intersection?. In: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, pp 109\u2013120","DOI":"10.1145\/2594538.2594554"},{"issue":"14","key":"918_CR19","first-page":"47","volume":"63","author":"B Goethals","year":"2002","unstructured":"Goethals B (2002) Survey on frequent pattern mining. Univ Helsinki 63(14):47\u201352","journal-title":"Univ Helsinki"},{"key":"918_CR20","volume-title":"Frequent pattern mining","year":"2014","unstructured":"Aggarwal CC, Han J (eds) (2014) Frequent pattern mining. Springer, Berlin, pp\u00a019\u201323"},{"key":"918_CR21","unstructured":"Wang X, Zhang T, Wang R (2017) Non-iterative deep learning: incorporating restricted boltzmann machine into multilayer random weight neural networks. In: IEEE transactions on systems, man, and cybernetics: systems, IEEE early access articles, p 99"},{"key":"918_CR22","doi-asserted-by":"crossref","unstructured":"Xun Y, Zhang J, Qin X, Zhao X (2017) Fidoop-dp: data partitioning in frequent itemset mining on hadoop clusters. In: IEEE transactions on parallel and distributed systems, vol 99, pp 77\u201384","DOI":"10.1109\/TPDS.2016.2560176"},{"key":"918_CR23","doi-asserted-by":"crossref","unstructured":"Broder AZ, Charikar M, Frieze AM, Mitzenmacher M (1998) Min-wise independent permutations (extended abstract). In: Stoc\u201998 Proceedings of the Thirtieth annual acm symposium on theory of computing, vol 60, no 3, pp\u00a0327\u2013336","DOI":"10.1145\/276698.276781"},{"key":"918_CR24","unstructured":"Broder AZ (1997) On the resemblance and containment of documents. In: Proceedings of compression and complexity of sequences, pp\u00a021\u201329"},{"key":"918_CR25","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1017\/CBO9781139924801","volume-title":"Mining of massive datasets","author":"J Leskovec","year":"2014","unstructured":"Leskovec J, Rajaraman A, Ullman JD (2014) Mining of massive datasets. Cambridge University Press, Cambridge, pp\u00a07\u201315"},{"issue":"5","key":"918_CR26","doi-asserted-by":"publisher","first-page":"1638","DOI":"10.1109\/TFUZZ.2014.2371479","volume":"23","author":"X Wang","year":"2015","unstructured":"Wang X, Xing HJ, Li Y et al (2015) A study on relationship between generalization abilities and fuzziness of base classifiers in ensemble learning. IEEE Trans Fuzzy Syst 23(5):1638\u20131654","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"918_CR27","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-38634-3_19","volume-title":"Language Processing and Intelligent Information Systems","author":"Rados\u0142aw Szmit","year":"2013","unstructured":"Szmit R (2013) Locality sensitive hashing for similarity search using MapReduce on large scale data. In: Language processing and intelligent information systems, pp\u00a0171\u2013178"},{"key":"918_CR28","doi-asserted-by":"crossref","unstructured":"Chum O, Philbin J, Zisserman A (2008) Near duplicate image detection: min-Hash and tf-idf weighting. In: BMVC, pp\u00a0812\u2013815","DOI":"10.5244\/C.22.50"},{"key":"918_CR29","doi-asserted-by":"crossref","unstructured":"Wang H, Cao J, Shu L, Rafiei D (2013) Locality sensitive hashing revisited: filling the gap between theory and algorithm analysis. In Proceedings of the 22nd ACM international conference on information and knowledge management, pp\u00a01969\u20131978","DOI":"10.1145\/2505515.2505765"},{"key":"918_CR30","unstructured":"Li P, Owen A, Zhang CH (2012) One permutation hashing for efficient search and learning. arXiv preprint arXiv, pp\u00a01208\u20131259"},{"issue":"8","key":"918_CR31","first-page":"101","volume":"54","author":"P Li","year":"2011","unstructured":"Li P, Shrivastava A, Moore J, K\u00f6nig AC (2011) B-bit minwise hashing for large-scale learning. Comput Sci 54(8):101\u2013109","journal-title":"Comput Sci"},{"issue":"5","key":"918_CR32","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1109\/TCYB.2013.2263382","volume":"44","author":"X Wang","year":"2014","unstructured":"Wang X, Wang R, Feng H-M, Wang H (2014) A new approach to classifier fusion based on upper integral. IEEE Trans Cybern 44(5):620\u2013635","journal-title":"IEEE Trans Cybern"},{"key":"918_CR33","unstructured":"Li P, Gui W (2010) b-Bit minwise hashing for estimating three-way similarities. In: International conference on neural information processing systems, pp\u00a01387\u20131395"},{"key":"918_CR34","unstructured":"Frequent Itemset Mining Dataset Repository, Available at: \n                    http:\/\/fimi.ua.ac.be\/data\n                    \n                  . Accessed 18 Dec 2018"},{"issue":"4","key":"918_CR35","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1109\/TASLP.2015.2409733","volume":"23","author":"H Huang","year":"2015","unstructured":"Huang H, Xu H, Wang X, Silamu W (2015) Maximum f1-score discriminative training criterion for automatic mispronunciation detection. IEEE\/ACM Trans Audio Speech Lang Process 23(4):787\u2013797","journal-title":"IEEE\/ACM Trans Audio Speech Lang Process"},{"issue":"1","key":"918_CR36","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TCYB.2013.2245891","volume":"44","author":"X Wang","year":"2014","unstructured":"Wang X, He Y-L, Dabby D (2014) Non-naive bayesian classifiers for classification problems with continuous attributes. IEEE Trans Cybern 44(1):21\u201339","journal-title":"IEEE Trans Cybern"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-018-00918-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-018-00918-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-018-00918-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,4]],"date-time":"2020-01-04T00:21:20Z","timestamp":1578097280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-018-00918-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,4]]},"references-count":36,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["918"],"URL":"https:\/\/doi.org\/10.1007\/s13042-018-00918-x","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,4]]},"assertion":[{"value":"1 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}