{"id":"https://openalex.org/W2955966953","doi":"https://doi.org/10.1145/3331184.3331338","title":"Local Matrix Approximation based on Graph Random Walk","display_name":"Local Matrix Approximation based on Graph Random Walk","publication_year":2019,"publication_date":"2019-07-18","ids":{"openalex":"https://openalex.org/W2955966953","doi":"https://doi.org/10.1145/3331184.3331338","mag":"2955966953"},"language":"en","primary_location":{"id":"doi:10.1145/3331184.3331338","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3331184.3331338","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd 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/A5047837493","display_name":"Xuejiao Yang","orcid":"https://orcid.org/0000-0001-5569-2778"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuejiao Yang","raw_affiliation_strings":["Huazhong University of Science and Technology (HUST), Wuhan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Huazhong University of Science and Technology (HUST), Wuhan, China","institution_ids":["https://openalex.org/I47720641"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071384393","display_name":"Bang Wang","orcid":"https://orcid.org/0000-0002-0312-4805"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bang Wang","raw_affiliation_strings":["Huazhong University of Science and Technology (HUST), Wuhan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Huazhong University of Science and Technology (HUST), Wuhan, China","institution_ids":["https://openalex.org/I47720641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I47720641"],"apc_list":null,"apc_paid":null,"fwci":2.8214,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.92308084,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1037","last_page":"1040"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10203","display_name":"Recommender Systems and Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10203","display_name":"Recommender Systems and Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9911999702453613,"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/T10057","display_name":"Face and Expression Recognition","score":0.979200005531311,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6567528247833252},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.6382346153259277},{"id":"https://openalex.org/keywords/distance-matrix","display_name":"Distance matrix","score":0.5509074926376343},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5425475239753723},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5383063554763794},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.5325063467025757},{"id":"https://openalex.org/keywords/stochastic-matrix","display_name":"Stochastic matrix","score":0.5286893248558044},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4779401123523712},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4421055316925049},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4331205189228058},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40106201171875},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37591588497161865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.338949054479599},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.24549782276153564},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.16173860430717468}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6567528247833252},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.6382346153259277},{"id":"https://openalex.org/C111208986","wikidata":"https://www.wikidata.org/wiki/Q901698","display_name":"Distance matrix","level":2,"score":0.5509074926376343},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5425475239753723},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5383063554763794},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.5325063467025757},{"id":"https://openalex.org/C49555168","wikidata":"https://www.wikidata.org/wiki/Q176583","display_name":"Stochastic matrix","level":3,"score":0.5286893248558044},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4779401123523712},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4421055316925049},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4331205189228058},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40106201171875},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37591588497161865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.338949054479599},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.24549782276153564},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.16173860430717468},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","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/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3331184.3331338","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3331184.3331338","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.5699999928474426}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1854214752","https://openalex.org/W2054141820","https://openalex.org/W2171813380","https://openalex.org/W2336195973","https://openalex.org/W2613709413","https://openalex.org/W2963363076"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W2080136900","https://openalex.org/W2372768926","https://openalex.org/W2999799752","https://openalex.org/W2115167491","https://openalex.org/W2567825307","https://openalex.org/W2054458431","https://openalex.org/W4386907405"],"abstract_inverted_index":{"How":[0],"to":[1,113],"decompose":[2],"a":[3,16,29,52,80],"large":[4],"global":[5,88,123],"matrix":[6,19,26,57,117,124],"into":[7],"many":[8],"small":[9],"local":[10,56,116,134],"matrices":[11],"has":[12],"been":[13],"recently":[14],"researched":[15],"lot":[17],"for":[18,55,118],"approximation.":[20],"However,":[21],"the":[22,37,69,87,95,115,122,130,139,145,149],"distance":[23,43,61],"computation":[24],"in":[25,152],"decomposition":[27],"is":[28,66,84,111,126],"challenging":[30],"issue,":[31],"as":[32,103],"no":[33],"prior":[34],"knowledge":[35],"about":[36],"most":[38],"appropriate":[39],"feature":[40],"vectors":[41],"and":[42,158],"measures":[44],"are":[45],"available.":[46],"In":[47],"this":[48],"paper,":[49],"we":[50,98],"propose":[51],"novel":[53],"scheme":[54],"construction":[58],"without":[59],"involving":[60],"computation.":[62],"The":[63],"basic":[64],"idea":[65],"based":[67],"on":[68,94,138],"application":[70],"of":[71,74,133,154],"convergence":[72],"probabilities":[73],"graph":[75,83],"random":[76,92,107],"walk.":[77],"At":[78],"first,":[79],"user-item":[81,101],"bipartite":[82,96],"constructed":[85],"from":[86],"matrix.":[89],"After":[90],"performing":[91],"walk":[93,108],"graph,":[97],"select":[99],"some":[100],"pairs":[102],"anchors.":[104],"Then":[105],"another":[106],"with":[109],"restart":[110],"applied":[112],"construct":[114],"each":[119],"anchor.":[120],"Finally,":[121],"approximation":[125],"obtained":[127],"by":[128],"averaging":[129],"prediction":[131,156],"results":[132],"matrices.":[135],"Our":[136],"experiments":[137],"four":[140],"real-world":[141],"datasets":[142],"show":[143],"that":[144],"proposed":[146],"solution":[147],"outperforms":[148],"state-of-the-art":[150],"schemes":[151],"terms":[153],"lower":[155],"errors":[157],"higher":[159],"coverage":[160],"ratios.":[161]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}
