{"id":"https://openalex.org/W2048538996","doi":"https://doi.org/10.1145/1571941.1572120","title":"Score and rank convergence of HITS","display_name":"Score and rank convergence of HITS","publication_year":2009,"publication_date":"2009-07-19","ids":{"openalex":"https://openalex.org/W2048538996","doi":"https://doi.org/10.1145/1571941.1572120","mag":"2048538996"},"language":"en","primary_location":{"id":"doi:10.1145/1571941.1572120","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1571941.1572120","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023594436","display_name":"Enoch Peserico","orcid":null},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Enoch Peserico","raw_affiliation_strings":["Universit\u00e0 di Padova, Padova, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Padova, Padova, Italy","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083698891","display_name":"Luca Pretto","orcid":null},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luca Pretto","raw_affiliation_strings":["Universit\u00e0 di Padova, Padova, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Padova, Padova, Italy","institution_ids":["https://openalex.org/I138689650"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4165,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.69191211,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"770","last_page":"771"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.7382559776306152},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.622161865234375},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6030363440513611},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5675724148750305},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5422594547271729},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.476777583360672},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46665167808532715},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45682600140571594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4495953619480133},{"id":"https://openalex.org/keywords/acceleration","display_name":"Acceleration","score":0.42872315645217896},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3500131666660309},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3283436894416809},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19831028580665588},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10594698786735535}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7382559776306152},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.622161865234375},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6030363440513611},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5675724148750305},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5422594547271729},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.476777583360672},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46665167808532715},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45682600140571594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4495953619480133},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.42872315645217896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3500131666660309},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3283436894416809},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19831028580665588},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10594698786735535},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1571941.1572120","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1571941.1572120","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.415.843","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.415.843","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://aeolus.ceid.upatras.gr/scientific-reports/4th-year-reports/WP1.2_UNIPD_PP09b.pdf","raw_type":"text"},{"id":"pmh:oai:www.research.unipd.it:11577/2373717","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/2373717","pdf_url":null,"source":{"id":"https://openalex.org/S4377196283","display_name":"Research Padua  Archive (University of Padua)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/1","score":0.75,"display_name":"No poverty"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W153995565","https://openalex.org/W1546133809","https://openalex.org/W1981745143","https://openalex.org/W2027359109","https://openalex.org/W2077122984","https://openalex.org/W2102650424","https://openalex.org/W2102914327","https://openalex.org/W2137431585","https://openalex.org/W2138621811","https://openalex.org/W2148803052","https://openalex.org/W2752908210","https://openalex.org/W6645817467","https://openalex.org/W6669417358"],"related_works":["https://openalex.org/W2390829436","https://openalex.org/W1971289376","https://openalex.org/W1989791859","https://openalex.org/W2565094479","https://openalex.org/W602859758","https://openalex.org/W2152992791","https://openalex.org/W2379101322","https://openalex.org/W2726447019","https://openalex.org/W1992553864","https://openalex.org/W2006439817"],"abstract_inverted_index":{"How":[0],"many":[1,138],"iterations":[2,62],"does":[3],"the":[4,24,30,36,45,50,65,68,77,83,87],"(ever":[5],"more)":[6],"popular":[7],"HITS":[8],"algorithm":[9,88],"require":[10],"to":[11,22,71,102,107],"converge":[12],"in":[13,19,41,64,82,137],"score":[14],"and,":[15],"perhaps":[16],"more":[17],"importantly,":[18],"rank":[20,42],"(i.e.":[21],"get":[23],"nodes":[25],"of":[26,39,52,61,67,86,93,111],"a":[27,59,129,132],"graph":[28,70],"\"in":[29],"right":[31],"order\")?":[32],"After":[33],"pinning":[34],"down":[35],"elusive":[37],"notion":[38],"convergence":[40,51,144],"we":[43],"provide":[44],"first":[46],"non-trivial":[47],"bounds":[48],"on":[49],"HITS.":[53,112],"A":[54],"\"worst":[55],"case\"":[56],"example,":[57],"requiring":[58],"number":[60],"superexponential":[63],"size":[66],"target":[69],"achieve":[72],"even":[73],"\"mild\"":[74],"convergence,":[75],"suggests":[76],"need":[78],"for":[79],"greater":[80],"caution":[81],"experimental":[84],"evaluation":[85],"-":[89],"as":[90,120,122],"recent":[91],"results":[92],"poor":[94],"performance":[95],"(e.g.":[96],"vs.":[97],"SALSA)":[98],"might":[99],"be":[100],"due":[101],"insufficient":[103],"iterations,":[104],"rather":[105],"than":[106],"an":[108],"intrinsic":[109],"deficiency":[110],"An":[113],"almost":[114],"matching":[115],"upper":[116],"bound":[117],"shows":[118],"that,":[119],"long":[121],"one":[123],"employs":[124],"exponential":[125],"acceleration":[126],"e.g.":[127],"through":[128],"\"squaring":[130],"trick\",":[131],"polynomial":[133],"running":[134],"time":[135],"(practical":[136],"application":[139],"domains)":[140],"always":[141],"provides":[142],"strong":[143],"guarantees.":[145]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}