{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T01:20:03Z","timestamp":1752283203986,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030192730"},{"type":"electronic","value":"9783030192747"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-19274-7_12","type":"book-chapter","created":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T18:09:50Z","timestamp":1556215790000},"page":"154-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Fast Incremental PageRank on Dynamic Networks"],"prefix":"10.1007","author":[{"given":"Zexing","family":"Zhan","sequence":"first","affiliation":[]},{"given":"Ruimin","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Xiyue","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Nian","family":"Huai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,26]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47\u201397 (2002). https:\/\/doi.org\/10.1103\/RevModPhys.74.47. https:\/\/link.aps.org\/doi\/10.1103\/RevModPhys.74.47","journal-title":"Rev. Mod. Phys."},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/050643799","volume":"45","author":"K Avrachenkov","year":"2007","unstructured":"Avrachenkov, K., Litvak, N., Nemirovsky, D., Osipova, N.: Monte Carlo methods in PageRank computation: when one iteration is sufficient. SIAM J. Numer. Anal. 45(2), 890\u2013904 (2007). https:\/\/doi.org\/10.1137\/050643799","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.14778\/1929861.1929864","volume":"4","author":"B Bahmani","year":"2010","unstructured":"Bahmani, B., Chowdhury, A., Goel, A.: Fast incremental and personalized PageRank. Very Large Data Bases 4(3), 173\u2013184 (2010). https:\/\/doi.org\/10.14778\/1929861.1929864","journal-title":"Very Large Data Bases"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/1052934.1052938","volume":"5","author":"M Bianchini","year":"2005","unstructured":"Bianchini, M., Gori, M., Scarselli, F.: Inside PageRank. ACM Trans. Internet Technol. 5(1), 92\u2013128 (2005). https:\/\/doi.org\/10.1145\/1052934.1052938","journal-title":"ACM Trans. Internet Technol."},{"issue":"5","key":"12_CR5","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1086\/228631","volume":"92","author":"P Bonacich","year":"1987","unstructured":"Bonacich, P.: Power and centrality: a family of measures. Am. J. Sociol. 92(5), 1170\u20131182 (1987). https:\/\/doi.org\/10.1086\/228631","journal-title":"Am. J. Sociol."},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Int. World Wide Web Conf. 30, 107\u2013117 (1998). https:\/\/doi.org\/10.1016\/S0169-7552(98)00110-X","journal-title":"Int. World Wide Web Conf."},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1080\/15427951.2004.10129090","volume":"1","author":"S Chien","year":"2004","unstructured":"Chien, S., Dwork, C., Kumar, R., Simon, D.R., Sivakumar, D.: Link evolution: analysis and algorithms. Internet Math. 1(3), 277\u2013304 (2004). https:\/\/doi.org\/10.1080\/15427951.2004.10129090","journal-title":"Internet Math."},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Desikan, P.K., Pathak, N., Srivastava, J., Kumar, V.: Incremental Page Rank computation on evolving graphs. In: International World Wide Web Conferences, pp. 1094\u20131095 (2005). https:\/\/doi.org\/10.1145\/1062745.1062885","DOI":"10.1145\/1062745.1062885"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.14778\/3151113.3151121","volume":"11","author":"W Guo","year":"2017","unstructured":"Guo, W., Li, Y., Sha, M., Tan, K.L.: Parallel personalized PageRank on dynamic graphs. Proc. VLDB Endow. 11(1), 93\u2013106 (2017). https:\/\/doi.org\/10.14778\/3151113.3151121","journal-title":"Proc. VLDB Endow."},{"key":"12_CR10","unstructured":"Kamvar, S.D., Haveliwala, T.H., Manning, C.D., Golub, G.H.: Exploiting the block structure of the web for computing PageRank. Stanford University Technical Report (2003)"},{"issue":"1","key":"12_CR11","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). https:\/\/doi.org\/10.1007\/BF02289026","journal-title":"Psychometrika"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1073\/pnas.1611275114","volume":"114","author":"IM Kloumann","year":"2017","unstructured":"Kloumann, I.M., Ugander, J., Kleinberg, J.: Block models and personalized PageRank. Proc. Natl. Acad. Sci. U. S. A. 114(1), 33 (2017). https:\/\/doi.org\/10.1073\/pnas.1611275114","journal-title":"Proc. Natl. Acad. Sci. U. S. A."},{"issue":"4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1137\/040619028","volume":"27","author":"AN Langville","year":"2006","unstructured":"Langville, A.N., Meyer, C.D.: Updating markov chains with an eye on google\u2019s PageRank. SIAM J. Matrix Anal. Appl. 27(4), 968\u2013987 (2006). https:\/\/doi.org\/10.1137\/040619028","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-319-57454-7_28","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Q Liao","year":"2017","unstructured":"Liao, Q., Jiang, S.S., Yu, M., Yang, Y., Li, T.: Monte Carlo based incremental PageRank on evolving graphs. In: Kim, J., Shim, K., Cao, L., Lee, J.-G., Lin, X., Moon, Y.-S. (eds.) PAKDD 2017. LNCS (LNAI), vol. 10234, pp. 356\u2013367. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57454-7_28"},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.ipl.2013.11.006","volume":"114","author":"P Lofgren","year":"2014","unstructured":"Lofgren, P.: On the complexity of the Monte Carlo method for incremental PageRank. Inf. Process. Lett. 114(3), 104\u2013106 (2014). https:\/\/doi.org\/10.1016\/j.ipl.2013.11.006","journal-title":"Inf. Process. Lett."},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Ng, A.Y., Zheng, A.X., Jordan, M.I.: Stable algorithms for link analysis. In: International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 258\u2013266 (2001). https:\/\/doi.org\/10.1145\/383952.384003","DOI":"10.1145\/383952.384003"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Ohsaka, N., Maehara, T., Kawarabayashi, K.I.: Efficient PageRank tracking in evolving networks. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 875\u2013884 (2015). https:\/\/doi.org\/10.1145\/2783258.2783297","DOI":"10.1145\/2783258.2783297"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/0-387-32792-4","volume":"37","author":"E Seneta","year":"1981","unstructured":"Seneta, E.: Non-negative matrices and Markov chains. Popul. Stud. J. Demogr. 37(1), 476 (1981). https:\/\/doi.org\/10.1007\/0-387-32792-4","journal-title":"Popul. Stud. J. Demogr."},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Tong, H., Papadimitriou, S., Yu, P.S., Faloutsos, C.: Proximity tracking on time-evolving bipartite graphs. In: SIAM International Conference on Data Mining, SDM 2008, Atlanta, Georgia, USA, 24\u201326 April 2008, pp. 704\u2013715 (2008). https:\/\/doi.org\/10.1137\/1.9781611972788","DOI":"10.1137\/1.9781611972788"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Zhang, H., Lofgren, P., Goel, A.: Approximate personalized PageRank on dynamic graphs. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1315\u20131324 (2016). https:\/\/doi.org\/10.1145\/2939672.2939804","DOI":"10.1145\/2939672.2939804"}],"container-title":["Lecture Notes in Computer Science","Web Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19274-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,25]],"date-time":"2024-04-25T00:03:06Z","timestamp":1714003386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19274-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030192730","9783030192747"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19274-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICWE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Daejeon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icwe2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icwe2019.webengineering.org\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"106","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":"26","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":"9","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":"25% - 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"}]}}