{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:15:27Z","timestamp":1742948127312,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819772377"},{"type":"electronic","value":"9789819772384"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-7238-4_25","type":"book-chapter","created":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T16:02:47Z","timestamp":1724774567000},"page":"391-407","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Unbiasedly Estimate Temporal Katz Centrality and\u00a0Identify Top-K Vertices in\u00a0Streaming Graph"],"prefix":"10.1007","author":[{"given":"Qifan","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Liang","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Jiaming","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Liukun","family":"He","sequence":"additional","affiliation":[]},{"given":"Qingjun","family":"Xiao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,28]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ins.2022.10.070","volume":"618","author":"Q Zhang","year":"2022","unstructured":"Zhang, Q., Shuai, B., L\u00fc, M.: A novel method to identify influential nodes in complex networks based on gravity centrality. Inf. Sci. 618, 98\u2013117 (2022). https:\/\/doi.org\/10.1016\/j.ins.2022.10.070","journal-title":"Inf. Sci."},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/978-3-319-46227-1_42","volume-title":"Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2016, Riva del Garda, Italy, September 19-23, 2016, Proceedings, Part II","author":"P Rozenshtein","year":"2016","unstructured":"Rozenshtein, P., Gionis, A.: Temporal PageRank. In: Frasconi, P., Landwehr, N., Manco, G., Vreeken, J. (eds.) Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2016, Riva del Garda, Italy, September 19-23, 2016, Proceedings, Part II, pp. 674\u2013689. Springer International Publishing, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46227-1_42"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s41060-019-00189-x","volume":"9","author":"I Tsalouchidou","year":"2020","unstructured":"Tsalouchidou, I., Baeza-Yates, R., Bonchi, F., Liao, K., Sellis, T.: Temporal betweenness centrality in dynamic graphs. Int. J. Data Sci. Anal. 9, 257\u2013272 (2020)","journal-title":"Int. J. Data Sci. Anal."},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39\u201343 (1953)","journal-title":"Psychometrika"},{"issue":"3","key":"25_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s10791-018-9345-y","volume":"22","author":"G Nayak","year":"2019","unstructured":"Nayak, G., Dutta, S., Ajwani, D., Nicholson, P., Sala, A.: Automated assessment of knowledge hierarchy evolution: comparing directed acyclic graphs. Inf. Retrieval J. 22(3), 256\u2013284 (2019)","journal-title":"Inf. Retrieval J."},{"key":"25_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119875","volume":"655","author":"G G\u00f6kt\u00fcrk","year":"2024","unstructured":"G\u00f6kt\u00fcrk, G., Kaya, K.: Fast and error-adaptive influence maximization based on count-distinct sketches. Inf. Sci. 655, 119875 (2024)","journal-title":"Inf. Sci."},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Automata, Languages and Programming","author":"M Charikar","year":"2002","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) Automata, Languages and Programming, pp. 693\u2013703. Springer, Berlin, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_59"},{"key":"25_CR8","unstructured":"The CAIDA traces. https:\/\/www.caida.org\/data\/overview\/"},{"key":"25_CR9","unstructured":"The UO-17 dataset. https:\/\/dms.sztaki.hu\/~fberes\/tennis\/uo17.zip"},{"key":"25_CR10","unstructured":"The RG-17 dataset. https:\/\/dms.sztaki.hu\/~fberes\/tennis\/rg17.zip"},{"key":"25_CR11","unstructured":"The CTU-13 dataset. https:\/\/www.stratosphereips.org\/datasets-ctu13\/"},{"issue":"1","key":"25_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0169-5","volume":"4","author":"F B\u00e9res","year":"2019","unstructured":"B\u00e9res, F., Kelen, D.M., P\u00e1lovics, R., Bencz\u00far, A.A.: Node embeddings in dynamic graphs. Appl. Network Sci. 4(1), 1\u201325 (2019)","journal-title":"Appl. Network Sci."},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-018-0080-5","volume":"3","author":"F B\u00e9res","year":"2018","unstructured":"B\u00e9res, F., P\u00e1lovics, R.: Temporal walk based centrality metric for graph streams. Appl. Network Sci. 3(1), 1\u201326 (2018)","journal-title":"Appl. Network Sci."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithms\u00a055(1) (2005)","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Roy, P., Khan, A., Alonso, G.: Augmented sketch: Faster and more accurate stream processing. In: Proceedings of SIGMOD, pp. 1449\u20131463 (2016)","DOI":"10.1145\/2882903.2882948"},{"key":"25_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2022.109315","volume":"217","author":"YB Mazziane","year":"2022","unstructured":"Mazziane, Y.B., Alouf, S., Neglia, G.: Analyzing count min sketch with conservative updates. Comput. Netw. 217, 109315 (2022)","journal-title":"Comput. Netw."},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-30570-5_27","volume-title":"Database Theory - ICDT 2005","author":"A Metwally","year":"2005","unstructured":"Metwally, A., Agrawal, D., El Abbadi, A.: Efficient computation of frequent and top-k elements in data streams. In: Eiter, T., Libkin, L. (eds.) Database Theory - ICDT 2005, pp. 398\u2013412. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30570-5_27"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Cormode, G., Yi, K.: Small Summaries for Big Data. Cambridge University Press (2020)","DOI":"10.1017\/9781108769938"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7238-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T16:16:15Z","timestamp":1724775375000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7238-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819772377","9789819772384"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7238-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinhua","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb2024.zjnu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}