{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T16:09:56Z","timestamp":1774195796587,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,6,19]],"date-time":"2009-06-19T00:00:00Z","timestamp":1245369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,6,19]],"date-time":"2009-06-19T00:00:00Z","timestamp":1245369600000},"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":["Inf Retrieval"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s10791-009-9098-8","type":"journal-article","created":{"date-parts":[[2009,6,18]],"date-time":"2009-06-18T20:44:49Z","timestamp":1245357889000},"page":"22-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["A framework to compute page importance based on user behaviors"],"prefix":"10.1007","volume":"13","author":[{"given":"Yuting","family":"Liu","sequence":"first","affiliation":[]},{"given":"Tie-Yan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Zhiming","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Hang","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,6,19]]},"reference":[{"key":"9098_CR1","doi-asserted-by":"crossref","unstructured":"Amento, B., Terveen, L., & Hill, W. (2000). Does \u201cauthority\u201d mean quality? Predicting expert quality ratings of web documents. In SIGIR \u201900: Proceedings of the 23rd annual international ACM SIGIR conference on research and development in information retrieval (pp. 296\u2013303). New York, NY: ACM.","DOI":"10.1145\/345508.345603"},{"key":"9098_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-3038-0","volume-title":"Continuous-time Markov chains: An applications-oriented approach","author":"W. J. Anderson","year":"1991","unstructured":"Anderson, W. J. (1991). Continuous-time Markov chains: An applications-oriented approach. New York: Springer-Verlag."},{"key":"9098_CR3","unstructured":"Baeza-Yates, R., & Ribeiro-Neto, B. (1999). Modern information retrieval. USA: Addison Wesley."},{"key":"9098_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-2726-7","volume-title":"An Introduction to Probability and Stochastic Processes","author":"M. A. Berger","year":"1993","unstructured":"Berger, M. A. (1993). An introduction to probability and stochastic processes. New York: Springer-Verlag."},{"issue":"1","key":"9098_CR5","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. (2005). Inside PageRank. ACM Transactions on Internet Technology, 5(1), 92\u2013128.","journal-title":"ACM Trans. Interet Technol"},{"key":"9098_CR6","doi-asserted-by":"crossref","unstructured":"Boldi, P., Santini, M., & Vigna, S. (2005). PageRank as a function of the damping factor. In WWW\u201905: Proceedings of the 14th international conference on world wide web (pp. 557\u2013566). New York, NY: ACM.","DOI":"10.1145\/1060745.1060827"},{"key":"9098_CR7","volume-title":"Convex optimization","author":"S. Boyd","year":"2003","unstructured":"Boyd, S., & Vendenberghe, L. (2003). Convex optimization. Cambridge: Cambridge University Press."},{"issue":"1\u20137","key":"9098_CR8","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. (1998). The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems, 30(1\u20137):107\u2013117.","journal-title":"Computer Networks and ISDN Systems"},{"key":"9098_CR9","unstructured":"Eirinaki, M., & Vazirgiannis, M. (2005). Usage-based PageRank for web personalization. In ICDM\u201905: Proceedings of the fifth IEEE international conference on data mining (pp. 130\u2013137). Washington, DC: IEEE Computer Society."},{"key":"9098_CR10","volume-title":"Matrix computations","author":"G. H. Golub","year":"1996","unstructured":"Golub, G. H., & Loan, C. F. V. (1996). Matrix computations, 3rd ed. Baltimore, MD: Johns Hopkins University Press.","edition":"3"},{"key":"9098_CR11","unstructured":"Gyongyi, Z., & Garcia-Molina, H. (2005). Web spam taxonomy. In first international workshop on adversarial information retrieval on the web (AIRWeb)."},{"key":"9098_CR12","doi-asserted-by":"crossref","unstructured":"Gy\u00f6ngyi, Z., Garcia-Molina, H., & Pedersen, J. (2004). Combating web spam with TrustRank. In VLDB\u201904: Proceedings of the thirtieth international conference on very large data bases (pp. 576\u2013587). VLDB Endowment.","DOI":"10.1016\/B978-012088469-8.50052-8"},{"key":"9098_CR13","unstructured":"Haveliwala, T. (1999). Efficient computation of PageRank. Technical report 1999-31, Stanford InfoLab."},{"key":"9098_CR14","unstructured":"Haveliwala, T., & Kamvar, S. (2003). The second eigenvalue of the google matrix. Technical report 2003-20, Stanford InfoLab."},{"key":"9098_CR15","unstructured":"Haveliwala, T., Kamvar, S., & Jeh, G. (2003, June). An analytical comparison of approaches to personalizing PageRank. Technical report 2003-35, Stanford InfoLab."},{"key":"9098_CR16","doi-asserted-by":"crossref","unstructured":"Haveliwala, T. H. (2002). Topic-sensitive PageRank. In WWW\u201902: Proceedings of the 11th international conference on world wide web (pp. 517\u2013526). New York, NY: ACM.","DOI":"10.1145\/511446.511513"},{"key":"9098_CR17","doi-asserted-by":"crossref","unstructured":"J\u00e4rvelin, K., & Kek\u00e4l\u00e4inen, J. (2000). IR evaluation methods for retrieving highly relevant documents. In SIGIR\u201900: Proceedings of the 23rd annual international ACM SIGIR conference on research and development in information retrieval (pp. 41\u201348). New York, NY: ACM.","DOI":"10.1145\/345508.345545"},{"issue":"4","key":"9098_CR18","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K. J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin, K., & Kek\u00e4l\u00e4inen, J. (2002). Cumulated gain-based evaluation of IR techniques. ACM Transcation on Information System 20(4), 422\u2013446.","journal-title":"ACM Trans. Inf. Syst"},{"key":"9098_CR19","unstructured":"Kleinberg, J. M. (1998). Authoritative sources in a hyperlinked environment. In SODA\u201998: Proceedings of the ninth annual ACM-SIAM symposium on discrete algorithms (pp. 668\u2013677). Philadelphia, PA: Society for Industrial and Applied Mathematics."},{"issue":"3","key":"9098_CR20","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"A. N. Langville","year":"2004","unstructured":"Langville, A. N., & Meyer, C. D. (2004). Deeper inside PageRank. Internet Mathematics, 1(3), 335\u2013400.","journal-title":"Internet Mathematics"},{"key":"9098_CR21","doi-asserted-by":"crossref","unstructured":"Liu, Y., Gao, B., Liu, T.-Y., Zhang, Y., Ma, Z., He, S., & Li, H. (2008). BrowseRank: Letting web users vote for page importance. In SIGIR\u201908: Proceedings of the 31st annual international ACM SIGIR conference on research and development in information retrieval (pp. 451\u2013458). New York, NY: ACM.","DOI":"10.1145\/1390334.1390412"},{"key":"9098_CR22","unstructured":"Lowry, R. (2000) Concepts and applications of inferential statistics. Vassar College. http:\/\/faculty.vassar.edu\/lowry\/webtext.htm."},{"key":"9098_CR23","doi-asserted-by":"crossref","unstructured":"McSherry, F. (2005). A uniform approach to accelerated PageRank computation. In WWW\u201905: Proceedings of the 14th international conference on world wide web (pp. 575\u2013582). New York, NY: ACM.","DOI":"10.1145\/1060745.1060829"},{"key":"9098_CR24","unstructured":"Oztekin, B. U., Ertoz, L., Kumar, V., & Srivastava, J. (2003). Usage aware PageRank. Technical report 03-010, University of Minnesota."},{"key":"9098_CR25","unstructured":"Page, L., Brin, S., Motwani, R., & Winograd, T. (1999). The PageRank citation ranking: Bringing order to the web. Technical report 1999-66, Stanford InfoLab. Previous number = SIDL-WP-1999-0120."},{"key":"9098_CR26","unstructured":"Rice, J. A. (1995). Mathematical statistics and data analysis, 2nd ed. USA: Duxbery Press."},{"key":"9098_CR27","unstructured":"Richardson, M., & Domingos, P. (2002). The intelligent surfer: Probabilistic combination of link and content information in PageRank. In advances in neural information processing systems 14 (pp. 1441\u20131448). Cambridge, MA: MIT Press."},{"issue":"1","key":"9098_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1108\/EUM0000000007186","volume":"53","author":"S. E. Robertson","year":"1997","unstructured":"Robertson, S. E. (1997). Overview of the Okapi projects. Journal of Documentatioin, 53(1), 3\u20137.","journal-title":"Journal of Documentatioin"},{"key":"9098_CR29","unstructured":"Sorenson, H. W. (1980). Parameter estimation: Principles and problems. USA: Marcel Dekker."},{"key":"9098_CR30","volume-title":"Introduction to the numerical solution of Markov chains","author":"W. J. Stewart","year":"1994","unstructured":"Stewart, W. J. (1994). Introduction to the numerical solution of Markov chains. Princeton, NJ: Princeton University Press."},{"key":"9098_CR31","volume-title":"Birth and death processes and Markov chains","author":"Z. K. Wang","year":"1992","unstructured":"Wang, Z. K., & Yang, X. Q. (1992). Birth and death processes and Markov chains. New York: Springer-Verlag."},{"key":"9098_CR32","doi-asserted-by":"crossref","unstructured":"White, R. W., Bilenko, M., & Cucerzan, S. (2007). Studying the use of popular destinations to enhance web search interaction. In SIGIR \u201907: Proceedings of the 30th annual international ACM SIGIR conference on research and development in information retrieval (pp. 159\u2013166). New York, NY: ACM.","DOI":"10.1145\/1277741.1277771"}],"container-title":["Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-009-9098-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-009-9098-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-009-9098-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-009-9098-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T14:47:00Z","timestamp":1704206820000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-009-9098-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,19]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["9098"],"URL":"https:\/\/doi.org\/10.1007\/s10791-009-9098-8","relation":{},"ISSN":["1386-4564","1573-7659"],"issn-type":[{"value":"1386-4564","type":"print"},{"value":"1573-7659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,19]]},"assertion":[{"value":"3 December 2008","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2009","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2009","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}