{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:19Z","timestamp":1740122659079,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T00:00:00Z","timestamp":1598486400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T00:00:00Z","timestamp":1598486400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s11277-020-07753-w","type":"journal-article","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T17:03:41Z","timestamp":1598547821000},"page":"1639-1657","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["High Utility Itemsets Mining Based on Divide-and-Conquer Strategy"],"prefix":"10.1007","volume":"116","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2824-961X","authenticated-orcid":false,"given":"Jiyong","family":"Liao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ailian","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"issue":"2","key":"7753_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM Sigmod Record, 29(2), 1\u201312.","journal-title":"ACM Sigmod Record"},{"key":"7753_CR2","doi-asserted-by":"crossref","unstructured":"Tseng, V. S., Wu, C. W., Shie, B. E., et al. (2010). UP-Growth: An efficient algorithm for high utility itemset mining. In Proceedings of the 16th international conference on knowledge discovery and data mining (pp. 253\u2013262).","DOI":"10.1145\/1835804.1835839"},{"issue":"8","key":"7753_CR3","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2013","unstructured":"Tseng, V. S., Shie, B. E., Wu, C. W., et al. (2013). Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Transactions on Knowledge and Data Engineering, 25(8), 1772\u20131786.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"7753_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinaki, 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"},{"issue":"9","key":"7753_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.5120\/4847-7118","volume":"39","author":"H Singh","year":"2012","unstructured":"Singh, H., & Dhir, R. (2012). An effective method for association rule mining based on transactional matrix. International Journal of Computer Applications, 39(9), 13\u201315.","journal-title":"International Journal of Computer Applications"},{"issue":"2","key":"7753_CR6","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1145\/383891.383893","volume":"26","author":"T Fukuda","year":"2001","unstructured":"Fukuda, T., Morimoto, Y., Morishita, S., et al. (2001). Data mining with optimized two-dimensional association rules. ACM Transactions on Database Systems, 26(2), 179\u2013213.","journal-title":"ACM Transactions on Database Systems"},{"key":"7753_CR7","doi-asserted-by":"crossref","unstructured":"Niu, K., Jiao, H., & Gao, Z., et al. (2017). A developed algorithm based on frequent matrix. In Proceedings of the 5th international conference on bioinformatics and computational biology (pp. 55\u201358).","DOI":"10.1145\/3035012.3035019"},{"key":"7753_CR8","doi-asserted-by":"crossref","unstructured":"Oguz, D., & Ergenc, B. (2012). Incremental itemset mining based on matrix Apriori algorithm. In Proceedings of the 14th international conference on data warehousing and knowledge discovery (pp. 192\u2013204).","DOI":"10.1007\/978-3-642-32584-7_16"},{"issue":"2","key":"7753_CR9","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":"7753_CR10","first-page":"159","volume":"33","author":"RK Roul","year":"2015","unstructured":"Roul, R. K., Varshneya, S., Kalra, A., et al. (2015). A novel modified Apriori approach for web document clustering. Computer Science, 33, 159\u2013171.","journal-title":"Computer Science"},{"key":"7753_CR11","doi-asserted-by":"crossref","unstructured":"Dahbi, A., Mouhir, M., & Balouki, Y. (2016). Classification of association rules based on K-means algorithm. In Proceedings the 4th IEEE international colloquium on information science and technology (pp. 300\u2013305).","DOI":"10.1109\/CIST.2016.7805061"},{"issue":"3","key":"7753_CR12","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.datak.2005.10.004","volume":"59","author":"H Yao","year":"2006","unstructured":"Yao, H., & Hamilton, H. J. (2006). Mining itemsets utilities from transaction databases. Data & Knowledge Engineering, 59(3), 603\u2013626.","journal-title":"Data & Knowledge Engineering"},{"key":"7753_CR13","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.asoc.2017.09.013","volume":"62","author":"W Ling","year":"2018","unstructured":"Ling, W., Jian, Y., Meng, P. P., et al. (2018). Mining temporal association rules with frequent itemsets tree. Applied Soft Computing, 62, 817\u2013829.","journal-title":"Applied Soft Computing"},{"issue":"5","key":"7753_CR14","first-page":"1148","volume":"48","author":"LTT Nguyen","year":"2017","unstructured":"Nguyen, L. T. T., Vo, B., Selamat, A., et al. (2017). Etarm: an efficient top-k association rule mining algorithm. Applied Intelligence, 48(5), 1148\u20131160.","journal-title":"Applied Intelligence"},{"issue":"7","key":"7753_CR15","doi-asserted-by":"publisher","first-page":"e0198066","DOI":"10.1371\/journal.pone.0198066","volume":"13","author":"TWJ Ming","year":"2018","unstructured":"Ming, T. W. J., Justin, Z., Sanket, C., et al. (2018). Mining association rules for low-frequency itemsets. PLoS ONE, 13(7), e0198066.","journal-title":"PLoS ONE"},{"key":"7753_CR16","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.engappai.2016.07.006","volume":"55","author":"CW Lin","year":"2016","unstructured":"Lin, C. W., Yang, L., Fournier-Viger, P., et al. (2016). Mining high-utility itemsets based on particle swarm optimization. Engineering Applications of Artificial Intelligence, 55, 320\u2013330.","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"5","key":"7753_CR17","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":"7753_CR18","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"},{"issue":"1","key":"7753_CR19","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan, J. A., & Wong, M. A. (1979). Algorithm as 136: a K-means clustering algorithm. Journal of the Royal Statistical Society Series C: Applied Statistics, 28(1), 100\u2013108.","journal-title":"Journal of the Royal Statistical Society Series C: Applied Statistics"},{"issue":"4","key":"7753_CR20","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s11704-009-0051-1","volume":"3","author":"L Chen","year":"2009","unstructured":"Chen, L., He, S., & Jiang, Q. (2009). Validation indices for projective clustering. Frontiers of Computer Science, 3(4), 477\u2013484.","journal-title":"Frontiers of Computer Science"},{"key":"7753_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw, P. J. (1987). Silhouettes: A graphical aid to the interpretation and validation of cluster analysis. Journal of Computational and Applied Mathematics, 20, 53\u201365.","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"4","key":"7753_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevA.94.042311","volume":"94","author":"CH Yu","year":"2016","unstructured":"Yu, C. H., Gao, F., Wang, Q. L., et al. (2016). Quantum algorithm for association rules mining. Physical Review A, 94(4), 1\u20138.","journal-title":"Physical Review A"},{"key":"7753_CR23","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ins.2017.02.058","volume":"399","author":"T Mai","year":"2017","unstructured":"Mai, T., Vo, B., & Nguyen, L. T. T. (2017). A lattice-based approach for mining high utility association rules. Information Sciences, 399, 81\u201397.","journal-title":"Information Sciences"},{"key":"7753_CR24","doi-asserted-by":"crossref","unstructured":"Teng, S., Li, J., Li, R., & Zhang, W. (2013). The calculation of similarity and its application in data mining. In Proceedings the international conference on pervasive computing and the networked world (pp. 563\u2013574).","DOI":"10.1007\/978-3-319-09265-2_57"},{"issue":"3","key":"7753_CR25","doi-asserted-by":"publisher","first-page":"2157","DOI":"10.1007\/s11277-017-5169-0","volume":"102","author":"L Li","year":"2017","unstructured":"Li, L., Li, Q., Wu, Y., et al. (2017). Mining association rules based on deep pruning strategies. Wireless Personal Communications, 102(3), 2157\u20132181.","journal-title":"Wireless Personal Communications"},{"issue":"7","key":"7753_CR26","first-page":"1654","volume":"38","author":"CJ Zhao","year":"2016","unstructured":"Zhao, C. J., Sun, Z. X., & Yuan, Y. (2016). An efficient association rule mining algorithm based on prejudging and screening. Journal of Electronics & Information Technology, 38(7), 1654\u20131659.","journal-title":"Journal of Electronics & Information Technology"},{"key":"7753_CR27","unstructured":"Goethals, B., & Zak, M. (2016). Frequent itemset mining implementations repository. http:\/\/fimi.ua.ac.be\/."},{"key":"7753_CR28","unstructured":"Pisharath, J., Liu, Y., & Parhi, J. (2016). NU-MineBench Version3.0.1. http:\/\/cucis.ece.northwestern.edu\/projects\/DMS\/MineBench.html."},{"key":"7753_CR29","doi-asserted-by":"crossref","unstructured":"Yesilbudak, M. (2016). Clustering analysis of multidimensional wind speed data using k-means approach. In Proceedings of the 2016 IEEE international conference on renewable energy research and applications (pp. 961\u2013965).","DOI":"10.1109\/ICRERA.2016.7884477"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-020-07753-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11277-020-07753-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-020-07753-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T23:26:07Z","timestamp":1630020367000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11277-020-07753-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,27]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["7753"],"URL":"https:\/\/doi.org\/10.1007\/s11277-020-07753-w","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"type":"print","value":"0929-6212"},{"type":"electronic","value":"1572-834X"}],"subject":[],"published":{"date-parts":[[2020,8,27]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}