{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:15Z","timestamp":1740122355769,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T00:00:00Z","timestamp":1547683200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002540","name":"Namseoul University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002540","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10586-018-2871-y","type":"journal-article","created":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T03:02:18Z","timestamp":1547694138000},"page":"1049-1056","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Periodicity analysis using weighted sequential pattern in recommending service"],"prefix":"10.1007","volume":"22","author":[{"given":"Young Sung","family":"Cho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Won Shik","family":"Na","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Song Chul","family":"Moon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,17]]},"reference":[{"issue":"3","key":"2871_CR1","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1023\/A:1023588520138","volume":"6","author":"I Banicescu","year":"2003","unstructured":"Banicescu, I., Velusamy, V., Devaprasad, J.: On the scalability of dynamic scheduling scientific applications with adaptive weighted factoring. Clust. Comput. 6(3), 215\u2013226 (2003)","journal-title":"Clust. Comput."},{"issue":"2","key":"2871_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.9708\/jksci.2012.17.2.197","volume":"17","author":"Y-S Cho","year":"2012","unstructured":"Cho, Y.-S., Ryu, K.-H.: Personalized recommendation system using FP-tree mining based on RFM. J. Korea Soc. Comput. Inf. 17(2), 197\u2013206 (2012)","journal-title":"J. Korea Soc. Comput. Inf."},{"issue":"3","key":"2871_CR3","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10586-012-0199-6","volume":"16","author":"A Zhong","year":"2013","unstructured":"Zhong, A., et al.: Performance implications of non-uniform VCPU-PCPU mapping in virtualization environment. Clust. Comput. 16(3), 347\u2013358 (2013)","journal-title":"Clust. Comput."},{"key":"2871_CR4","doi-asserted-by":"crossref","unstructured":"Cho, Y.S., et al.: A study of recommending service based on customer inclination using AHP. In: Proceedings of the 2016 IEEE International Conference on Management of Innovation and Technology (ICMIT), IEEE, pp. 145\u2013149. (2016)","DOI":"10.1109\/ICMIT.2016.7605023"},{"key":"2871_CR5","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-94-007-5857-5_38","volume-title":"Ubiquitous information technologies and applications","author":"YS Cho","year":"2013","unstructured":"Cho, Y.S., et al.: Clustering method using item preference based on RFM for recommendation system in u-commerce. In: Han, Y.-H. (ed.) Ubiquitous information technologies and applications, pp. 353\u2013362. Springer, Dordrecht (2013)"},{"issue":"4","key":"2871_CR6","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s10586-012-0237-4","volume":"16","author":"L Riha","year":"2013","unstructured":"Riha, L., Malik, M., El-Ghazawi, T.: An adaptive hybrid OLAP architecture with optimized memory access patterns. Clust. Comput. 16(4), 663\u2013677 (2013)","journal-title":"Clust. Comput."},{"key":"2871_CR7","unstructured":"Gunaratne, K.A.: Globalisation, decimation of labour and strategic managerial options. In: Twelfth Australia and New Zealand Academy of Management International Conference. (1998)"},{"key":"2871_CR8","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proceedings of the Eleventh International Conference on Data Engineering, IEEE, pp. 3\u201314. (1995)"},{"issue":"2","key":"2871_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"Rakesh Agrawal","year":"1993","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Acm Sigmod Record, ACM, pp. 207\u2013216. (1993)","journal-title":"ACM SIGMOD Record"},{"key":"2871_CR10","first-page":"1","volume-title":"Advances in Database Technology \u2014 EDBT '96","author":"Ramakrishnan Srikant","year":"1996","unstructured":"Srikant, R., Agrawal, R.: Mining sequential patterns: generalizations and performance improvements. In: International Conference on Extending Database Technology. Springer, Berlin, Heidelberg, pp. 1\u201317. (1996)"},{"key":"2871_CR11","unstructured":"Chiu, D.-Y., Wu, Y.-H., Chen, A.L.P.: An efficient algorithm for mining frequent sequences by a new strategy without support counting. In: Proceedings. 20th International Conference on Data Engineering, 2004, IEEE, p. 375. (2004)"},{"key":"2871_CR12","unstructured":"Han, J., et al.: Prefixspan: mining sequential patterns efficiently by prefix-projected pattern growth. In: Proceedings of the 17th international conference on data engineering. pp. 215\u2013224. (2001)"},{"key":"2871_CR13","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J., Afshar, R.: CloSpan: mining: closed sequential patterns in large datasets. In: Proceedings of the 2003 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics. pp. 166\u2013177 (2003)","DOI":"10.1137\/1.9781611972733.15"},{"key":"2871_CR14","volume-title":"The elements of statistical learning: data mining, inference, and prediction","author":"R Tibshirani","year":"2001","unstructured":"Tibshirani, R., Friedman, J.: The elements of statistical learning: data mining, inference, and prediction. Springer, New York (2001)"},{"issue":"1","key":"2871_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0169-023X(02)00209-4","volume":"46","author":"F Masseglia","year":"2003","unstructured":"Masseglia, F., Poncelet, P., Teisseire, M.: Incremental mining of sequential patterns in large databases. Data Knowl. Eng. 46(1), 97\u2013121 (2003)","journal-title":"Data Knowl. Eng."},{"key":"2871_CR16","unstructured":"Cheung, D.W., et al.: Maintenance of discovered association rules in large databases: an incremental updating technique. In: Proceedings of the Twelfth International Conference on Data Engineering, 1996. IEEE, pp. 106\u2013114. (1996)"},{"issue":"5","key":"2871_CR17","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0306-4379(00)00021-1","volume":"25","author":"V Pudi","year":"2000","unstructured":"Pudi, V.: Haritsa JR quantifying the utility of the past in mining large databases. Inf. Syst. 25(5), 323\u2013343 (2000)","journal-title":"Inf. Syst."},{"issue":"1","key":"2871_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/A:1008689103430","volume":"9","author":"K Wang","year":"1997","unstructured":"Wang, K.: Discovering patterns from large and dynamic sequential data. J. Intell. Inf. Syst. 9(1), 33\u201356 (1997)","journal-title":"J. Intell. Inf. Syst."},{"issue":"2","key":"2871_CR19","first-page":"163","volume":"6","author":"AFA Dafa-Alla","year":"2010","unstructured":"Dafa-Alla, A.F.A., et al.: IMTAR: incremental mining of general temporal association rules. JIPS 6(2), 163\u2013176 (2010)","journal-title":"JIPS"},{"key":"2871_CR20","doi-asserted-by":"crossref","unstructured":"Herlocker, J.L., et al.: An algorithmic framework for performing collaborative filtering. In:\u00a0Proceedings of the 22nd annual International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, pp. 230\u2013237. (1999)","DOI":"10.1145\/312624.312682"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-2871-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-018-2871-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-2871-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T19:17:21Z","timestamp":1579202241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-018-2871-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,17]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["2871"],"URL":"https:\/\/doi.org\/10.1007\/s10586-018-2871-y","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2019,1,17]]},"assertion":[{"value":"7 April 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}