{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:41:33Z","timestamp":1725892893647},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212857"},{"type":"electronic","value":"9783642212864"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21286-4_9","type":"book-chapter","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T21:39:29Z","timestamp":1307396369000},"page":"103-114","source":"Crossref","is-referenced-by-count":5,"title":["Dirichlet PageRank and Trust-Based Ranking Algorithms"],"prefix":"10.1007","author":[{"given":"Fan","family":"Chung","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Tsiatas","sequence":"additional","affiliation":[]},{"given":"Wensong","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, R., Borgs, C., Chayes, J., Feige, U., Flaxman, A., Kalai, A., Mirrokni, V., Tennenholtz, M.: Trust-based recommendation systems: an axiomatic approach. In: WWW 2008 (2008)","DOI":"10.1145\/1367497.1367525"},{"key":"9_CR2","unstructured":"Baeza-Yates, R., Castillo, C., L\u00f3pez, V.: PageRank increase under different collusion topologies. In: Proceedings of the 1st International Workshop on Adversarial Information Retrieval on the Web (2005)"},{"key":"9_CR3","unstructured":"Benczur, A., Csalogany, K., Sarlos, T., Uher, M.: SpamRank \u2014 fully automatic link spam detection. In: Proceedings of the 1st International Workshop on Adversarial Information Retrieval on the Web (2005)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-17572-5_8","volume-title":"Internet and Network Economics","author":"C. Borgs","year":"2010","unstructured":"Borgs, C., Chayes, J., Kalai, A.T., Malekian, A., Tennenholtz, M.: A novel approach to propagating distrust. In: Saberi, A. (ed.) WINE 2010. LNCS, vol.\u00a06484, pp. 87\u2013105. Springer, Heidelberg (2010)"},{"issue":"1-7","key":"9_CR5","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. Computer Networks and ISDN Systems\u00a030(1-7), 107\u2013117 (1998)","journal-title":"Computer Networks and ISDN Systems"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, A., Friedman, E.: Sybilproof reputation mechanisms. In: Proceedings of Third Workshop on Economics of Peer-to-Peer Systems (2005)","DOI":"10.1145\/1080192.1080202"},{"key":"9_CR7","first-page":"285","volume":"ALM 17","author":"F. Chung","year":"2010","unstructured":"Chung, F.: PageRank as a discrete Green\u2019s function. Geometry and Analysis I\u00a0ALM 17, 285\u2013302 (2010)","journal-title":"Geometry and Analysis I"},{"key":"9_CR8","volume-title":"Spectral Graph Theory","author":"F. Chung","year":"1997","unstructured":"Chung, F.: Spectral Graph Theory. AMS Publications, Providence (1997)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1006\/jcta.2000.3094","volume":"91","author":"F. Chung","year":"2000","unstructured":"Chung, F., Yau, S.-T.: Discrete Green\u2019s functions. J. Combinatorial Theory (A)\u00a091, 191\u2013214 (2000)","journal-title":"J. Combinatorial Theory (A)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-18009-5_2","volume-title":"Algorithms and Models for the Web-Graph","author":"F. Chung","year":"2010","unstructured":"Chung, F., Zhao, W.: A sharp PageRank algorithm with applications to edge ranking and graph sparsification. In: Kumar, R., Sivakumar, D. (eds.) WAW 2010. LNCS, vol.\u00a06516, pp. 2\u201314. Springer, Heidelberg (2010)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Guha, R., Kumar, R., Raghavan, P., Tomkins, A.: Propagation of trust and distrust. In: WWW 2004 (2004)","DOI":"10.1145\/988672.988727"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Gy\u00f6ngyi, Z., Garcia-Molina, H., Pedersen, J.: Combating Web spam with TrustRank. In: VLDB 2004 (2004)","DOI":"10.1016\/B978-012088469-8.50052-8"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TKDE.2003.1208999","volume":"15","author":"T. Haveliwala","year":"2004","unstructured":"Haveliwala, T.: Topic-sensitive PageRank: A context-sensitive ranking algorithm for Web search. IEEE Transactions on Knowledge and Data Engineering\u00a015, 784\u2013796 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized Web search. In: WWW 2003 (2003)","DOI":"10.1145\/775152.775191"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Kamvar, S., Schlosser, M., Garcia-Molina, H.: The EigenTrust algorithm for reputation management in P2P networks. In: WWW 2003 (2003)","DOI":"10.1145\/775152.775242"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"de Kerchove, C., Dooren, P.: The PageTrust algorithm: how to rank Web pages when negative links are allowed? In: Proceedings of the SIAM International Conference on Data Mining (2008)","DOI":"10.1137\/1.9781611972788.31"},{"key":"9_CR17","unstructured":"Spielman, D.A., Teng, S.-H.: Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems (2008), http:\/\/arxiv.org\/abs\/cs.NA\/0607105"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21286-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T09:05:15Z","timestamp":1560243915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21286-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212857","9783642212864"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21286-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}