{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T18:50:30Z","timestamp":1709664630514},"reference-count":20,"publisher":"Informa UK Limited","issue":"5","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Cybernetics and Systems"],"published-print":{"date-parts":[[2016,7,3]]},"DOI":"10.1080\/01969722.2016.1187030","type":"journal-article","created":{"date-parts":[[2016,6,15]],"date-time":"2016-06-15T19:37:35Z","timestamp":1466019455000},"page":"376-391","update-policy":"http:\/\/dx.doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Methodologies to Determine the Relevancy of Hanging Pages Using Stability Analysis"],"prefix":"10.1080","volume":"47","author":[{"given":"P. Ravi","family":"Kumar","sequence":"first","affiliation":[]},{"given":"Alex Goh Kwang","family":"Leng","sequence":"additional","affiliation":[]},{"given":"Ashutosh Kumar","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Anand","family":"Mohan","sequence":"additional","affiliation":[]}],"member":"301","published-online":{"date-parts":[[2016,6,15]]},"reference":[{"key":"CIT0001","volume-title":"ECML\/PKDD 2010 discovery challenge data set","author":"Bencz\u00far A. A.","year":"2010"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1145\/1052934.1052938"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1145\/1189702.1189703"},{"key":"CIT0007","volume-title":"Efficient computation of PageRank","author":"Haveliwala T.","year":"1999"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1137\/060664331"},{"key":"CIT0009","unstructured":"Kamvar, S. D., T. H. Haveliwala, C. D. Manning, and G. H. Golub. 2003. Exploiting the block structure of the web for computing PageRank. Technical Report 2003\u201317. Stanford, CA: Stanford University. http:\/\/dbpubs.stanford.edu:8090\/pub\/2003-17"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1145\/345966.345982"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335170"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129091"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1137\/s0036144503424786"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00034-7"},{"key":"CIT0015","first-page":"903","volume-title":"Proceedings of 17th International Joint Conference on Artificial Intelligence","author":"Ng A. Y.","year":"2001"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1145\/383952.384003"},{"key":"CIT0017","unstructured":"Page, L., S. Brin, R. Motwani, and T. Winograd. 1999. The PageRank citation ranking: Bringing order to the web. Technical Report No. SIDL-WP-1999\u20130120. Stanford, CA: Stanford Digital Libraries."},{"key":"CIT0018","unstructured":"Pan-Chi Lee, C., G. H. Golub, and S. A. Zenios. 2003. A fast two-stage algorithm for computing PageRank and its extensions. Technical Report SCCM-2003\u201315, Scientific Computation and Computational Mathematics. Stanford, CA: Stanford University."},{"key":"CIT0019","volume-title":"Efficient algorithm for handling dangling pages using hypothetical node","author":"Singh A. K.","year":"2010"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1080\/01969722.2011.634679"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1109\/URKE.2012.6319593"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1145\/1344411.1344416"},{"key":"CIT0024","first-page":"227","volume-title":"Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Zhicheng D.","year":"2009"}],"container-title":["Cybernetics and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/01969722.2016.1187030","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,13]],"date-time":"2016-12-13T09:10:18Z","timestamp":1481620218000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/full\/10.1080\/01969722.2016.1187030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,15]]},"references-count":20,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2016,6,20]]},"published-print":{"date-parts":[[2016,7,3]]}},"alternative-id":["10.1080\/01969722.2016.1187030"],"URL":"https:\/\/doi.org\/10.1080\/01969722.2016.1187030","relation":{},"ISSN":["0196-9722","1087-6553"],"issn-type":[{"value":"0196-9722","type":"print"},{"value":"1087-6553","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,15]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ucbs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ucbs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"}]}}