{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T02:56:41Z","timestamp":1767841001202,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,12,26]],"date-time":"2017-12-26T00:00:00Z","timestamp":1514246400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Social Science Foundation of China","award":["16ZDA055"],"award-info":[{"award-number":["16ZDA055"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["91546121"],"award-info":[{"award-number":["91546121"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71231002"],"award-info":[{"award-number":["71231002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Natural Science Foundation of China (CN)","award":["61202247"],"award-info":[{"award-number":["61202247"]}]},{"name":"EU FP7 IRSES MobileCloud Project","award":["612212"],"award-info":[{"award-number":["612212"]}]},{"name":"111 Project of China","award":["B08004"],"award-info":[{"award-number":["B08004"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s11277-017-5169-0","type":"journal-article","created":{"date-parts":[[2017,12,26]],"date-time":"2017-12-26T10:15:37Z","timestamp":1514283337000},"page":"2157-2181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Mining Association Rules Based on Deep Pruning Strategies"],"prefix":"10.1007","volume":"102","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3204-6527","authenticated-orcid":false,"given":"Lei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yabin","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yihang","family":"Ou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daoxin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,26]]},"reference":[{"issue":"2","key":"5169_CR1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1023\/A:1019912421877","volume":"22","author":"IG Niemegeers","year":"2002","unstructured":"Niemegeers, I. G., & Groot, S. M. H. D. (2002). From personal area networks to personal networks: A user oriented approach. Wireless Personal Communications, 22(2), 175\u2013186.","journal-title":"Wireless Personal Communications"},{"key":"5169_CR2","volume-title":"Data mining: Concepts and techniques","author":"J Han","year":"2011","unstructured":"Han, J., Pei, J., & Kamber, M. (2011). Data mining: Concepts and techniques. London: Elsevier."},{"key":"5169_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imilienski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD international conference on the management of data (pp. 207\u2013216).","DOI":"10.1145\/170036.170072"},{"key":"5169_CR4","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In Proceedings of the international conference on very large databases (pp. 487\u2013499)."},{"key":"5169_CR5","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J., & Tsur, S. (1997). Dynamic itemset counting and implication rules for market basket data. In ACM SIGMOD conference management of data (1997).","DOI":"10.1145\/253260.253325"},{"key":"5169_CR6","unstructured":"Pei, J., Han, J., & Mao, R. (2000) Closet: An efficient algorithm for mining frequent closed itemsets. In : SIGMOD international workshop on data mining and knowledge discovery (2000)."},{"key":"5169_CR7","doi-asserted-by":"crossref","unstructured":"Zaki, M. J., & Hsiao, C. J. (2002) CHARM: An efficient algorithm for closed it emset mining. In Proceedings of the 2002 SIAM international conference on data mining (pp. 457\u2013473). Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9781611972726.27"},{"key":"5169_CR8","unstructured":"Borgelt, C. (2003). Efficient implementations of Apriori and Eclat. In Proceddings iEEE ICDM workshop on frequent item set mining implementations. CEUR workshop proceedings (p. 90)."},{"key":"5169_CR9","unstructured":"Jinjing, H., Lei, Z. Jiwen, Y., et al. (2008). An improved apriori algorithm. In The third international conference on computer science and education (ICCSE\u20192008) (pp. 604\u2013608)."},{"issue":"04","key":"5169_CR10","first-page":"942","volume":"2","author":"C Anshu","year":"2010","unstructured":"Anshu, C., & Raghuvanshi, C. S. (2010). An algorithm for frequent pattern mining based on apriori. International Journal on Computer Science and Engineering, 2(04), 942\u2013947.","journal-title":"International Journal on Computer Science and Engineering"},{"issue":"7","key":"5169_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.14299\/ijser.2012.07.001","volume":"3","author":"SA Abaya","year":"2012","unstructured":"Abaya, S. A. (2012). Association rule mining based on Apriori algorithm in minimizing candidate generation. International Journal of Scientific and Engineering Research, 3(7), 1\u20134.","journal-title":"International Journal of Scientific and Engineering Research"},{"issue":"23","key":"5169_CR12","first-page":"68","volume":"32","author":"L Chao","year":"2006","unstructured":"Chao, L., & Zhaoping, Y. (2006). The improvement apriori algorithm based on Boolean matrix. Computer Engineering, 32(23), 68\u201369.","journal-title":"Computer Engineering"},{"issue":"5","key":"5169_CR13","first-page":"411","volume":"3","author":"J Jha","year":"2013","unstructured":"Jha, J., & Ragha, L. (2013). Educational data mining using improved apriori algorithm. International Journal of Information and Computation Technology, 3(5), 411\u2013418.","journal-title":"International Journal of Information and Computation Technology"},{"issue":"5","key":"5169_CR14","first-page":"6","volume":"14","author":"S Dutt","year":"2014","unstructured":"Dutt, S., Choudhary, N., & Singh, D. (2014). An improved apriori algorithm based on matrix data structure. Global Journal of Computer Science and Technology, 14(5), 6\u201310.","journal-title":"Global Journal of Computer Science and Technology"},{"key":"5169_CR15","first-page":"290","volume":"2","author":"Y Shoujian","year":"2017","unstructured":"Shoujian, Y. (2017). The improvement of Apriori algorithm based on prefix itemsets. Journal of computer applications and software, 2, 290\u2013294.","journal-title":"Journal of computer applications and software"},{"key":"5169_CR16","doi-asserted-by":"crossref","unstructured":"Niu, K., Jiao, H., & Gao, Z., et al. (2017). A developed apriori algorithm based on frequent matrix. In Proceedings of the 5th international conference on bioinformatics and computational biology (pp. 55\u201358). ACM.","DOI":"10.1145\/3035012.3035019"},{"issue":"2","key":"5169_CR17","first-page":"349","volume":"54","author":"C Ying","year":"2016","unstructured":"Ying, C., & Zhigang, M. (2016). Improved apriori algorithm based on vector matrix optimization frequent items. Journal of Jilin University (Science Edition), 54(2), 349\u2013353.","journal-title":"Journal of Jilin University (Science Edition)"},{"key":"5169_CR18","volume-title":"The improved apriori algorithm in the analysis of college students psychological research","author":"Z Hongli","year":"2015","unstructured":"Hongli, Z. (2015). The improved apriori algorithm in the analysis of college students psychological research. Wuhan: Central China normal university."},{"key":"5169_CR19","first-page":"57","volume":"6","author":"Y Zhigang","year":"2010","unstructured":"Zhigang, Y., & Yueshun, H. (2010). An improved apriori algorithm based on the compressed transaction matrix multiplication. China\u2019s New Technology and New Products, 6, 57\u201358.","journal-title":"China\u2019s New Technology and New Products"},{"issue":"1","key":"5169_CR20","first-page":"110","volume":"42","author":"H Lvhui","year":"2015","unstructured":"Lvhui, H., Yulan, R., & Zhenlin, H. (2015). Improved apriori algorithm based on classification and database compression. Journal of ChengDu University of Technology Science & Technology Edition, 42(1), 110\u2013114.","journal-title":"Journal of ChengDu University of Technology Science & Technology Edition"},{"issue":"3","key":"5169_CR21","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1109\/TSMCB.2010.2086060","volume":"41","author":"L Cao","year":"2011","unstructured":"Cao, L., et al. (2011). Combined mining: Discovering informative knowledge in complex data. IEEE Transactions on Systems, Man, and Cybernetics Part B (Cybernetics), 41(3), 699\u2013712.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics Part B (Cybernetics)"},{"issue":"1","key":"5169_CR22","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/JAS.2017.7510316","volume":"4","author":"Y Lv","year":"2017","unstructured":"Lv, Y., Chen, Y., Zhang, X., et al. (2017). Social media based transportation research: The state of the work and the networking. IEEE\/CAA Journal of Automatica Sinica, 4(1), 19\u201326.","journal-title":"IEEE\/CAA Journal of Automatica Sinica"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-017-5169-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-5169-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-5169-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T07:03:54Z","timestamp":1751180634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-017-5169-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,26]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["5169"],"URL":"https:\/\/doi.org\/10.1007\/s11277-017-5169-0","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,26]]}}}