{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:55:36Z","timestamp":1743065736090,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319942889"},{"type":"electronic","value":"9783319942896"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-94289-6_19","type":"book-chapter","created":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T11:30:15Z","timestamp":1529321415000},"page":"295-307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Classifying Quality Centrality for Source Localization in Social Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9887-4301","authenticated-orcid":false,"given":"Yao","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xi","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengping","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shutao","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,19]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.jtbi.2005.01.011","volume":"235","author":"M Barth\u00e9lemy","year":"2005","unstructured":"Barth\u00e9lemy, M., Barrat, A., Pastor-Satorras, R., Vespignani, A.: Dynamical patterns of epidemic outbreaks in complex heterogeneous networks. J. Theor. Biol. 235(2), 275\u2013288 (2005)","journal-title":"J. Theor. Biol."},{"issue":"6 Pt 2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"066117","DOI":"10.1103\/PhysRevE.63.066117","volume":"63","author":"R Pastor-Satorras","year":"2001","unstructured":"Pastor-Satorras, R., Vespignani, A.: Epidemic dynamics and endemic states in complex networks. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 63(6 Pt 2), 066117 (2001)","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys."},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1145\/2318857.2254782","volume":"40","author":"D Shah","year":"2012","unstructured":"Shah, D., Zaman, T.: Rumor centrality: a universal source detector. ACM Sigmetrics Perform. Eval. Rev. 40(1), 199\u2013210 (2012)","journal-title":"ACM Sigmetrics Perform. Eval. Rev."},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-13672-6_40","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"L Akoglu","year":"2010","unstructured":"Akoglu, L., McGlohon, M., Faloutsos, C.: oddvall: spotting anomalies in weighted graphs. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010. LNCS (LNAI), vol. 6119, pp. 410\u2013421. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13672-6_40"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-69311-6_21","volume-title":"Frontiers in Algorithmics","author":"K Okamoto","year":"2008","unstructured":"Okamoto, K., Chen, W., Li, X.-Y.: Ranking of closeness centrality for large-scale social networks. In: Preparata, F.P., Wu, X., Yin, J. (eds.) FAW 2008. LNCS, vol. 5059, pp. 186\u2013195. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69311-6_21"},{"issue":"2","key":"19_CR6","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)","journal-title":"Eur. Phys. J. B"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Luo, W., Tay, W.P., Leng, M., Guevara, M.K.: On the universality of the Jordan center for estimating the rumor source in a social network. In: IEEE International Conference on Digital Signal Processing, pp. 760\u2013764 (2015)","DOI":"10.1109\/ICDSP.2015.7251978"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"012801","DOI":"10.1103\/PhysRevE.90.012801","volume":"90","author":"AY Lokhov","year":"2014","unstructured":"Lokhov, A.Y., M\u00e9zard, M., Ohta, H., Zdeborov\u00e1, L.: Inferring the origin of an epidemic with dynamic message-passing algorithm. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 90(1), 012801 (2014)","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Dong, W., Zhang, W., Tan, C.W.: Rooting Out the Rumor Culprit from Suspects, pp. 2671\u20132675 (2013)","DOI":"10.1109\/ISIT.2013.6620711"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Zheng, L., Tan, C.W.: A probabilistic characterization of the rumor graph boundary in rumor source detection. In: IEEE International Conference on Digital Signal Processing, pp. 765\u2013769 (2015)","DOI":"10.1109\/ICDSP.2015.7251979"},{"key":"19_CR11","series-title":"Information Science and Statistics","volume-title":"Pattern Recognition and Machine Learning","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning. Information Science and Statistics. Springer, New York (2006)"},{"issue":"6164","key":"19_CR12","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1126\/science.1245200","volume":"342","author":"D Brockmann","year":"2013","unstructured":"Brockmann, D., Helbing, D.: The hidden geometry of complex, network-driven contagion phenomena. Science 342(6164), 1337 (2013)","journal-title":"Science"},{"issue":"3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215\u2013239 (1978)","journal-title":"Soc. Netw."},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Wehmuth, K., Ziviani, A.: Distributed assessment of the closeness centrality ranking in complex networks. In: The Workshop on Simplifying Complex Networks for Practitioners, pp. 43\u201348 (2012)","DOI":"10.1145\/2184356.2184368"},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0378-8733(91)90017-N","volume":"13","author":"LC Freeman","year":"1991","unstructured":"Freeman, L.C., Borgatti, S.P., White, D.R.: Centrality in valued graphs: a measure of betweenness based on network flow. Soc. Netw. 13(2), 141\u2013154 (1991)","journal-title":"Soc. Netw."},{"issue":"4","key":"19_CR16","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1109\/JSTSP.2014.2315533","volume":"8","author":"W Luo","year":"2014","unstructured":"Luo, W., Tay, W.P., Leng, M.: How to identify an infection source with limited observations. IEEE J. Sel. Topics Signal Process. 8(4), 586\u2013597 (2014)","journal-title":"IEEE J. Sel. Topics Signal Process."},{"issue":"99","key":"19_CR17","first-page":"1","volume":"PP","author":"J Jiang","year":"2016","unstructured":"Jiang, J., Wen, S., Yu, S., Xiang, Y., Zhou, W.: Rumor source identification in social networks with time-varying topology. IEEE Trans. Dependable Secure Comput. PP(99), 1 (2016)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Spencer, S., Srikant, R.: Maximum likelihood rumor source detection in a star network. In: IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 2199\u20132203 (2016)","DOI":"10.1109\/ICASSP.2016.7472067"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.jocs.2015.05.002","volume":"10","author":"W Zang","year":"2015","unstructured":"Zang, W., Zhang, P., Zhou, C., Guo, L.: Locating multiple sources in social networks under the SIR model: a divide-and-conquer approach. J. Comput. Sci. 10, 278\u2013287 (2015)","journal-title":"J. Comput. Sci."},{"issue":"8","key":"19_CR20","doi-asserted-by":"publisher","first-page":"5163","DOI":"10.1109\/TIT.2011.2158885","volume":"57","author":"D Shah","year":"2009","unstructured":"Shah, D., Zaman, T.: Rumors in a network: who\u2019s the culprit? IEEE Trans. Inf. Theory 57(8), 5163\u20135181 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"19_CR21","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"8","key":"19_CR22","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.ipl.2010.02.001","volume":"110","author":"S Hougardy","year":"2010","unstructured":"Hougardy, S.: The Floyd-Warshall algorithm on graphs with negative cycles. Inf. Process. Lett. 110(8), 279\u2013281 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"5439","key":"19_CR23","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barabasi","year":"1999","unstructured":"Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"issue":"4","key":"19_CR24","first-page":"290","volume":"6","author":"P Erdos","year":"1959","unstructured":"Erdos, P., Renyi, A.: On random graphs. Publicationes Mathematicae 6(4), 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae"},{"issue":"6684","key":"19_CR25","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440 (1998)","journal-title":"Nature"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Kumar, S., Spezzano, F., Subrahmanian, V.S., Faloutsos, C.: Edge weight prediction in weighted signed networks. In: IEEE International Conference on Data Mining, pp. 221\u2013230 (2017)","DOI":"10.1109\/ICDM.2016.0033"},{"key":"19_CR27","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"}],"container-title":["Lecture Notes in Computer Science","Web Services \u2013 ICWS 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94289-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:35:28Z","timestamp":1710243328000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94289-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319942889","9783319942896"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94289-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"19 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICWS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Services","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seattle, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icws2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/icws.org\/2018\/","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":"www.confhub.com","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"116","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":"31","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":"1","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":"27% - 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","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":"4","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}