{"id":"https://openalex.org/W2070109133","doi":"https://doi.org/10.1109/apweb.2010.42","title":"A Space and Time Efficient Algorithm for SimRank Computation","display_name":"A Space and Time Efficient Algorithm for SimRank Computation","publication_year":2010,"publication_date":"2010-04-01","ids":{"openalex":"https://openalex.org/W2070109133","doi":"https://doi.org/10.1109/apweb.2010.42","mag":"2070109133"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/apweb.2010.42","pdf_url":null,"source":null,"license":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://www.cse.unsw.edu.au/%7Elxue/paper/wwwj.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024296105","display_name":"Weiren Yu","orcid":"https://orcid.org/0000-0002-1082-9475"},"institutions":[{"id":"https://openalex.org/I181326427","display_name":"Donghua University","ror":"https://ror.org/035psfh38","country_code":"CN","type":"education","lineage":["https://openalex.org/I181326427"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weiren Yu","raw_affiliation_string":"[Dept. of Comput. Sci. & Technol., Donghua Univ., Shanghai, China]","raw_affiliation_strings":["[Dept. of Comput. Sci. & Technol., Donghua Univ., Shanghai, China]"]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056923399","display_name":"Xuemin Lin","orcid":"https://orcid.org/0000-0003-2396-7225"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Xuemin Lin","raw_affiliation_string":"School of Computer Sci. and Eng., University of New South Wales, Sydney, NSW, Australia#TAB#","raw_affiliation_strings":["School of Computer Sci. and Eng., University of New South Wales, Sydney, NSW, Australia#TAB#"]},{"author_position":"last","author":{"id":"https://openalex.org/A5059713298","display_name":"Jiajin Le","orcid":"https://orcid.org/0000-0002-0508-3461"},"institutions":[{"id":"https://openalex.org/I181326427","display_name":"Donghua University","ror":"https://ror.org/035psfh38","country_code":"CN","type":"education","lineage":["https://openalex.org/I181326427"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiajin Le","raw_affiliation_string":"[Dept. of Comput. Sci. & Technol., Donghua Univ., Shanghai, China]","raw_affiliation_strings":["[Dept. of Comput. Sci. & Technol., Donghua Univ., Shanghai, China]"]}],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":12,"cited_by_percentile_year":{"min":87,"max":88},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Graph Neural Network Models and Applications","score":0.9987,"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"}},"topics":[{"id":"https://openalex.org/T11273","display_name":"Graph Neural Network Models and Applications","score":0.9987,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Matching and Analysis Techniques","score":0.9982,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11106","display_name":"Trajectory Data Mining and Analysis","score":0.9976,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"keyword":"simrank computation","score":0.9031},{"keyword":"efficient algorithm","score":0.5069},{"keyword":"time efficient algorithm","score":0.4802}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6490214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.55224097},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5249776},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4771147},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.42491132},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42140883},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40688294},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2604679},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25861222},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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":2,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/apweb.2010.42","pdf_url":null,"source":null,"license":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.1870","pdf_url":"http://www.cse.unsw.edu.au/%7Elxue/paper/wwwj.pdf","source":{"id":"https://openalex.org/S4306400349","display_name":"CiteSeer X (The Pennsylvania State University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"host_organization":"https://openalex.org/I130769515","host_organization_name":"Pennsylvania State University","host_organization_lineage":["https://openalex.org/I130769515"],"host_organization_lineage_names":["Pennsylvania State University"],"type":"repository"},"license":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.1870","pdf_url":"http://www.cse.unsw.edu.au/%7Elxue/paper/wwwj.pdf","source":{"id":"https://openalex.org/S4306400349","display_name":"CiteSeer X (The Pennsylvania State University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"host_organization":"https://openalex.org/I130769515","host_organization_name":"Pennsylvania State University","host_organization_lineage":["https://openalex.org/I130769515"],"host_organization_lineage_names":["Pennsylvania State University"],"type":"repository"},"license":null,"version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[],"grants":[],"referenced_works_count":14,"referenced_works":["https://openalex.org/W1684476672","https://openalex.org/W1967828505","https://openalex.org/W1972332180","https://openalex.org/W1979740015","https://openalex.org/W1995973731","https://openalex.org/W1996849720","https://openalex.org/W2024029196","https://openalex.org/W2025468035","https://openalex.org/W2081782912","https://openalex.org/W2103243299","https://openalex.org/W2117831564","https://openalex.org/W2130600608","https://openalex.org/W2568082647","https://openalex.org/W4255333822"],"related_works":["https://openalex.org/W2152992791","https://openalex.org/W2383646825","https://openalex.org/W2112835755","https://openalex.org/W2371018915","https://openalex.org/W2349674371","https://openalex.org/W2097495471","https://openalex.org/W2354191502","https://openalex.org/W2046435967","https://openalex.org/W4231775656","https://openalex.org/W4291951920"],"ngrams_url":"https://api.openalex.org/works/W2070109133/ngrams","abstract_inverted_index":{"SimRank":[0,20],"has":[1,31],"been":[2],"proposed":[3],"to":[4,158],"rank":[5],"web":[6],"documents":[7],"based":[8],"on":[9,13,151],"a":[10,102],"graph":[11],"model":[12,104],"hyperlinks.":[14],"The":[15,27],"existing":[16,125,140],"techniques":[17,72,141],"for":[18,53],"conducting":[19],"computation":[21,25],"adopt":[22],"an":[23],"iteration":[24,55,76,166],"paradigm.":[26],"most":[28],"efficient":[29],"technique":[30],"the":[32,41,50,59,78,97,120,124,133,139,160],"time":[33,79,134],"complexity":[34,137],"O(n":[35,44],"3":[38],")":[39,48],"with":[40],"space":[42,89,136],"requirement":[43],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2":[47],"in":[49,101],"worst":[51],"case":[52],"each":[54,75],"where":[56,94],"n":[57],"is":[58,96,143],"number":[60,98],"of":[61,99,123,138,164],"nodes":[62],"(web":[63],"documents).":[64],"In":[65],"this":[66],"paper,":[67],"we":[68],"propose":[69],"novel":[70],"optimization":[71],"such":[73],"that":[74,116],"takes":[77],"O(min{n":[80],"\u00b7":[81],"m,n":[82],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">r":[85],"})":[86],"and":[87,105,135,154,162],"requires":[88],"O":[90],"(n":[91],"+":[92],"m)":[93],"m":[95],"edges":[100],"web-graph":[103],"r":[106],"\u2264":[107],"log":[108],"2":[111],"7.":[112],"We":[113,147],"also":[114,144],"show":[115],"our":[117,128,165],"algorithm":[118,129],"accelerates":[119],"convergence":[121],"rate":[122],"techniques.":[126,167],"Moreover,":[127],"not":[130],"only":[131],"reduces":[132],"but":[142],"I/O":[145],"efficient.":[146],"conduct":[148],"extensive":[149],"experiments":[150],"both":[152],"synthetic":[153],"real":[155],"data":[156],"sets":[157],"demonstrate":[159],"efficiency":[161],"effectiveness":[163]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2070109133","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2024-03-20T11:00:10.144820","created_date":"2016-06-24"}