{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T23:54:30Z","timestamp":1747180470025,"version":"3.40.5"},"reference-count":22,"publisher":"Informa UK Limited","issue":"4","license":[{"start":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T00:00:00Z","timestamp":1562716800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of Information and Telecommunication"],"published-print":{"date-parts":[[2019,10,2]]},"DOI":"10.1080\/24751839.2019.1634868","type":"journal-article","created":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T06:52:16Z","timestamp":1562827936000},"page":"480-493","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":3,"title":["Towards fast and memory efficient discovery of periodic frequent patterns"],"prefix":"10.1080","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9123-2840","authenticated-orcid":false,"given":"Vincent Mwintieru","family":"Nofong","sequence":"first","affiliation":[{"name":"Faculty of Engineering, University of Mines and Technology, Tarkwa, Ghana"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7810-6396","authenticated-orcid":false,"given":"John","family":"Wondoh","sequence":"additional","affiliation":[{"name":"School of Information Technology and Mathematical Sciences, University of South of Australia, Adelaide, Australia"}]}],"member":"301","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"key":"CIT0001","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T. & Swami, A. (1993). Mining association rules between sets of items in large databases. SIGMOD Rec. (Vol. 22(2), pp.\u00a0207\u2013216). ACM.","DOI":"10.1145\/170036.170072"},{"key":"CIT0002","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Lin, C. W., Duong, Q. H., Dam, T. L. \u0160ev\u010d\u00edk, L., Uhrin, D. & Voznak, M. (2017). PFPM: Discovering periodic frequent patterns with novel periodicity measures. Proceedings of the 2nd Czech-China scientific conference. InTech.","DOI":"10.5772\/66780"},{"key":"CIT0003","unstructured":"Fournier-Viger, P., Lin, J.\u00a0C.\u00a0W., Gomariz, A., Gueniche, T., Soltani, A., Deng, Z. & Lam, H. T. (2016). The SPMF open-source data mining library version 2.\u00a0Proceedings of European conference on machine learning and knowledge discovery in databases (pp.\u00a036\u201340). Cham: Springer."},{"key":"CIT0004","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J. & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Rec. (Vol. 29(2), pp.\u00a01\u201312). ACM.","DOI":"10.1145\/335191.335372"},{"key":"CIT0005","doi-asserted-by":"crossref","unstructured":"Kiran, R. U. & Kitsuregawa, M. (2013). Discovering quasi-periodic-frequent patterns in transactional databases. In V.\u00a0Bhatnagar, & S.\u00a0Srinivasa (Eds.), BDA 2013. LNCS, Vol. 8302 (pp.\u00a097\u2013115). Springer International.","DOI":"10.1007\/978-3-319-03689-2_7"},{"key":"CIT0006","doi-asserted-by":"crossref","unstructured":"Kiran, R. U. & Kitsuregawa, M. (2014). Novel techniques to reduce search space in periodic-frequent pattern mining. In S.\u00a0S.\u00a0Bhowmick, C.\u00a0E.\u00a0Dyreson, C.\u00a0S.\u00a0Jensen, M.\u00a0L.\u00a0Lee, A.\u00a0Muliantara, & B.\u00a0Thalheim (Eds.), DASFAA 2014. LNCS, Vol. 8422 (pp.\u00a0377\u2013391). Springer International.","DOI":"10.1007\/978-3-319-05813-9_25"},{"key":"CIT0007","unstructured":"Kiran, R. U. & Reddy, P. K. (2010). Towards efficient mining of periodic-frequent patterns in transactional databases. In P.\u00a0G.\u00a0Bringas, A.\u00a0Hameurlain, & G.\u00a0Quirchmayr (Eds.), DASFAA 2010. LNCS, Vol. 6262 (pp.\u00a0194\u2013208). Springer, Heidelberg."},{"key":"CIT0008","doi-asserted-by":"crossref","unstructured":"Kiran, R. U. & Reddy, P. K. (2011). An alternative interestingness measure for mining periodic-frequent patterns. In J.\u00a0X.\u00a0Yu, M.\u00a0H.\u00a0Kim, & R.\u00a0Unland (Eds.), DASFAA 2011. LNCS, Vol. 6587 (pp.\u00a0183\u2013192). Springer, Heidelberg.","DOI":"10.1007\/978-3-642-20149-3_15"},{"issue":"2","key":"CIT0009","first-page":"1506","volume":"5","author":"Kumar V.","year":"2013","journal-title":"International Journal of Engineering and Technology"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2017.04.007"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1007\/s40745-016-0078-8"},{"key":"CIT0012","unstructured":"Pei, J., Han, J., Lu, H., Nishio, S., Tang, S. & Yang, D. (2001). H-mine Hyper-structure mining of frequent patterns in large databases. Proceedings IEEE international conference on data mining (pp.\u00a0441\u2013448). IEEE."},{"key":"CIT0013","doi-asserted-by":"crossref","unstructured":"Rashid, M. M., Gondal, I. & Kamruzzaman, J. (2013). Regularly frequent patterns mining from sensor data stream. In M.\u00a0Lee, A.\u00a0Hirose, Z.\u00a0G.\u00a0Hou, & R.\u00a0Kil (Eds.), NIP 2013. LNCS, Vol. 8227 (pp.\u00a0417\u2013424). Springer, Berlin, Heidelberg.","DOI":"10.1007\/978-3-642-42042-9_52"},{"key":"CIT0014","unstructured":"Rashid, M. M., Karim, M. R., Jeong, B. S. & Choi, H. J. (2012). Efficient mining regularly frequent patterns in transactional databases. In S.\u00a0Lee, Z.\u00a0Peng, X.\u00a0Zhou, Y.\u00a0Moon, R.\u00a0Unland, & J.\u00a0Yoo (Eds.), DASFAA 2012. LNCS, Vol. 7238 (pp.\u00a0258\u2013271). Heidelberg: Springer."},{"key":"CIT0015","doi-asserted-by":"crossref","unstructured":"Shenoy, P., Haritsa, J. R., Sudarshan, S., Bhalotia, G., Bawa, M. & Shah, D. (2000). Turbo-charging vertical mining of large databases. In ACM SIGMOD Record (Vol. 29(2), pp.\u00a022\u201333). ACM.","DOI":"10.1145\/335191.335376"},{"key":"CIT0016","doi-asserted-by":"crossref","unstructured":"Surana, A., Kiran, R. U. & Reddy, P. K. (2012). An efficient approach to mine periodic-frequent patterns in transactional databases. In L.\u00a0Cao, J.\u00a0Z.\u00a0Huang, J.\u00a0Bailey, Y.\u00a0S.\u00a0Koh, & J.\u00a0Luo (Eds.), PAKDD 2011 Workshops. LNAI, Vol. 7104 (pp.\u00a0254\u2013266). Springer Heidelberg.","DOI":"10.1007\/978-3-642-28320-8_22"},{"key":"CIT0017","unstructured":"Tanbeer, S. K., Ahmed, C. F., Jeong, B. S. & Lee, Y. K. (2009). Discovering periodic-frequent patterns in transactional databases. In: T.\u00a0Theeramunkong, B.\u00a0Kijsirikul, N.\u00a0Cercone, & T.\u00a0Ho (Eds.), PAKDD 2009. LNAI, Vol. 5476 (pp.\u00a0242\u2013253). Springer Heidelberg."},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.09.005"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1145\/1644873.1644876"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"CIT0021","doi-asserted-by":"crossref","unstructured":"Zaki, M. J. & Gouda, K. (2003). Fast vertical mining using diffsets. Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 326\u2013335) Washington, D.C.","DOI":"10.1145\/956750.956788"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009773317876"}],"container-title":["Journal of Information and Telecommunication"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/tandfonline.com\/doi\/pdf\/10.1080\/24751839.2019.1634868","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/24751839.2019.1634868","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,30]],"date-time":"2020-08-30T03:35:33Z","timestamp":1598758533000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/24751839.2019.1634868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,10]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,10,2]]}},"alternative-id":["10.1080\/24751839.2019.1634868"],"URL":"https:\/\/doi.org\/10.1080\/24751839.2019.1634868","relation":{},"ISSN":["2475-1839","2475-1847"],"issn-type":[{"type":"print","value":"2475-1839"},{"type":"electronic","value":"2475-1847"}],"subject":[],"published":{"date-parts":[[2019,7,10]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tjit20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tjit20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2018-06-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-06-19","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-07-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}