{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T03:11:17Z","timestamp":1768446677102,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030461324","type":"print"},{"value":"9783030461331","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-46133-1_33","type":"book-chapter","created":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:04:17Z","timestamp":1745964257000},"page":"552-568","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Characterization and Early Detection of Evergreen News Articles"],"prefix":"10.1007","author":[{"given":"Yiming","family":"Liao","sequence":"first","affiliation":[]},{"given":"Shuguang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Eui-Hong","family":"Han","sequence":"additional","affiliation":[]},{"given":"Jongwuk","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Dongwon","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,30]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Bandari, R., Asur, S., Huberman, B.A.: The pulse of news in social media: forecasting popularity. In: ICWSM, pp. 26\u201333 (2012)","DOI":"10.1609\/icwsm.v6i1.14261"},{"key":"33_CR2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1162\/tacl_a_00051","volume":"5","author":"P Bojanowski","year":"2017","unstructured":"Bojanowski, P., Grave, E., Joulin, A., Mikolov, T.: Enriching word vectors with subword information. TACL 5, 135\u2013146 (2017)","journal-title":"TACL"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Chang, B., Zhu, H., Ge, Y., Chen, E., Xiong, H., Tan, C.: Predicting the popularity of online serials with autoregressive models. In: CIKM, pp. 1339\u20131348. ACM (2014)","DOI":"10.1145\/2661829.2662055"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, J., Adamic, L., Dow, P.A., Kleinberg, J.M., Leskovec, J.: Can cascades be predicted? In: WWW, pp. 925\u2013936. ACM (2014)","DOI":"10.1145\/2566486.2567997"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Pinto, H., Almeida, J.M., Gon\u00e7alves, M.A.: Using early view patterns to predict the popularity of youtube videos. In: WSDM, pp. 365\u2013374. ACM (2013)","DOI":"10.1145\/2433396.2433443"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Elhenfnawy, W., et al.: What differentiates news articles with short and long shelf lives? a case study on news articles at bloomberg. com. In: BDCloud-SocialCom-SustainCom, pp. 131\u2013136. IEEE (2016)","DOI":"10.1109\/BDCloud-SocialCom-SustainCom.2016.30"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Gelli, F., Uricchio, T., Bertini, M., Del Bimbo, A., Chang, S.F.: Image popularity prediction in social media using sentiment and context features. In: MM, pp. 907\u2013910. ACM (2015)","DOI":"10.1145\/2733373.2806361"},{"key":"33_CR8","unstructured":"Ke, G., et al.: Lightgbm: a highly efficient gradient boosting decision tree. In: NIPS, pp. 3149\u20133157 (2017)"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Keneshloo, Y., Wang, S., Han, E.H., Ramakrishnan, N.: Predicting the popularity of news articles. In: SDM, pp. 441\u2013449. SIAM (2016)","DOI":"10.1137\/1.9781611974348.50"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Lerman, K., Hogg, T.: Using a model of social dynamics to predict popularity of news. In: WWW, pp. 621\u2013630. ACM (2010)","DOI":"10.1145\/1772690.1772754"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Backstrom, L., Kleinberg, J.: Meme-tracking and the dynamics of the news cycle. In: SIGKDD, pp. 497\u2013506. ACM (2009)","DOI":"10.1145\/1557019.1557077"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Ma, C., Yan, Z., Chen, C.W.: LARM: a lifetime aware regression model for predicting youtube video popularity. In: CIKM, pp. 467\u2013476. ACM (2017)","DOI":"10.1145\/3132847.3132997"},{"key":"33_CR13","unstructured":"Martin, F., Johnson, M.: More efficient topic modelling through a noun only approach. In: ALTA Workshop, pp. 111\u2013115 (2015)"},{"key":"33_CR14","unstructured":"Marujo, L., Bugalho, M., Neto, J.P.d.S., Gershman, A., Carbonell, J.: Hourly traffic prediction of news stories. arXiv preprint arXiv:1306.4608 (2013)"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Mishra, S., Rizoiu, M.A., Xie, L.: Feature driven and point process approaches for popularity prediction. In: CIKM, pp. 1069\u20131078. ACM (2016)","DOI":"10.1145\/2983323.2983812"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Rizos, G., Papadopoulos, S., Kompatsiaris, Y.: Predicting news popularity by mining online discussions. In: WWW, pp. 737\u2013742. ACM (2016)","DOI":"10.1145\/2872518.2890096"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Setty, V., Anand, A., Mishra, A., Anand, A.: Modeling event importance for ranking daily news events. In: WSDM, pp. 231\u2013240. ACM (2017)","DOI":"10.1145\/3018661.3018728"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Shen, H.W., Wang, D., Song, C., Barab\u00e1si, A.L.: Modeling and predicting popularity dynamics via reinforced poisson processes. In: AAAI, pp. 291\u2013297 (2014)","DOI":"10.1609\/aaai.v28i1.8739"},{"issue":"8","key":"33_CR19","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/1787234.1787254","volume":"53","author":"G Szabo","year":"2010","unstructured":"Szabo, G., Huberman, B.A.: Predicting the popularity of online content. Commun. ACM 53(8), 80\u201388 (2010)","journal-title":"Commun. ACM"},{"issue":"2","key":"33_CR20","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1109\/TBC.2016.2540522","volume":"62","author":"Z Tan","year":"2016","unstructured":"Tan, Z., Wang, Y., Zhang, Y., Zhou, J.: A novel time series approach for predicting the long-term popularity of online videos. IEEE Trans. Broadcast. 62(2), 436\u2013445 (2016)","journal-title":"IEEE Trans. Broadcast."},{"issue":"1","key":"33_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-014-0174-8","volume":"4","author":"A Tatar","year":"2014","unstructured":"Tatar, A., Antoniadis, P., Amorim, M.D., Fdida, S.: From popularity prediction to ranking online news. Soc. Netw. Anal. Min. 4(1), 1\u201312 (2014). https:\/\/doi.org\/10.1007\/s13278-014-0174-8","journal-title":"Soc. Netw. Anal. Min."},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Tatar, A., Leguay, J., Antoniadis, P., Limbourg, A., de Amorim, M.D., Fdida, S.: Predicting the popularity of online articles based on user comments. In: WIMS, p. 67. ACM (2011)","DOI":"10.1145\/1988688.1988766"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Tsagkias, M., Weerkamp, W., De Rijke, M.: Predicting the volume of comments on online news stories. In: CIKM, pp. 1765\u20131768. ACM (2009)","DOI":"10.1145\/1645953.1646225"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Wu, B., Mei, T., Cheng, W.H., Zhang, Y., et al.: Unfolding temporal dynamics: predicting social media popularity using multi-scale temporal decomposition. In: AAAI, pp. 272\u2013278 (2016)","DOI":"10.1609\/aaai.v30i1.9970"},{"key":"33_CR25","doi-asserted-by":"crossref","unstructured":"Yuan, J., et al..: LightLDA: big topic models on modest computer clusters. In: WWW, pp. 1351\u20131361. ACM (2015)","DOI":"10.1145\/2736277.2741115"},{"key":"33_CR26","doi-asserted-by":"crossref","unstructured":"Zhao, Q., Erdogdu, M.A., He, H.Y., Rajaraman, A., Leskovec, J.: SEISMIC: a self-exciting point process model for predicting tweet popularity. In: SIGKDD, pp. 1513\u20131522. ACM (2015)","DOI":"10.1145\/2783258.2783401"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-46133-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:04:22Z","timestamp":1745964262000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-46133-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030461324","9783030461331"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-46133-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"W\u00fcrzburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ecmlpkdd2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"733","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":"130","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":"18% - 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":"3.04","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":"5.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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ECML PKDD Workshops Information: single-blind review, submissions: 200, full papers accepted: 70, short papers accepted: 46","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}