{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:41:28Z","timestamp":1757454088626,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031466601"},{"type":"electronic","value":"9783031466618"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-46661-8_51","type":"book-chapter","created":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:02:29Z","timestamp":1699102949000},"page":"772-786","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Influence Maximization with\u00a0Tag Revisited: Exploiting the\u00a0Bi-submodularity of\u00a0the\u00a0Tag-Based Influence Function"],"prefix":"10.1007","author":[{"given":"Atharva","family":"Tekawade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suman","family":"Banerjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,5]]},"reference":[{"key":"51_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2022.103014","volume":"125","author":"R Alghamdi","year":"2023","unstructured":"Alghamdi, R., Bellaiche, M.: A cascaded federated deep learning based framework for detecting wormhole attacks in IoT networks. Comput. Secur. 125, 103014 (2023)","journal-title":"Comput. Secur."},{"issue":"1\u20133","key":"51_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0012-365X(94)00246-F","volume":"148","author":"K Ando","year":"1996","unstructured":"Ando, K., Fujishige, S., Naitoh, T.: A characterization of bisubmodular functions. Discret. Math. 148(1\u20133), 299\u2013303 (1996)","journal-title":"Discret. Math."},{"issue":"1","key":"51_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s13278-021-00850-z","volume":"12","author":"S Banerjee","year":"2022","unstructured":"Banerjee, S., Pal, B.: Budgeted influence and earned benefit maximization with tags in social networks. Soc. Netw. Anal. Min. 12(1), 21 (2022)","journal-title":"Soc. Netw. Anal. Min."},{"key":"51_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-030-62005-9_11","volume-title":"Web Information Systems Engineering \u2013 WISE 2020","author":"S Banerjee","year":"2020","unstructured":"Banerjee, S., Pal, B., Jenamani, M.: Budgeted influence maximization with tags in social networks. In: Huang, Z., Beek, W., Wang, H., Zhou, R., Zhang, Y. (eds.) WISE 2020. LNCS, vol. 12342, pp. 141\u2013152. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62005-9_11"},{"issue":"10","key":"51_CR5","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), P10008 (2008)","journal-title":"J. Stat. Mech. Theory Exp."},{"issue":"2","key":"51_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/2503792.2503797","volume":"42","author":"A Guille","year":"2013","unstructured":"Guille, A., Hacid, H., Favre, C., Zighed, D.A.: Information diffusion in online social networks: a survey. ACM SIGMOD Rec. 42(2), 17\u201328 (2013)","journal-title":"ACM SIGMOD Rec."},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Ke, X., Khan, A., Cong, G.: Finding seeds and relevant tags jointly: for targeted influence maximization in social networks. In: Proceedings of the 2018 International Conference on Management of Data, pp. 1097\u20131111 (2018)","DOI":"10.1145\/3183713.3199670"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"issue":"14","key":"51_CR9","doi-asserted-by":"publisher","first-page":"3200","DOI":"10.1103\/PhysRevLett.86.3200","volume":"86","author":"R Pastor-Satorras","year":"2001","unstructured":"Pastor-Satorras, R., Vespignani, A.: Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86(14), 3200 (2001)","journal-title":"Phys. Rev. Lett."},{"issue":"2","key":"51_CR10","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1109\/TAFFC.2020.2964549","volume":"13","author":"A Shukla","year":"2020","unstructured":"Shukla, A., Gullapuram, S.S., Katti, H., Kankanhalli, M., Winkler, S., Subramanian, R.: Recognition of advertisement emotions with application to computational advertising. IEEE Trans. Affect. Comput. 13(2), 781\u2013792 (2020)","journal-title":"IEEE Trans. Affect. Comput."},{"key":"51_CR11","unstructured":"Singh, A., Guillory, A., Bilmes, J.: On bisubmodular maximization. In: Artificial Intelligence and Statistics, pp. 1055\u20131063. PMLR (2012)"},{"issue":"1","key":"51_CR12","doi-asserted-by":"publisher","first-page":"5233","DOI":"10.1038\/s41598-019-41695-z","volume":"9","author":"VA Traag","year":"2019","unstructured":"Traag, V.A., Waltman, L., Van Eck, N.J.: From louvain to leiden: guaranteeing well-connected communities. Sci. Rep. 9(1), 5233 (2019)","journal-title":"Sci. Rep."},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Shi, Y., Willson, J., Du, D.Z., Tong, G.: Viral marketing with positive influence. In: IEEE INFOCOM 2017-IEEE Conference on Computer Communications, pp. 1\u20138. IEEE (2017)","DOI":"10.1109\/INFOCOM.2017.8057070"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46661-8_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:09:04Z","timestamp":1699103344000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46661-8_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031466601","9783031466618"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46661-8_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"5 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2023.uqcloud.net\/","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":"Yes. 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":"503","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":"216","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":"43% - 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.97","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":"3.77","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)"}}]}}