{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:44:34Z","timestamp":1743115474411,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819612413"},{"type":"electronic","value":"9789819612420"}],"license":[{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-1242-0_16","type":"book-chapter","created":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T08:07:01Z","timestamp":1733990821000},"page":"209-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Keyword-Based Betweenness Centrality Maximization in\u00a0Attributed Graphs"],"prefix":"10.1007","author":[{"given":"Xiao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanping","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengyi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,13]]},"reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1038\/s41598-019-57304-y","volume":"10","author":"I Ahmad","year":"2020","unstructured":"Ahmad, I., Akhtar, M.U., Noor, S., Shahnaz, A.: Missing link prediction using common neighbor and centrality based parameterized algorithm. Sci. Rep. 10(1), 364 (2020)","journal-title":"Sci. Rep."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Ali, A., Hulipalled, V.R., Patil, S.: Centrality measure analysis on protein interaction networks. In: 2020 IEEE International Conference on Technology, Engineering, Management for Societal Impact Using Marketing, Entrepreneurship and Talent (TEMSMET), pp.\u00a01\u20135. IEEE (2020)","DOI":"10.1109\/TEMSMET51618.2020.9557447"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-77004-6_10","volume-title":"Algorithms and Models for the Web-Graph","author":"DA Bader","year":"2007","unstructured":"Bader, D.A., Kintali, S., Madduri, K., Mihail, M.: Approximating betweenness centrality. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 124\u2013137. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77004-6_10"},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1140\/epjb\/e2004-00111-4","volume":"38","author":"M Barth\u00e9lemy","year":"2004","unstructured":"Barth\u00e9lemy, M.: Betweenness centrality in large complex networks. Eur. Phys. J. B 38(2), 163\u2013168 (2004). https:\/\/doi.org\/10.1140\/epjb\/e2004-00111-4","journal-title":"Eur. Phys. J. B"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"issue":"07","key":"16_CR6","doi-asserted-by":"publisher","first-page":"2303","DOI":"10.1142\/S0218127407018403","volume":"17","author":"U Brandes","year":"2007","unstructured":"Brandes, U., Pich, C.: Centrality estimation in large networks. Int. J. Bifurcation Chaos 17(07), 2303\u20132318 (2007)","journal-title":"Int. J. Bifurcation Chaos"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Chen, C., Wang, W., Wang, X.: Efficient maximum closeness centrality group identification. In: Australasian Database Conference, pp. 43\u201355. Springer (2016)","DOI":"10.1007\/978-3-319-46922-5_4"},{"issue":"6","key":"16_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3577021","volume":"17","author":"C Cousins","year":"2023","unstructured":"Cousins, C., Wohlgemuth, C., Riondato, M.: Bavarian: betweenness centrality approximation with variance-aware rademacher averages. ACM Trans. Knowl. Discov. Data 17(6), 1\u201347 (2023)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"20","key":"16_CR9","doi-asserted-by":"publisher","first-page":"1172","DOI":"10.1016\/j.ipl.2009.07.019","volume":"109","author":"S Dolev","year":"2009","unstructured":"Dolev, S., Elovici, Y., Puzis, R., Zilberman, P.: Incremental deployment of network monitors based on group betweenness centrality. Inf. Process. Lett. 109(20), 1172\u20131176 (2009)","journal-title":"Inf. Process. Lett."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo, G., Olsen, M., Severini, L.: Coverage centrality maximization in undirected networks. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a033, pp. 501\u2013508 (2019)","DOI":"10.1609\/aaai.v33i01.3301501"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D.: Better approximation of betweenness centrality. In: 2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 90\u2013100. SIAM (2008)","DOI":"10.1137\/1.9781611972887.9"},{"issue":"10","key":"16_CR12","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.14778\/2794367.2794376","volume":"8","author":"Y Li","year":"2015","unstructured":"Li, Y., Zhang, D., Tan, K.: Real-time targeted influence maximization for online advertisements. Proc. VLDB Endow. 8(10), 1070\u20131081 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Mahmoody, A., Tsourakakis, C.E., Upfal, E.: Scalable betweenness centrality maximization via sampling. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1765\u20131773 (2016)","DOI":"10.1145\/2939672.2939869"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Pfeffer, J., Carley, K.M.: k-centralities: local approximations of global measures based on shortest paths. In: Proceedings of the 21st International Conference on World Wide Web, pp. 1043\u20131050 (2012)","DOI":"10.1145\/2187980.2188239"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Riondato, M., Kornaropoulos, E.M.: Fast approximation of betweenness centrality through sampling. In: Proceedings of the 7th ACM International Conference on Web Search and Data Mining, pp. 413\u2013422 (2014)","DOI":"10.1145\/2556195.2556224"},{"issue":"5","key":"16_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3208351","volume":"12","author":"M Riondato","year":"2018","unstructured":"Riondato, M., Upfal, E.: ABRA: approximating betweenness centrality in static and dynamic graphs with rademacher averages. ACM Trans. Knowl. Discov. Data (TKDD) 12(5), 1\u201338 (2018)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"issue":"7","key":"16_CR17","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.14778\/3450980.3450988","volume":"14","author":"A Saha","year":"2021","unstructured":"Saha, A., Brokkelkamp, R., Velaj, Y., Khan, A., Bonchi, F.: Shortest paths and centrality in uncertain networks. Proc. VLDB Endow. 14(7), 1188\u20131201 (2021)","journal-title":"Proc. VLDB Endow."},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Santoro, D., Sarpe, I.: Onbra: rigorous estimation of the temporal betweenness centrality in temporal networks. In: Proceedings of the ACM Web Conference 2022, pp. 1579\u20131588 (2022)","DOI":"10.1145\/3485447.3512204"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Tang, J., Tang, X., Xiao, X., Yuan, J.: Online processing algorithms for influence maximization. In: Proceedings of the 2018 International Conference on Management of Data, SIGMOD Conference 2018, Houston, TX, USA, 10\u201315 June 2018, pp. 991\u20131005. ACM (2018)","DOI":"10.1145\/3183713.3183749"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, 31 May\u20134 June 2015, pp. 1539\u20131554. ACM (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"61259","DOI":"10.1109\/ACCESS.2019.2915974","volume":"7","author":"C Wang","year":"2019","unstructured":"Wang, C., Lin, Z.: An efficient approximation of betweenness centrality for uncertain graphs. IEEE Access 7, 61259\u201361272 (2019)","journal-title":"IEEE Access"},{"issue":"10","key":"16_CR22","doi-asserted-by":"publisher","first-page":"2501","DOI":"10.14778\/3675034.3675042","volume":"17","author":"J Wang","year":"2024","unstructured":"Wang, J., et al.: Efficient influence minimization via node blocking. Proc. VLDB Endow. 17(10), 2501\u20132513 (2024)","journal-title":"Proc. VLDB Endow."},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Wang, X., Zhang, Y., Zhang, W., Lin, X.: Distance-aware influence maximization in geo-social network. In: 32nd IEEE International Conference on Data Engineering, ICDE 2016, Helsinki, Finland, 16\u201320 May 2016, pp. 1\u201312. IEEE Computer Society (2016)","DOI":"10.1109\/ICDE.2016.7498224"},{"issue":"3","key":"16_CR24","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TKDE.2016.2633472","volume":"29","author":"X Wang","year":"2016","unstructured":"Wang, X., Zhang, Y., Zhang, W., Lin, X.: Efficient distance-aware influence maximization in geo-social networks. IEEE Trans. Knowl. Data Eng. 29(3), 599\u2013612 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"16_CR25","doi-asserted-by":"publisher","first-page":"3243","DOI":"10.14778\/3681954.3681997","volume":"17","author":"Y Wu","year":"2024","unstructured":"Wu, Y., et al.: Efficient maximal frequent group enumeration in temporal bipartite graphs. Proc. VLDB Endow. 17(11), 3243\u20133255 (2024)","journal-title":"Proc. VLDB Endow."},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Wu, Y., et al.: Efficient maximal temporal plex enumeration. In: ICDE, pp. 3098\u20133110. IEEE (2024)","DOI":"10.1109\/ICDE60146.2024.00240"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Wu, Y., Wang, J., Sun, R., Chen, C., Wang, X., Zhang, Y.: Targeted filter bubbles mitigating via edges insertion. In: WWW (Companion Volume), pp. 734\u2013737. ACM (2024)","DOI":"10.1145\/3589335.3651566"},{"issue":"1","key":"16_CR28","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/s11280-024-01235-w","volume":"27","author":"F Xiang","year":"2024","unstructured":"Xiang, F., Wang, J., Wu, Y., Wang, X., Chen, C., Zhang, Y.: Rumor blocking with pertinence set in large graphs. World Wide Web (WWW) 27(1), 6 (2024)","journal-title":"World Wide Web (WWW)"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Yoshida, Y.: Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1416\u20131425 (2014)","DOI":"10.1145\/2623330.2623626"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, L., Wu, Y., Wang, J., Liu, S., Chen, C., Wang, X.: Efficient algorithm for maximizing betweenness centrality in large networks. In: HPCC, pp. 647\u2013654. IEEE (2023)","DOI":"10.1109\/HPCC-DSS-SmartCity-DependSys60770.2023.00093"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1242-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T20:04:30Z","timestamp":1736193870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1242-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,13]]},"ISBN":["9789819612413","9789819612420"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1242-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,13]]},"assertion":[{"value":"13 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc-conference.github.io\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}