{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T01:08:42Z","timestamp":1764637722104,"version":"3.46.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030914448"},{"type":"electronic","value":"9783030914455"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91445-5_11","type":"book-chapter","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T11:05:40Z","timestamp":1638443140000},"page":"170-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["RevDet: Robust and Memory Efficient Event Detection and Tracking in Large News Feeds"],"prefix":"10.1007","author":[{"given":"Abdul Hameed","family":"Azeemi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad Hamza","family":"Sohail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Talha","family":"Zubair","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muaz","family":"Maqbool","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irfan","family":"Younas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omair","family":"Shafiq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"11_CR1","unstructured":"Allan, J., Carbonell, J.G., Doddington, G., Yamron, J., Yang, Y.: Topic detection and tracking pilot study final report (2003)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Allan, J., Papka, R., Lavrenko, V.: On-line new event detection and tracking. In: SIGIR, vol. 98, pp. 37\u201345. Citeseer (1998)","DOI":"10.1145\/290941.290954"},{"key":"11_CR3","unstructured":"Becker, H., Naaman, M., Gravano, L.: Beyond trending topics: real-world event identification on Twitter. In: Fifth International AAAI Conference on Weblogs and Social Media (2011)"},{"key":"11_CR4","unstructured":"Diao, Q., Jiang, J., Zhu, F., Lim, E.P.: Finding bursty topics from microblogs. In: Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers, vol. 1, pp. 536\u2013544. Association for Computational Linguistics (2012)"},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/TETC.2014.2330519","volume":"2","author":"A Fahad","year":"2014","unstructured":"Fahad, A., et al.: A survey of clustering algorithms for big data: taxonomy and empirical analysis. IEEE Trans. Emerg. Top. Comput. 2(3), 267\u2013279 (2014). https:\/\/doi.org\/10.1109\/TETC.2014.2330519","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1016\/j.ipm.2018.03.001","volume":"56","author":"M Hasan","year":"2019","unstructured":"Hasan, M., Orgun, M.A., Schwitter, R.: Real-time event detection from the twitter data stream using the TwitterNews+ framework. Inf. Process. Manage. 56(3), 1146\u20131165 (2019)","journal-title":"Inf. Process. Manage."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Hoang, T.A., Vo, K.D., Nejdl, W.: W2E: a worldwide-event benchmark dataset for topic detection and tracking. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, pp. 1847\u20131850. ACM (2018)","DOI":"10.1145\/3269206.3269309"},{"key":"11_CR8","unstructured":"Le, Q., Mikolov, T.: Distributed representations of sentences and documents. In: Proceedings of the 31st International Conference on International Conference on Machine Learning, ICML 2014, vol. 32, pp. II-1188\u2013II-1196. JMLR.org (2014). http:\/\/dl.acm.org\/citation.cfm?id=3044805.3045025"},{"key":"11_CR9","unstructured":"Leetaru, K., Schrodt, P.A.: GDELT: global data on events, location, and tone, 1979\u20132012. In: ISA Annual Convention, vol. 2, pp. 1\u201349. Citeseer (2013)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Backstrom, L., Kleinberg, J.: Meme-tracking and the dynamics of the news cycle. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 497\u2013506 (2009)","DOI":"10.1145\/1557019.1557077"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Osborne, M., et al.: Real-time detection, tracking, and monitoring of automatically discovered events in social media (2014)","DOI":"10.3115\/v1\/P14-5007"},{"key":"11_CR12","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine Learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Radinsky, K., Horvitz, E.: Mining the web to predict future events. In: Proceedings of the sixth ACM International Conference on Web Search and Data Mining, pp. 255\u2013264. ACM (2013)","DOI":"10.1145\/2433396.2433431"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Sayyadi, H., Hurst, M., Maykov, A.: Event detection and tracking in social streams. In: Third International AAAI Conference on Weblogs and Social Media (2009)","DOI":"10.1609\/icwsm.v3i1.13970"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: an efficient data clustering method for very large databases. In: ACM Sigmod Record, vol. 25, pp. 103\u2013114. ACM (1996)","DOI":"10.1145\/235968.233324"}],"container-title":["Lecture Notes in Computer Science","Advanced Analytics and Learning on Temporal Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91445-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T01:01:39Z","timestamp":1764637299000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91445-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030914448","9783030914455"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91445-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AALTD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Advanced Analytics and Learning on Temporal Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bilbao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaltd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/project.inria.fr\/aaltd21\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2-3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2-3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}