{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:59:58Z","timestamp":1740099598252,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030352301"},{"type":"electronic","value":"9783030352318"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35231-8_17","type":"book-chapter","created":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T19:30:38Z","timestamp":1573846238000},"page":"236-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Traditional PageRank Versus Network Capacity Bound"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9783-4914","authenticated-orcid":false,"given":"Robert A.","family":"K\u0142opotek","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4685-7045","authenticated-orcid":false,"given":"Mieczys\u0142aw A.","family":"K\u0142opotek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,15]]},"reference":[{"issue":"9","key":"17_CR1","doi-asserted-by":"publisher","first-page":"e1000494","DOI":"10.1371\/journal.pcbi.1000494","volume":"5","author":"Stefano Allesina","year":"2009","unstructured":"Allesina, S., Pascual, M.: Googling food webs: can an eigenvector measure species\u2019 importance for coextinctions? PLoS Comput. Biol. 5, e1000494 (2009)","journal-title":"PLoS Computational Biology"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-69321-5_43","volume-title":"Pattern Recognition","author":"C Bauckhage","year":"2008","unstructured":"Bauckhage, C.: Image tagging using PageRank over bipartite graphs. In: Rigoll, G. (ed.) DAGM 2008. LNCS, vol. 5096, pp. 426\u2013435. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-69321-5_43"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1080\/15427951.2005.10129098","volume":"2","author":"P Berkhin","year":"2005","unstructured":"Berkhin, P.: A survey on PageRank computing. Internet Math. 2, 73\u2013120 (2005)","journal-title":"Internet Math."},{"key":"17_CR4","unstructured":"Chung, F.: PageRank as a discrete green\u2019s function. In: Ji, L. (ed.) Geometry and Analysis, I, Advanced Lectures in Mathematics (ALM), vol. 17, pp. 285\u2013302. International Press of Boston, 15 July 2011"},{"key":"17_CR5","unstructured":"Chung, F., Zhao, W.: PageRank and random walks on graphs (2008). \nhttp:\/\/www.math.ucsd.edu\/~fan\/wp\/lov.pdf"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"6868","DOI":"10.1038\/ncomms7868","volume":"6","author":"M Domenico De","year":"2015","unstructured":"De Domenico, M., Sole-Ribalta, A., Omodei, E., Gomez, S., Arenas, A.: Ranking in interconnected multilayer networks reveals versatile nodes. Nat. Commun. 6, 6868 (2015)","journal-title":"Nat. Commun."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Deng, H., Lyu, M.R., King, I.: A generalized co-hits algorithm and its application to bipartite graphs. In: Proceedings of the 15th ACM SIGKDD, pp. 239\u2013248, Paris (2009)","DOI":"10.1145\/1557019.1557051"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Dominguez-Garcia, V., Munoz, M.A.: Ranking species in mutualistic networks. Sci. Rep. 5, 8182 (2015)","DOI":"10.1038\/srep08182"},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TKDE.2016.2611584","volume":"29","author":"Xiangnan He","year":"2017","unstructured":"He, X., Gao, M., Kan, M.Y., Wang, D.: Birank: towards ranking on bipartite graphs. IEEE Trans. Knowl. Data Eng. 29(1), 57\u201371 (2017). \nhttps:\/\/doi.org\/10.1109\/TKDE.2016.2611584","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"17_CR10","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-18781-5_11","volume-title":"Challenges in Computational Statistics and Data Mining","author":"MA K\u0142opotek","year":"2016","unstructured":"K\u0142opotek, M.A., Wierzcho\u0144, S.T., K\u0142opotek, R.A., K\u0142opotek, E.A.: Network capacity bound for personalized bipartite PageRank. In: Matwin, S., Mielniczuk, J. (eds.) Challenges in Computational Statistics and Data Mining. SCI, vol. 605, pp. 189\u2013204. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-18781-5_11"},{"key":"17_CR11","unstructured":"Langville, A.N.: An annotated bibliography of papers about Markov chains and information retrieval (2005). \nhttp:\/\/www.cofc.edu\/~langvillea\/bibtexpractice.pdf"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Langville, A.N., Meyer, C.D.: Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton (2006)","DOI":"10.1515\/9781400830329"},{"key":"17_CR13","unstructured":"Link, S.: Eigenvalue-based bipartite ranking. Bachelorarbeit\/bachelor thesis (2011)"},{"issue":"10","key":"17_CR14","first-page":"1","volume":"5","author":"C Liu","year":"2018","unstructured":"Liu, C., Tang, L., Shan, W.: An extended hits algorithm on bipartite network for features extraction of online customer reviews. Sustain. MDPI Open Access J. 5(10), 1\u201315 (2018)","journal-title":"Sustain. MDPI Open Access J."},{"key":"17_CR15","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. Technical Report 1999\u201366, Stanford InfoLab, November 1999. \nhttp:\/\/ilpubs.stanford.edu:8090\/422\/"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1038\/srep00723","volume":"2","author":"A Tacchella","year":"2012","unstructured":"Tacchella, A., Cristelli, M., Caldarelli, G., Gabrielli, A., Pietronero, L.: A new metrics for countries\u2019 fitness and products\u2019 complexity. Sci. Rep. 2, 723 (2012)","journal-title":"Sci. Rep."}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35231-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T19:37:54Z","timestamp":1573846674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35231-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030352301","9783030352318"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35231-8_17","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":"15 November 2019","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":"Dalian","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/adma2019.neusoft.edu.cn\/","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":"170","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":"39","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":"26","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":"23% - 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":"7","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)"}}]}}