{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T23:39:50Z","timestamp":1781739590784,"version":"3.54.5"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T00:00:00Z","timestamp":1734912000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T00:00:00Z","timestamp":1734912000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Events are usually embedded in latent topics and the extraction of these latent topics are enabled by event detection algorithms. Unsupervised algorithms like Clustering algorithms are very useful for detecting events but with requirements which may not be relevant or easy to determine when using unstructured textual social media data. For instance, some algorithms are required to be used on specific data shapes, but determining the shape of an unstructured data may not be practical aside from the high level of noise in the data. Many of the existing algorithms work well with structured data, however, some of these algorithms can be adapted to unstructured data with the caveat that cluster formations may not contain consistent contextual information. We propose a novel Multi-Cycle Recursive Clustering Algorithm (MCRCA), able to sequentially eliminate noise, resulting in high homogeneous cluster formations. MCRCA does not require the initial specification of clusters numbers as the estimated number of clusters can be deduced at convergence. Our algorithm out-performs the classical LDA and K-Means algorithms in forming highly homogeneous clusters, context-wise.<\/jats:p>","DOI":"10.1007\/s12083-024-01826-4","type":"journal-article","created":{"date-parts":[[2024,12,22]],"date-time":"2024-12-22T21:29:27Z","timestamp":1734902967000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A multi-cycle recursive clustering algorithm for the analysis of social media data streams"],"prefix":"10.1007","volume":"18","author":[{"given":"Ayodeji O.","family":"Ayorinde","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Panneerselvam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,23]]},"reference":[{"issue":"1","key":"1826_CR1","doi-asserted-by":"publisher","first-page":"342","DOI":"10.3390\/app13010342","volume":"13","author":"MH Ahmed","year":"2022","unstructured":"Ahmed MH, Tiun S, Omar N, Sani NS (2022) Short Text Clustering Algorithms, Application and Challenges: A Survey. Appl Sci 13(1):342","journal-title":"Appl Sci"},{"issue":"2","key":"1826_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2499907.2499908","volume":"7","author":"T Lou","year":"2013","unstructured":"Lou T, Tang J, Hopcroft J, Fang Z, Ding X (2013) Learning to predict reciprocity and triadic closure in social networks. ACM Trans Knowl Discov From Data 7(2):1\u201325","journal-title":"ACM Trans Knowl Discov From Data"},{"key":"1826_CR3","doi-asserted-by":"publisher","unstructured":"Mohotti WA, Nayak R (2018) Corpus-based augmented media posts with density-based clustering for community detection. In:\u00a02018 IEEE 30th international conference on tools with artificial intelligence (ictai), pp 379\u2013386.\u00a0https:\/\/doi.org\/10.1109\/ICTAI.2018.00066","DOI":"10.1109\/ICTAI.2018.00066"},{"issue":"8","key":"1826_CR4","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.3390\/electronics9081295","volume":"9","author":"M Ahmed","year":"2020","unstructured":"Ahmed M, Seraj R, Islam SMS (2020) The k-means Algorithm: A Comprehensive Survey and Performance Evaluation. Electronics 9(8):1295","journal-title":"Electronics"},{"key":"1826_CR5","unstructured":"Chandrakala S, Antony Raj A (2020) A survey of event detection techniques in online social media networks. Eur J Mol Clin Med 7(7)"},{"key":"1826_CR6","unstructured":"Datta D (2019) A Small Survey on Event Detection Using Twitter. J. ACM[Online] 1 (1)1 Available: https:\/\/arxiv.org\/pdf\/2011.05801.pdf"},{"key":"1826_CR7","unstructured":"Wang Y, Goutte C (2019) Event detection using images of temporal word patterns. In: NewsIR@ SIGIR, pp 57\u201362"},{"issue":"4","key":"1826_CR8","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1177\/0165551517698564","volume":"44","author":"M Hasan","year":"2017","unstructured":"Hasan M, Orgun MA, Schwitter R (2017) A survey on real-time event detection from the twitter data stream. J Inf Sci 44(4):443\u2013463","journal-title":"J Inf Sci"},{"key":"1826_CR9","doi-asserted-by":"publisher","unstructured":"Wang X, Han X, Liu Z, Sun M, Li P (2019) Adversarial training for weakly supervised event detection. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, vol 1 (Long and Short Papers), pp 998\u20131008.\u00a0https:\/\/doi.org\/10.18653\/v1\/N19-1105","DOI":"10.18653\/v1\/N19-1105"},{"key":"1826_CR10","doi-asserted-by":"publisher","unstructured":"Lee MC, Chang JW, Hsieh TC (2014) A grammar-based semantic similarity algorithm for natural language sentence. Sci World J\u00a02014(1):437162.\u00a0https:\/\/doi.org\/10.1155\/2014\/437162","DOI":"10.1155\/2014\/437162"},{"key":"1826_CR11","doi-asserted-by":"publisher","unstructured":"Mikolov T, Sutskever I, Chen K, Corrado GS, Dean J (2013) Distributed representations of words and phrases and their compositionality. Adv Neural Inform Process Syst 26.\u00a0https:\/\/doi.org\/10.5555\/2999792.2999959","DOI":"10.5555\/2999792.2999959"},{"key":"1826_CR12","doi-asserted-by":"publisher","unstructured":"Angelov D (2020) Top2Vec: distributed representations of topics.\u00a0arXiv preprint arXiv:2008.09470.\u00a0https:\/\/doi.org\/10.48550\/arXiv.2008.09470","DOI":"10.48550\/arXiv.2008.09470"},{"issue":"2","key":"1826_CR13","first-page":"1188","volume":"32","author":"QV Le","year":"2014","unstructured":"Le QV, Mikolov T (2014) Distributed representations of sentences and documents. Proc 31st Int Conf Mach Learn, PMLR 32(2):1188\u20131196","journal-title":"Proc 31st Int Conf Mach Learn, PMLR"},{"key":"1826_CR14","doi-asserted-by":"publisher","unstructured":"Pennington J, Socher R, Manning CD (2014) Glove: global vectors for word representation. In: Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP), pp 1532\u20131543.\u00a0https:\/\/doi.org\/10.3115\/v1\/D14-1162","DOI":"10.3115\/v1\/D14-1162"},{"key":"1826_CR15","first-page":"4171","volume":"1","author":"J Devlin","year":"2019","unstructured":"Devlin J, Chang M, Lee K, Toutanova K (2019) BERT: Pre-training of deep bidirectional transformers for language understanding. Proc Conf North Am Chapter Assoc Comput Linguis: Human Lang Technol, Minneapolis, Minn 1:4171\u20134186","journal-title":"Proc Conf North Am Chapter Assoc Comput Linguis: Human Lang Technol, Minneapolis, Minn"},{"key":"1826_CR16","unstructured":"Radford A, Wu J, Child R, Luan D, Amodei D, Sutskever I (2019) Language models are unsupervised multitask learners. OpenAI Blog 1(8):9"},{"key":"1826_CR17","doi-asserted-by":"publisher","unstructured":"Liu Y, Ott M, Goyal N, Du J, Joshi M, Chen D, Levy O, Lewis M, Zettlemoyer L, Stoyanov V (2019) Roberta: A robustly optimized Bert pretraining approach arXiv:1907.11692v1[cs.CL][Online] Available: https:\/\/doi.org\/10.48550\/arXiv.1907.11692","DOI":"10.48550\/arXiv.1907.11692"},{"key":"1826_CR18","doi-asserted-by":"publisher","unstructured":"Peters ME, Neumann M, Iyyer M, Gardner M, Clark C, Lee K, Zettlemoyer L (2018) Deep contextualized word representations. In: Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT), New Orleans, pp 2227\u20132237.\u00a0https:\/\/doi.org\/10.3115\/v1\/D14-1162","DOI":"10.3115\/v1\/D14-1162"},{"key":"1826_CR19","doi-asserted-by":"publisher","unstructured":"Peinelt N, Nguyen D, Liakata M (2020) tBERT: topic models and BERT joining forces for semantic similarity detection. In: Proceedings of the 58th annual meeting of the association for computational linguistics, pp 7047\u20137055.\u00a0https:\/\/doi.org\/10.18653\/v1\/2020.acl-main.630","DOI":"10.18653\/v1\/2020.acl-main.630"},{"key":"1826_CR20","doi-asserted-by":"publisher","unstructured":"Lewis M (2019) Bart: denoising sequence-to-sequence pre-training for natural language generation, translation, and comprehension. arXiv preprint arXiv:1910.13461. https:\/\/doi.org\/10.48550\/arXiv.1910.13461","DOI":"10.48550\/arXiv.1910.13461"},{"key":"1826_CR21","first-page":"5926","volume":"97","author":"K Song","year":"2019","unstructured":"Song K, Tan X, Qin T, Lu J, Liu TY (2019) Mass: Masked sequence to sequence pretraining for language generation. Proc 36th Int Conf Mach Learn, Long Beach, California, PMLR 97:5926\u20135936","journal-title":"Proc 36th Int Conf Mach Learn, Long Beach, California, PMLR"},{"key":"1826_CR22","doi-asserted-by":"publisher","unstructured":"Dong L, Yang N, Wang W, Wei F, Liu X, Wang Y, Gao J, Zhou M, Hon H\u00a0(2019)\u00a0Unified language model pre-training for natural language understanding and generation.\u00a0Adv\u00a0Neural Inform Process Syst 32. https:\/\/doi.org\/10.48550\/arXiv.1905.03197","DOI":"10.48550\/arXiv.1905.03197"},{"key":"1826_CR23","first-page":"1","volume":"21","author":"C Raffel","year":"2020","unstructured":"Raffel C, Shazeer N, Roberts A, Lee K, Narang S, Matena M, Zhou Y, Li W, Liu PJ (2020) Exploring the limits of transfer learning with a unified text-to-text trans former. J Mach Learn Res 21:1\u201367","journal-title":"J Mach Learn Res"},{"key":"1826_CR24","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s10618-020-00735-3","volume":"35","author":"A Moreo","year":"2021","unstructured":"Moreo A, Esuli A, Sebastiani F (2021) Word-class embeddings for multiclass text classification. Data Min Knowl Disc 35:911\u2013963. https:\/\/doi.org\/10.1007\/s10618-020-00735-3","journal-title":"Data Min Knowl Disc"},{"key":"1826_CR25","doi-asserted-by":"publisher","unstructured":"Mikolov T (2013) Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781, 3781. https:\/\/doi.org\/10.48550\/arXiv.1301.3781","DOI":"10.48550\/arXiv.1301.3781"},{"key":"1826_CR26","unstructured":"Mikolov T, Yih WT, Zweig G (2013) Linguistic regularities in continuous space word representations.\u00a0In: Proceedings of the 2013 conference of the north american chapter of the association for computational linguistics: Human language technologies, pp 746\u2013751.\u00a0https:\/\/aclanthology.org\/N13-1090"},{"key":"1826_CR27","unstructured":"Rose J, Lennerholt C (2017) Low Cost Text Mining as a Strategy for Qualitative Researchers,\u201d Electronic Journal of Business Research Methods, 15 (1), pp. 2\u201316, Available: http:\/\/urn.kb.se\/resolve?urn=urn:nbn:se:his:diva-13539"},{"key":"1826_CR28","doi-asserted-by":"publisher","unstructured":"Ayorinde A, Panneerselvam J, Liu L, Miao D (2020) Topic clustering using induced squared correlation thresholding with dimension reduction. In: 2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA\/BDCloud\/SocialCom\/SustainCom).\u00a0IEEE, pp 948\u2013957.\u00a0https:\/\/doi.org\/10.1109\/ISPA-BDCloud-SocialCom-SustainCom51426.2020.00145","DOI":"10.1109\/ISPA-BDCloud-SocialCom-SustainCom51426.2020.00145"},{"key":"1826_CR29","doi-asserted-by":"publisher","unstructured":"Ye S, Huang X, Teng Y, Li Y (2018) K-means clustering algorithm based on improved cuckoo search algorithm and its application. In:\u00a02018 IEEE 3rd international conference on big data analysis (ICBDA).\u00a0IEEE, pp 422\u2013426.\u00a0https:\/\/doi.org\/10.1109\/ICBDA.2018.8367720","DOI":"10.1109\/ICBDA.2018.8367720"},{"key":"1826_CR30","doi-asserted-by":"publisher","unstructured":"Kalogeratos A, Zagorisios P, Likas A (2016) Improving text stream clustering using term burstiness and co-burstiness. In: Proceedings of the 9th hellenic conference on artificial intelligence,\u00a0pp 1\u20139.\u00a0https:\/\/doi.org\/10.1145\/2903220.2903229","DOI":"10.1145\/2903220.2903229"},{"key":"1826_CR31","doi-asserted-by":"publisher","unstructured":"Jayabharathy J, Kanmani S, Parveen AA (2011) Document clustering and topic discovery based on semantic similarity in scientific literature. In: 2011 IEEE 3rd international conference on communication software and networks. IEEE, pp 425\u2013429.\u00a0https:\/\/doi.org\/10.1109\/ICCSN.2011.6014600","DOI":"10.1109\/ICCSN.2011.6014600"},{"issue":"3","key":"1826_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3173044","volume":"12","author":"M Peng","year":"2018","unstructured":"Peng M, Zhu J, Wang H, Li X, Zhang Y, Zhang X, Tian G (2018) Mining EventOriented Topics in Microblog Stream with Unsupervised Multi-View Hierarchical Embedding. ACM Trans Knowl Discov Data 12(3):1\u201326. https:\/\/doi.org\/10.1145\/3173044","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1826_CR33","doi-asserted-by":"publisher","unstructured":"Shou L, Wang Z, Chen K, Chen G (2013) Sumblr: continuous summarization of evolving tweet streams. In: Proceedings of the 36th international ACM SIGIR\u00a0conference on research and development in information retrieval, pp 533\u2013542.\u00a0https:\/\/doi.org\/10.1145\/2484028.2484045","DOI":"10.1145\/2484028.2484045"},{"key":"1826_CR34","doi-asserted-by":"publisher","unstructured":"Xu S, Li S, Wen R, Huang W (2019) Traffic event detection using twitter data based on association rules.\u00a0ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences 4:543\u2013547.\u00a0https:\/\/doi.org\/10.5194\/isprs-annals-IV-2-W5-543-2019","DOI":"10.5194\/isprs-annals-IV-2-W5-543-2019"},{"key":"1826_CR35","doi-asserted-by":"publisher","unstructured":"Sakaki T, Okazaki M, Matsuo Y (2010) Earthquake shakes twitter users: real-time event detection by social sensors. In: Proceedings of the 19th international conference on World wide web, pp 851\u2013860.\u00a0https:\/\/doi.org\/10.1145\/1772690.1772777","DOI":"10.1145\/1772690.1772777"},{"issue":"9","key":"1826_CR36","first-page":"4009","volume":"10","author":"S Angel","year":"2015","unstructured":"Angel S, Mary L (2015) Cluster validity measures dynamic clustering algorithms. ARPN J Eng Appl Sci [Online] 10(9):4009\u20134012","journal-title":"ARPN J Eng Appl Sci [Online]"},{"key":"1826_CR37","doi-asserted-by":"publisher","unstructured":"Roy A, Pokutta S (2017)\u00a0Hierarchical clustering via spreading metrics.\u00a0J Mach Learn Res\u00a018(88):1\u201335.\u00a0https:\/\/doi.org\/10.48550\/arXiv.1610.09269","DOI":"10.48550\/arXiv.1610.09269"},{"key":"1826_CR38","doi-asserted-by":"publisher","unstructured":"Dasgupta S (2016) A cost function for similarity-based hierarchical clustering. In: Proceedings of the forty-eight annual ACM symposium on Theory of Computing, pp 118\u2013127.\u00a0https:\/\/doi.org\/10.48550\/arXiv.1510.05043","DOI":"10.48550\/arXiv.1510.05043"},{"key":"1826_CR39","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/bs.host.2018.06.003","volume":"38","author":"Q Wu","year":"2018","unstructured":"Wu Q, Vos P (2018) Handbook of Statistics. Sci Dir [Online] 38:75\u2013109. https:\/\/doi.org\/10.1016\/bs.host.2018.06.003","journal-title":"Sci Dir [Online]"},{"key":"1826_CR40","first-page":"993","volume":"3","author":"D Blei","year":"2003","unstructured":"Blei D, Ng A, Jordan M (2003) Latent Dirichlet Allocation. J Mach Learn Res 3:993\u20131022","journal-title":"J Mach Learn Res"},{"issue":"5","key":"1826_CR41","first-page":"30","volume":"4","author":"N Shah","year":"2012","unstructured":"Shah N, Mahajan S (2012) Document clustering: A detailed review. Int J Appl Inf Syst 4(5):30\u201338","journal-title":"Int J Appl Inf Syst"},{"key":"1826_CR42","doi-asserted-by":"publisher","unstructured":"Alghamdi R, Alfalqi K (2015) A survey of topic modeling in text mining. Int J Adv Comput Sci Appl (IJACSA) 6(1).\u00a0https:\/\/doi.org\/10.14569\/IJACSA.2015.060121","DOI":"10.14569\/IJACSA.2015.060121"},{"key":"1826_CR43","doi-asserted-by":"publisher","first-page":"2790","DOI":"10.1007\/s10489-020-02029-z","volume":"51","author":"R Lamsal","year":"2021","unstructured":"Lamsal R (2021) Design and analysis of a large-scale COVID-19 tweets dataset. Appl Intell 51:2790\u20132804","journal-title":"Appl Intell"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-024-01826-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-024-01826-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-024-01826-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T05:32:52Z","timestamp":1747459972000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-024-01826-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,23]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1826"],"URL":"https:\/\/doi.org\/10.1007\/s12083-024-01826-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2865325\/v1","asserted-by":"object"}]},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,23]]},"assertion":[{"value":"26 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not Applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not Applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to publish"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"61"}}