{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T01:26:38Z","timestamp":1784769998199,"version":"3.55.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T00:00:00Z","timestamp":1724112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T00:00:00Z","timestamp":1724112000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Hochschule f\u00fcr angewandte Wissenschaften M\u00fcnchen"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Efficiently synchronizing data with social media feeds while minimizing unnecessary requests presents a significant challenge in various fields. This paper investigates prediction algorithms for determining the optimal update intervals for Facebook and Twitter (now X) feeds, focusing on metrics such as delay (the time between a post\u2019s publication and its retrieval) and requests per post. Variations in update intervals result in different algorithms producing varying results, making the selection of the most suitable algorithm for each feed crucial yet time-intensive. To address this, we propose three strategies for algorithm selection: baseline (applying a single algorithm to all feeds), optimum (identifying the best algorithm for each individual feed), and classification (selecting algorithms through a classification process based on each feed\u2019s unique update patterns and context). Our strategies leverage various prediction algorithms, including static and adaptive algorithms, and inhomogeneous Poisson processes. We evaluate these strategies using real-world data from Facebook and Twitter, thoroughly assessing their performance in terms of delay and request efficiency. The findings demonstrate that the strategy Optimum effectively identifies the best algorithms for each feed, ensuring the highest prediction quality, though at a considerable computational cost. On the other hand, the strategy Classification offers superior runtime performance required to select algorithms. This research highlights the trade-offs between delay and request efficiency and presents a comprehensive solution for optimizing update predictions in social media feeds.<\/jats:p>","DOI":"10.1007\/s13278-024-01315-9","type":"journal-article","created":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T09:02:44Z","timestamp":1724144564000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Intelligent algorithm selection for efficient update predictions in social media feeds"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7923-3365","authenticated-orcid":false,"given":"Max-Emanuel","family":"Keller","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0625-9921","authenticated-orcid":false,"given":"Alexander","family":"D\u00f6schl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4508-7667","authenticated-orcid":false,"given":"Peter","family":"Mandl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3287-5066","authenticated-orcid":false,"given":"Alexander","family":"Schill","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,20]]},"reference":[{"key":"1315_CR1","doi-asserted-by":"publisher","unstructured":"Adam G, Bouras C, Poulopoulos V (2010) Efficient extraction of news articles based on rss crawling. In: International conference on machine and web intelligence (ICMWI), 2010. IEEE, Piscataway, pp 1\u20137. https:\/\/doi.org\/10.1109\/ICMWI.2010.5647851","DOI":"10.1109\/ICMWI.2010.5647851"},{"issue":"2","key":"1315_CR2","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/1138394.1138399","volume":"31","author":"L Bright","year":"2006","unstructured":"Bright L, Gal A, Raschid L (2006) Adaptive pull-based policies for wide area data delivery. ACM Trans Database Syst 31(2):631\u2013671. https:\/\/doi.org\/10.1145\/1138394.1138399","journal-title":"ACM Trans Database Syst"},{"issue":"4","key":"1315_CR3","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/12.675713","volume":"47","author":"P Cao","year":"1998","unstructured":"Cao P, Liu C (1998) Maintaining strong cache consistency in the world wide web. IEEE Trans Comput 47(4):445\u2013457. https:\/\/doi.org\/10.1109\/12.675713","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"1315_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/335191.335391","volume":"29","author":"J Cho","year":"2000","unstructured":"Cho J, Garcia-Molina H (2000) Synchronizing a database to improve freshness. ACM SIGMOD Rec 29(2):117\u2013128. https:\/\/doi.org\/10.1145\/335191.335391","journal-title":"ACM SIGMOD Rec"},{"issue":"4","key":"1315_CR5","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1145\/958942.958945","volume":"28","author":"J Cho","year":"2003","unstructured":"Cho J, Garcia-Molina H (2003a) Effective page refresh policies for web crawlers. ACM Trans Database Syst 28(4):390\u2013426. https:\/\/doi.org\/10.1145\/958942.958945","journal-title":"ACM Trans Database Syst"},{"issue":"3","key":"1315_CR6","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/857166.857170","volume":"3","author":"J Cho","year":"2003","unstructured":"Cho J, Garcia-Molina H (2003b) Estimating frequency of change. ACM Trans Internet Technol 3(3):256\u2013290. https:\/\/doi.org\/10.1145\/857166.857170","journal-title":"ACM Trans Internet Technol"},{"key":"1315_CR7","unstructured":"Dang TKN, Bucur D, Atil B et\u00a0al (2021) Look back, look around: a systematic analysis of effective predictors for new outlinks in focused web crawling. arXiv:2111.05062"},{"key":"1315_CR8","doi-asserted-by":"publisher","unstructured":"Erlandsson F, Nia R, Boldt M et\u00a0al (2015) Crawling online social networks. In: 2015 Second European network intelligence conference (ENIC 2015). IEEE, Piscataway, pp 9\u201316. https:\/\/doi.org\/10.1109\/ENIC.2015.10","DOI":"10.1109\/ENIC.2015.10"},{"issue":"12","key":"1315_CR9","doi-asserted-by":"publisher","first-page":"686","DOI":"10.3390\/e19120686","volume":"19","author":"F Erlandsson","year":"2017","unstructured":"Erlandsson F, Br\u00f3dka P, Boldt M et al (2017) Do we really need to catch them all? A new user-guided social media crawling method. Entropy 19(12):686. https:\/\/doi.org\/10.3390\/e19120686","journal-title":"Entropy"},{"issue":"6","key":"1315_CR10","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1145\/504794.504797","volume":"48","author":"A Gal","year":"2001","unstructured":"Gal A, Eckstein J (2001) Managing periodically updated data in relational databases: a stochastic modeling approach. J ACM 48(6):1141\u20131183. https:\/\/doi.org\/10.1145\/504794.504797","journal-title":"J ACM"},{"key":"1315_CR11","doi-asserted-by":"publisher","unstructured":"Gao Q, Abel F, Houben GJ et\u00a0al (2012) A comparative study of users\u2019 microblogging behavior on sina weibo and twitter. In: Masthoff J, Mobasher B, Desmarais MC et\u00a0al (eds) User modeling, adaptation, and personalization. Lecture notes in computer science, vol 7379. Springer, Berlin, pp 88\u2013101. https:\/\/doi.org\/10.1007\/978-3-642-31454-4_8","DOI":"10.1007\/978-3-642-31454-4_8"},{"key":"1315_CR12","doi-asserted-by":"publisher","unstructured":"Golder SA, Wilkinson DM, Huberman BA (2007) Rhythms of social interaction: messaging within a massive online network. In: Steinfield C, Ackerman M, Contractor N et\u00a0al (eds) Communities and technologies 2007. Springer, London, pp 41\u201366. https:\/\/doi.org\/10.1007\/978-1-84628-905-7_3","DOI":"10.1007\/978-1-84628-905-7_3"},{"key":"1315_CR13","doi-asserted-by":"publisher","unstructured":"Guo L, Tan E, Chen S et\u00a0al (2009) Analyzing patterns of user content generation in online social networks. In: Elder J (ed) Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, New York, p 369. https:\/\/doi.org\/10.1145\/1557019.1557064","DOI":"10.1145\/1557019.1557064"},{"key":"1315_CR14","doi-asserted-by":"publisher","unstructured":"Guo R, Wang H, Li K et\u00a0al (2013) Cuvim: extracting fresh information from social network. In: Web-age information management. lecture notes in computer science\/information systems and applications, Incl. Internet\/Web, and HCI, vol 7923. Springer, Berlin, pp 351\u2013362. https:\/\/doi.org\/10.1007\/978-3-642-38562-9_36","DOI":"10.1007\/978-3-642-38562-9_36"},{"key":"1315_CR15","doi-asserted-by":"publisher","unstructured":"Guo R, Wang H, Zhong L et\u00a0al (2014) Harbinger: an analyzing and predicting system for online social network users\u2019 behavior. In: Database systems for advanced applications. Lecture notes in computer science\/information systems and applications, Incl. Internet\/Web, and HCI, vol 8422. Springer, Cham, pp 531\u2013534. https:\/\/doi.org\/10.1007\/978-3-319-05813-9_38","DOI":"10.1007\/978-3-319-05813-9_38"},{"key":"1315_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.future.2015.11.021","volume":"59","author":"R Guo","year":"2016","unstructured":"Guo R, Wang H, Chen M et al (2016) Parallelizing the extraction of fresh information from online social networks. Future Gener Comput Syst 59:33\u201346. https:\/\/doi.org\/10.1016\/j.future.2015.11.021","journal-title":"Future Gener Comput Syst"},{"key":"1315_CR17","unstructured":"Gwertzman J, Seltzer M (1996) World-wide web cache consistency. In: Proceedings of the 1996 annual conference on USENIX annual technical conference. USENIX Association, Berkeley, CA, USA, ATEC \u201996, p\u00a012. http:\/\/dl.acm.org\/citation.cfm?id=1268299.1268311"},{"issue":"4","key":"1315_CR18","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1007\/s11280-014-0288-y","volume":"18","author":"R Horincar","year":"2015","unstructured":"Horincar R, Amann B, Arti\u00e8res T (2015) Online refresh strategies for content based feed aggregation. World Wide Web 18(4):913\u2013947. https:\/\/doi.org\/10.1007\/s11280-014-0288-y","journal-title":"World Wide Web"},{"key":"1315_CR19","doi-asserted-by":"publisher","unstructured":"Keller ME, D\u00f6schl A, Mandl P et\u00a0al (2021) When she posts next? A comparison of refresh strategies for online social networks. In: Pardede E, Indrawan-Santiago M, Haghighi PD et\u00a0al (eds) The 23rd international conference on information integration and web intelligence. ACM, New York, pp 123\u2013129. https:\/\/doi.org\/10.1145\/3487664.3487778","DOI":"10.1145\/3487664.3487778"},{"key":"1315_CR20","doi-asserted-by":"publisher","unstructured":"Keller ME, D\u00f6schl A, Mandl P et\u00a0al (2023) Towards an adaptive algorithms selection on predicting the update interval for social media feeds. In: Rokne J, Wang D (eds) Proceedings of the international conference on advances in social networks analysis and mining. ACM, New York, pp 340\u2013344. https:\/\/doi.org\/10.1145\/3625007.3627474","DOI":"10.1145\/3625007.3627474"},{"key":"1315_CR21","unstructured":"Lee BS (2012) A temporal analysis of posting behavior in social media streams. In: International AAAI conference on web and social media; sixth international AAAI conference on weblogs and social media. https:\/\/www.aaai.org\/ocs\/index.php\/ICWSM\/ICWSM12\/paper\/view\/4741\/5094"},{"key":"1315_CR22","unstructured":"Lee BS, Hwang BY (2009) An efficient method predicting update probability on blogs"},{"issue":"529","key":"1315_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/01621459.2019.1585358","volume":"115","author":"C Lee","year":"2020","unstructured":"Lee C, Wilkinson DJ (2020) A hierarchical model of nonhomogeneous Poisson processes for Twitter retweets. J Am Stat Assoc 115(529):1\u201315. https:\/\/doi.org\/10.1080\/01621459.2019.1585358","journal-title":"J Am Stat Assoc"},{"key":"1315_CR24","doi-asserted-by":"publisher","unstructured":"Lee JJ, Whang KY, Lee BS et\u00a0al (2002) An update-risk based approach to ttl estimation in web caching. In: WISE 2002. IEEE Computer Society, Los Alamitos, Calif, pp 21\u201329. https:\/\/doi.org\/10.1109\/WISE.2002.1181640","DOI":"10.1109\/WISE.2002.1181640"},{"key":"1315_CR25","unstructured":"Lee BS, Jin Woo Im, Hwang BY et\u00a0al (2008) Design of an rss crawler with adaptive revisit manager. In: Proceedings of the twentieth international conference on software engineering & knowledge engineering (SEKE\u20192008), San Francisco, CA, USA, July 1\u20133, 2008. Knowledge Systems Institute Graduate School, pp 219\u2013222"},{"key":"1315_CR26","doi-asserted-by":"publisher","unstructured":"Lim BH, Lu D, Chen T et\u00a0al (2015) #mytweet via Instagram. In: Pei J, Silvestri F, Tang J (eds) Proceedings of the 2015 IEEE\/ACM international conference on advances in social networks analysis and mining. IEEE and Association for Computing Machinery Inc. (ACM), Piscataway, NJ and New York, NY, pp 113\u2013120. https:\/\/doi.org\/10.1145\/2808797.2808820","DOI":"10.1145\/2808797.2808820"},{"key":"1315_CR27","doi-asserted-by":"crossref","unstructured":"Lukasik M, Srijith PK, Cohn T et\u00a0al (2015) Modeling tweet arrival times using log-gaussian cox processes. In: Proceedings of the 2015 conference on empirical methods in natural language processing. Association for Computational Linguistics, Lisbon, Portugal, pp 250\u2013255. http:\/\/aclweb.org\/anthology\/D15-1028","DOI":"10.18653\/v1\/D15-1028"},{"issue":"3","key":"1315_CR28","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/1103323.1103326","volume":"15","author":"N Matloff","year":"2005","unstructured":"Matloff N (2005) Estimation of internet file-access\/modification rates from indirect data. ACM Trans Model Comput Simul 15(3):233\u2013253. https:\/\/doi.org\/10.1145\/1103323.1103326","journal-title":"ACM Trans Model Comput Simul"},{"key":"1315_CR29","doi-asserted-by":"publisher","unstructured":"O\u2019Neil EJ, O\u2019Neil PE, Weikum G (1993) The lru-k page replacement algorithm for database disk buffering. In: Proceedings of the 1993 ACM SIGMOD international conference on management of data\u2014SIGMOD \u201993. ACM Press, New York, NY, USA, pp 297\u2013306. https:\/\/doi.org\/10.1145\/170035.170081","DOI":"10.1145\/170035.170081"},{"key":"1315_CR30","unstructured":"Reichert S (2012) Analyse und vorhersage der aktualisierungen von web-feeds. Dissertation, TU Dresden, Dresden"},{"key":"1315_CR31","doi-asserted-by":"publisher","unstructured":"Reichert S, Urbansky D, Muthmann K, et\u00a0al (2011) Feeding the world. In: Proceedings of the 13th international conference on information integration and web-based applications and services. ACM, New York, NY, p\u00a044. https:\/\/doi.org\/10.1145\/2095536.2095546","DOI":"10.1145\/2095536.2095546"},{"issue":"7","key":"1315_CR32","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1109\/TKDE.2007.1041","volume":"19","author":"KC Sia","year":"2007","unstructured":"Sia KC, Cho J, Cho HK (2007a) Efficient monitoring algorithm for fast news alerts. IEEE Trans Knowl Data Eng 19(7):950\u2013961. https:\/\/doi.org\/10.1109\/TKDE.2007.1041","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1315_CR33","unstructured":"Sia KC, Cho J, Hino K et\u00a0al (2007b) Monitoring rss feeds based on user browsing pattern. In: Glance NS, Nicolov N, Adar E et\u00a0al (eds) Proceedings of the first international conference on weblogs and social media, ICWSM 2007, Boulder, Colorado, USA, Mar 26\u201328, 2007"},{"key":"1315_CR34","unstructured":"Singh SR (2007) Estimating the rate of web page updates. In: Proceedings of the twentieth international joint conference on artificial intelligence, pp 2874\u20132879"},{"key":"1315_CR35","unstructured":"Urbansky D, Reichert S, Muthmann K et\u00a0al (2011) An optimized web feed aggregation approach for generic feed types. https:\/\/www.aaai.org\/ocs\/index.php\/ICWSM\/ICWSM11\/paper\/view\/2797\/3221"},{"key":"1315_CR36","doi-asserted-by":"publisher","unstructured":"Yakushev AV, Boukhanovsky AV, Sloot PMA (2013) Topic crawler for social networks monitoring. In: Klinov P (ed) Knowledge engineering and the semantic web, communications in computer and information science, vol 394. Springer [u.a.], Berlin, pp 214\u2013227. https:\/\/doi.org\/10.1007\/978-3-642-41360-5_17","DOI":"10.1007\/978-3-642-41360-5_17"},{"key":"1315_CR37","doi-asserted-by":"publisher","unstructured":"Yang M, Wang H, Lim L et\u00a0al (2010) Optimizing content freshness of relations extracted from the web using keyword search. In: Elmagarmid A (ed) Proceedings of the 2010 ACM SIGMOD international conference on management of data. ACM, New York, NY, p 819. https:\/\/doi.org\/10.1145\/1807167.1807256","DOI":"10.1145\/1807167.1807256"},{"key":"1315_CR38","doi-asserted-by":"publisher","unstructured":"Ying QF, Chiu DM, Venkatramanan S et\u00a0al (2018) Profiling osn users based on temporal posting patterns. In: Champin PA, Gandon F, Lalmas M et\u00a0al (eds) Companion of the the web conference 2018 on the web conference 2018: WWW \u201918. ACM Press, New York, NY, USA, pp 1451\u20131456. https:\/\/doi.org\/10.1145\/3184558.3191592","DOI":"10.1145\/3184558.3191592"},{"issue":"4","key":"1315_CR39","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/369275.369282","volume":"29","author":"JCH Yuen","year":"2000","unstructured":"Yuen JCH, Chan E, Lam KY et al (2000) Cache invalidation scheme for mobile computing systems with real-time data. ACM SIGMOD Rec 29(4):34\u201339. https:\/\/doi.org\/10.1145\/369275.369282","journal-title":"ACM SIGMOD Rec"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-024-01315-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-024-01315-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-024-01315-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T05:41:29Z","timestamp":1740462089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-024-01315-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,20]]},"references-count":39,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["1315"],"URL":"https:\/\/doi.org\/10.1007\/s13278-024-01315-9","relation":{},"ISSN":["1869-5469"],"issn-type":[{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,20]]},"assertion":[{"value":"28 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"164"}}