{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:04Z","timestamp":1750221004348,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Danish Council for Independent Research","award":["9041-00382B"],"award-info":[{"award-number":["9041-00382B"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3340531.3411886","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T06:18:51Z","timestamp":1603088331000},"page":"635-644","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Selecting Influential Features by a Learnable Content-Aware Linear Threshold Model"],"prefix":"10.1145","author":[{"given":"Ansh","family":"Khurana","sequence":"first","affiliation":[{"name":"IIT Bombay, Mumbai, India"}]},{"given":"Alvis","family":"Logins","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}]},{"given":"Panagiotis","family":"Karras","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1110.1421"},{"key":"e_1_3_2_2_2_1","series-title":"SIAM SDM.","volume-title":"Influence Maximization with Viral Product Design","author":"Barbieri Nicola","unstructured":"Nicola Barbieri and Francesco Bonchi . 2014. Influence Maximization with Viral Product Design . In SIAM SDM. Nicola Barbieri and Francesco Bonchi. 2014. Influence Maximization with Viral Product Design. In SIAM SDM."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Nicola Barbieri Francesco Bonchi and Giuseppe Manco. 2012. Topic-Aware Social Influence Propagation Models. In ICDM.  Nicola Barbieri Francesco Bonchi and Giuseppe Manco. 2012. Topic-Aware Social Influence Propagation Models. In ICDM.","DOI":"10.1109\/ICDM.2012.122"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Christian Borgs Michael Brautbar Jennifer T. Chayes and Brendan Lucier. 2014. Maximizing Social Influence in Nearly Optimal Time. In SODA.  Christian Borgs Michael Brautbar Jennifer T. Chayes and Brendan Lucier. 2014. Maximizing Social Influence in Nearly Optimal Time. In SODA.","DOI":"10.1137\/1.9781611973402.70"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Wei Chen Chi Wang and Yajun Wang. 2010. Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale Social Networks. In KDD.  Wei Chen Chi Wang and Yajun Wang. 2010. Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale Social Networks. In KDD.","DOI":"10.1145\/1835804.1835934"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-012-0540-7"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-013-0098-8"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.intmar.2012.01.003"},{"key":"e_1_3_2_2_10_1","volume-title":"Lakshmanan","author":"Goyal Amit","year":"2010","unstructured":"Amit Goyal , Francesco Bonchi , and Laks V. S . Lakshmanan . 2010 . Learning Influence Probabilities in Social Networks. In WSDM. Amit Goyal, Francesco Bonchi, and Laks V. S. Lakshmanan. 2010. Learning Influence Probabilities in Social Networks. In WSDM."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047492"},{"key":"e_1_3_2_2_12_1","volume-title":"Lakshmanan","author":"Goyal Amit","year":"2011","unstructured":"Amit Goyal , Wei Lu , and Laks V. S . Lakshmanan . 2011 . SIMPATH : An Efficient Algorithm for Influence Maximization under the Linear Threshold Model. In ICDM. Amit Goyal, Wei Lu, and Laks V. S. Lakshmanan. 2011. SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model. In ICDM."},{"key":"e_1_3_2_2_13_1","volume-title":"Growing scale-free networks with tunable clustering. Phys. Rev. E65","author":"Holme Petter","year":"2002","unstructured":"Petter Holme and Beom Jun Kim . 2002. Growing scale-free networks with tunable clustering. Phys. Rev. E65 ( 2002 ), 026107. Issue 2. Petter Holme and Beom Jun Kim. 2002. Growing scale-free networks with tunable clustering. Phys. Rev. E65 (2002), 026107. Issue 2."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Sergei Ivanov Konstantinos Theocharidis Manolis Terrovitis and Panagiotis Karras. 2017. Content Recommendation for Viral Social Influence. In SIGIR.  Sergei Ivanov Konstantinos Theocharidis Manolis Terrovitis and Panagiotis Karras. 2017. Content Recommendation for Viral Social Influence. In SIGIR.","DOI":"10.1145\/3077136.3080788"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Panagiotis Karras Artyom Nikitin Muhammad Saad Rudrika Bhatt Denis Antyukhov and Stratos Idreos. 2016. Adaptive Indexing over Encrypted Numeric Data. In SIGMOD.  Panagiotis Karras Artyom Nikitin Muhammad Saad Rudrika Bhatt Denis Antyukhov and Stratos Idreos. 2016. Adaptive Indexing over Encrypted Numeric Data. In SIGMOD.","DOI":"10.1145\/2882903.2882932"},{"key":"e_1_3_2_2_16_1","volume-title":"Mass communications research and the study of popular culture: An editor","author":"Katz Elihu","year":"1959","unstructured":"Elihu Katz . 1959. Mass communications research and the study of popular culture: An editor ial note on a possible future of this journal.Studies in Public Communication 2 ( 1959 ), 1--6. Elihu Katz. 1959. Mass communications research and the study of popular culture: An editorial note on a possible future of this journal.Studies in Public Communication 2 (1959), 1--6."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"David Kempe Jon Kleinberg and \u00c9va Tardos. 2003. Maximizing the Spread of Influence through a Social Network. In KDD.  David Kempe Jon Kleinberg and \u00c9va Tardos. 2003. Maximizing the Spread of Influence through a Social Network. In KDD.","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Ricardo Lage Peter Dolog and Martin Leginus. 2013. Vector Space Models for the Classification of Short Messages on Social Network Services. In WEBIST.  Ricardo Lage Peter Dolog and Martin Leginus. 2013. Vector Space Models for the Classification of Short Messages on Social Network Services. In WEBIST.","DOI":"10.1007\/978-3-662-44300-2_13"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Siyu Lei Silviu Maniu Luyi Mo Reynold Cheng and Pierre Senellart. 2015. Online Influence Maximization. In KDD.  Siyu Lei Silviu Maniu Luyi Mo Reynold Cheng and Pierre Senellart. 2015. Online Influence Maximization. In KDD.","DOI":"10.1145\/2783258.2783271"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Jure Leskovec Jon M. Kleinberg and Christos Faloutsos. 2005. Graphs over Time: Densification Laws Shrinking Diameters and Possible Explanations. In KDD.  Jure Leskovec Jon M. Kleinberg and Christos Faloutsos. 2005. Graphs over Time: Densification Laws Shrinking Diameters and Possible Explanations. In KDD.","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_2_21_1","unstructured":"Jianxin Li Chengfei Liu Lu Chen Zhenying He Amitava Datta and Feng Xia. 2017. iTopic: Influential Topic Discovery from Information Networks via Keyword Query. In WWW Companion.  Jianxin Li Chengfei Liu Lu Chen Zhenying He Amitava Datta and Feng Xia. 2017. iTopic: Influential Topic Discovery from Information Networks via Keyword Query. In WWW Companion."},{"key":"e_1_3_2_2_22_1","volume-title":"Yi Chen, Timos K. Sellis, and J. Shane Culpepper.","author":"Li Jianxin","year":"2016","unstructured":"Jianxin Li , Chengfei Liu , Jeffrey Xu Yu , Yi Chen, Timos K. Sellis, and J. Shane Culpepper. 2016 . Personalized Influential Topic Search via Social Network Summarization. IEEE TKDE 28, 7 (2016), 1820--1834. Jianxin Li, Chengfei Liu, Jeffrey Xu Yu, Yi Chen, Timos K. Sellis, and J. Shane Culpepper. 2016. Personalized Influential Topic Search via Social Network Summarization. IEEE TKDE28, 7 (2016), 1820--1834."},{"key":"e_1_3_2_2_23_1","unstructured":"Yuchen Li Ju Fan George V. Ovchinnikov and Panagiotis Karras. 2019. Maximizing Multifaceted Network Influence. In ICDE.  Yuchen Li Ju Fan George V. Ovchinnikov and Panagiotis Karras. 2019. Maximizing Multifaceted Network Influence. In ICDE."},{"key":"e_1_3_2_2_24_1","volume-title":"Influence Maximization on Social Graphs: A Survey","author":"Li Yuchen","year":"2018","unstructured":"Yuchen Li , Ju Fan , Yanhao Wang , and Kian-Lee Tan . 2018. Influence Maximization on Social Graphs: A Survey . IEEE TKDE 30, 10 ( 2018 ), 1852--1872. Yuchen Li, Ju Fan, Yanhao Wang, and Kian-Lee Tan. 2018. Influence Maximization on Social Graphs: A Survey.IEEE TKDE30, 10 (2018), 1852--1872."},{"key":"e_1_3_2_2_25_1","volume-title":"Content-based Network Influence Probabilities: Extraction and Application. In ICDM Workshops.","author":"Logins Alvis","year":"2019","unstructured":"Alvis Logins and Panagiotis Karras . 2019 . Content-based Network Influence Probabilities: Extraction and Application. In ICDM Workshops. Alvis Logins and Panagiotis Karras. 2019. Content-based Network Influence Probabilities: Extraction and Application. In ICDM Workshops."},{"key":"e_1_3_2_2_26_1","unstructured":"Alvis Logins and Panagiotis Karras. 2019. An Experimental Study on Network Immunization. In EDBT.  Alvis Logins and Panagiotis Karras. 2019. An Experimental Study on Network Immunization. In EDBT."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380028"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_2_29_1","volume-title":"Hwee Hwa Pang, and St\u00e9phane Bressan","author":"Nobari Sadegh","year":"2014","unstructured":"Sadegh Nobari , Panagiotis Karras , Hwee Hwa Pang, and St\u00e9phane Bressan . 2014 . L-opacity : Linkage-Aware Graph Anonymization. In EDBT. Sadegh Nobari, Panagiotis Karras, Hwee Hwa Pang, and St\u00e9phane Bressan. 2014. L-opacity: Linkage-Aware Graph Anonymization. In EDBT."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/4236.978369"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"e_1_3_2_2_32_1","unstructured":"Kazumi Saito Ryohei Nakano and Masahiro Kimura. 2008. Prediction of Information Diffusion Probabilities for Independent Cascade Model. In Knowledge-Based Intelligent Information and Engineering Systems.  Kazumi Saito Ryohei Nakano and Masahiro Kimura. 2008. Prediction of Information Diffusion Probabilities for Independent Cascade Model. In Knowledge-Based Intelligent Information and Engineering Systems."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Youze Tang Xiaokui Xiao and Yanchen Shi. 2014. Influence Maximization:Near-Optimal Time Complexity Meets Practical Efficiency. In SIGMOD.  Youze Tang Xiaokui Xiao and Yanchen Shi. 2014. Influence Maximization:Near-Optimal Time Complexity Meets Practical Efficiency. In SIGMOD.","DOI":"10.1145\/2588555.2593670"},{"key":"e_1_3_2_2_34_1","unstructured":"Guangmo Tong Ruiqi Wang Zheng Dong and Xiang Li. 2020. Time-constrained Adaptive Influence Maximization. (2020). arXiv:2001.01742v2  Guangmo Tong Ruiqi Wang Zheng Dong and Xiang Li. 2020. Time-constrained Adaptive Influence Maximization. (2020). arXiv:2001.01742v2"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"e_1_3_2_2_36_1","unstructured":"Mingqiang Xue Panagiotis Karras Chedy Ra\u00efssi Panos Kalnis and Hung KengPung. 2012. Delineating Social Network Data Anonymization via Random Edge Perturbation. In CIKM.  Mingqiang Xue Panagiotis Karras Chedy Ra\u00efssi Panos Kalnis and Hung KengPung. 2012. Delineating Social Network Data Anonymization via Random Edge Perturbation. In CIKM."}],"event":{"name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Virtual Event Ireland","acronym":"CIKM '20"},"container-title":["Proceedings of the 29th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3411886","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3411886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:50Z","timestamp":1750206350000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3411886"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":36,"alternative-id":["10.1145\/3340531.3411886","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3411886","relation":{},"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"2020-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}