{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T12:25:20Z","timestamp":1763036720538,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,2,4]],"date-time":"2013-02-04T00:00:00Z","timestamp":1359936000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,2,4]]},"DOI":"10.1145\/2433396.2433415","type":"proceedings-article","created":{"date-parts":[[2013,2,5]],"date-time":"2013-02-05T13:19:52Z","timestamp":1360070392000},"page":"143-152","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["NCDawareRank"],"prefix":"10.1145","author":[{"given":"Athanasios N.","family":"Nikolakopoulos","sequence":"first","affiliation":[{"name":"University of Patras & Computer Technology Institute and Press Diophantus, Patra, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John D.","family":"Garofalakis","sequence":"additional","affiliation":[{"name":"University of Patras & Computer Technology Institute and Press Diophantus, Patra, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,2,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777879.1777881"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148225"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.757722"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062745.1062787"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.587"},{"key":"e_1_3_2_1_6_1","volume-title":"Web Information Retrieval and Linear Algebra Algorithms","author":"Boldi P.","year":"2007","unstructured":"P. Boldi , M. Santini , and S. Vigna . A deeper investigation of pagerank as a function of the damping factor . In Web Information Retrieval and Linear Algebra Algorithms , 2007 . P. Boldi, M. Santini, and S. Vigna. A deeper investigation of pagerank as a function of the damping factor. In Web Information Retrieval and Linear Algebra Algorithms, 2007."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629096.1629097"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2010.119"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988676"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129185"},{"key":"e_1_3_2_1_11_1","series-title":"ACM monograph series","volume-title":"Queueing and Computer System Applications","author":"Courtois P.-J.","year":"1977","unstructured":"P.-J. Courtois . Decomposability : Queueing and Computer System Applications . ACM monograph series . Academic Press , 1977 . P.-J. Courtois. Decomposability: Queueing and Computer System Applications. ACM monograph series. Academic Press, 1977."},{"key":"e_1_3_2_1_12_1","volume-title":"In Workshop on Algorithms and Models for the Web Graph","author":"Eiron N.","year":"2003","unstructured":"N. Eiron and K. S. McCurley . Locality, hierarchy, and bidirectionality in the web . In In Workshop on Algorithms and Models for the Web Graph , 2003 . N. Eiron and K. S. McCurley. Locality, hierarchy, and bidirectionality in the web. In In Workshop on Algorithms and Models for the Web Graph, 2003."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988714"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316229"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772730"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1630659.1630937"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479804439808"},{"key":"e_1_3_2_1_20_1","volume-title":"Rank Correlation Methods","author":"Kendall M.","year":"1990","unstructured":"M. Kendall and J. Gibbons . Rank Correlation Methods . Oxford University Press , USA , 1990 . M. Kendall and J. Gibbons. Rank Correlation Methods. Oxford University Press, USA, 1990."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1013367.1013491"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1146372"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1031050"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135794"},{"key":"e_1_3_2_1_26_1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Computing and Combinatorics","author":"Pandurangan G.","year":"2002","unstructured":"G. Pandurangan , P. Raghavan , and E. Upfal . Using pagerank to characterize web structure . In O. Ibarra and L. Zhang, editors, Computing and Combinatorics , volume 2387 of Lecture Notes in Computer Science , pages 1 -- 4 . Springer Berlin \/ Heidelberg , 2002 . G. Pandurangan, P. Raghavan, and E. Upfal. Using pagerank to characterize web structure. In O. Ibarra and L. Zhang, editors, Computing and Combinatorics, volume 2387 of Lecture Notes in Computer Science, pages 1--4. Springer Berlin \/ Heidelberg, 2002."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2011.07.024"},{"key":"e_1_3_2_1_28_1","volume-title":"Non-negative Matrices and Markov Chains","author":"Seneta E.","year":"2006","unstructured":"E. Seneta . Non-negative Matrices and Markov Chains . Springer Verlag , 2006 . E. Seneta. Non-negative Matrices and Markov Chains. Springer Verlag, 2006."},{"key":"e_1_3_2_1_29_1","first-page":"111","volume-title":"Aggregation of variables in dynamic systems","author":"Simon H.","year":"1961","unstructured":"H. Simon and A. Ando . Aggregation of variables in dynamic systems . Econometrica : Journal of The Econometric Society , pages 111 -- 138 , 1961 . H. Simon and A. Ando. Aggregation of variables in dynamic systems. Econometrica: Journal of The Econometric Society, pages 111--138, 1961."},{"key":"e_1_3_2_1_30_1","volume-title":"The Sciences of the Artificial","author":"Simon H. A.","year":"1996","unstructured":"H. A. Simon . The Sciences of the Artificial ( 3 rd ed.). MIT Press , Cambridge, MA, USA , 1996 . H. A. Simon. The Sciences of the Artificial (3rd ed.). MIT Press, Cambridge, MA, USA, 1996.","edition":"3"},{"key":"e_1_3_2_1_31_1","volume-title":"The Mathematical Basis of Performance Modeling","author":"Stewart W. J.","year":"2009","unstructured":"W. J. Stewart . Probability, Markov Chains, Queues, and Simulation : The Mathematical Basis of Performance Modeling . Princeton University Press , Princeton, NJ, USA , 2009 . W. J. Stewart. Probability, Markov Chains, Queues, and Simulation: The Mathematical Basis of Performance Modeling. Princeton University Press, Princeton, NJ, USA, 2009."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076068"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1099554.1099705"}],"event":{"name":"WSDM 2013: Sixth ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Rome Italy","acronym":"WSDM 2013"},"container-title":["Proceedings of the sixth ACM international conference on Web search and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2433396.2433415","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2433396.2433415","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:11Z","timestamp":1750277651000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2433396.2433415"}},"subtitle":["a novel ranking method that exploits the decomposable structure of the web"],"short-title":[],"issued":{"date-parts":[[2013,2,4]]},"references-count":30,"alternative-id":["10.1145\/2433396.2433415","10.1145\/2433396"],"URL":"https:\/\/doi.org\/10.1145\/2433396.2433415","relation":{},"subject":[],"published":{"date-parts":[[2013,2,4]]},"assertion":[{"value":"2013-02-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}