{"id":"https://openalex.org/W4290874961","doi":"https://doi.org/10.1145/3534678.3539332","title":"Towards an Optimal Asymmetric Graph Structure for Robust Semi-supervised Node Classification","display_name":"Towards an Optimal Asymmetric Graph Structure for Robust Semi-supervised Node Classification","publication_year":2022,"publication_date":"2022-08-12","ids":{"openalex":"https://openalex.org/W4290874961","doi":"https://doi.org/10.1145/3534678.3539332"},"language":"en","primary_location":{"id":"doi:10.1145/3534678.3539332","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3534678.3539332","pdf_url":null,"source":{"id":"https://openalex.org/S4363608767","display_name":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research-information.bris.ac.uk/en/publications/600f2ae8-0b8f-4cd1-83c3-aa23a11fcfba","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036555049","display_name":"Zixing Song","orcid":"https://orcid.org/0000-0002-8871-3990"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zixing Song","raw_affiliation_strings":["The Chinese University of Hong Kong, Sha Tin, Hong Kong"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Sha Tin, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100386948","display_name":"Yifei Zhang","orcid":"https://orcid.org/0000-0003-4185-8663"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yifei Zhang","raw_affiliation_strings":["The Chinese University of Hong Kong, Sha Tin, Hong Kong"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Sha Tin, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042251906","display_name":"Irwin King","orcid":"https://orcid.org/0000-0001-8106-6447"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Irwin King","raw_affiliation_strings":["The Chinese University of Hong Kong, Sha Tin, Hong Kong"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Sha Tin, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036555049"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":3.0262,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.92935877,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1656","last_page":"1665"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9998999834060669,"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":"Advanced Graph Neural Networks","score":0.9998999834060669,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9865999817848206,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11550","display_name":"Text and Document Classification Technologies","score":0.9704999923706055,"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/computer-science","display_name":"Computer science","score":0.6243481040000916},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5880267024040222},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.48991841077804565},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4313443899154663},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4151201844215393},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3234320878982544}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6243481040000916},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5880267024040222},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.48991841077804565},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4313443899154663},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4151201844215393},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3234320878982544}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3534678.3539332","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3534678.3539332","pdf_url":null,"source":{"id":"https://openalex.org/S4363608767","display_name":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","raw_type":"proceedings-article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire/600f2ae8-0b8f-4cd1-83c3-aa23a11fcfba","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/600f2ae8-0b8f-4cd1-83c3-aa23a11fcfba","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Song, Z, Zhang, Y & King, I 2022, Towards an Optimal Asymmetric Graph Structure for Robust Semi-supervised Node Classification. in The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, pp. 1656-1665. https://doi.org/10.1145/3534678.3539332","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:research-information.bris.ac.uk:openaire/600f2ae8-0b8f-4cd1-83c3-aa23a11fcfba","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/600f2ae8-0b8f-4cd1-83c3-aa23a11fcfba","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Song, Z, Zhang, Y & King, I 2022, Towards an Optimal Asymmetric Graph Structure for Robust Semi-supervised Node Classification. in The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, pp. 1656-1665. https://doi.org/10.1145/3534678.3539332","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1766074018","display_name":null,"funder_award_id":"No. 2018AAA0100204","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"}],"funders":[{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1500351990","https://openalex.org/W1528239948","https://openalex.org/W1969198379","https://openalex.org/W2117310721","https://openalex.org/W2153959628","https://openalex.org/W2401830239","https://openalex.org/W2803831897","https://openalex.org/W2907492528","https://openalex.org/W2914232277","https://openalex.org/W2948729509","https://openalex.org/W2963456618","https://openalex.org/W2966398094","https://openalex.org/W3081203761","https://openalex.org/W3098276446","https://openalex.org/W3121197195","https://openalex.org/W3127180058","https://openalex.org/W3153206160","https://openalex.org/W3177564060","https://openalex.org/W3187395669","https://openalex.org/W3187966659","https://openalex.org/W3209785184","https://openalex.org/W4206445139","https://openalex.org/W4206865191","https://openalex.org/W4212890525","https://openalex.org/W4220689021","https://openalex.org/W4224319742","https://openalex.org/W4283789866","https://openalex.org/W4288080214"],"related_works":["https://openalex.org/W2961085424","https://openalex.org/W4306674287","https://openalex.org/W3046775127","https://openalex.org/W4394896187","https://openalex.org/W3170094116","https://openalex.org/W4386462264","https://openalex.org/W3107602296","https://openalex.org/W4364306694","https://openalex.org/W4312192474","https://openalex.org/W4283697347"],"abstract_inverted_index":{"Graph":[0,26],"Neural":[1],"Networks":[2],"(GNNs)":[3],"have":[4],"demonstrated":[5],"great":[6],"power":[7],"for":[8,33,53,74,88,105,145],"the":[9,21,41,46,54,60,67,71,85,93,106,126,129,134,146,152,170,182,191,197,200],"semi-supervised":[10,107,147],"node":[11,68,148,184],"classification":[12,149,185],"task.":[13,56],"However,":[14],"most":[15,58],"GNN":[16,47,89],"methods":[17],"are":[18],"sensitive":[19],"to":[20,110,168],"noise":[22],"of":[23,59,128,137,155,193,199],"graph":[24,43,52,75,113,131,141],"structures.":[25],"structure":[27,142],"learning":[28],"(GSL)":[29],"is":[30],"then":[31],"introduced":[32],"robustification,":[34],"which":[35,176],"contains":[36],"two":[37],"major":[38],"parts:":[39],"recovering":[40],"optimal":[42,139,201],"and":[44,77,98,132,157,196],"fine-tuning":[45],"parameters":[48],"on":[49,66,125],"this":[50,115,118,174],"generated":[51],"downstream":[55],"Nonetheless,":[57],"existing":[61],"GSL":[62,104],"solutions":[63],"merely":[64],"focus":[65],"features":[69],"during":[70,84],"first":[72],"module":[73,87],"generation":[76],"exploit":[78],"label":[79],"information":[80],"only":[81],"by":[82,150],"back-propagation":[83],"second":[86],"training.":[90],"They":[91],"neglect":[92],"different":[94,153],"roles":[95,154],"that":[96],"labeled":[97,156],"unlabeled":[99,158],"nodes":[100,159],"could":[101],"play":[102],"in":[103,173],"task,":[108],"leading":[109],"a":[111,122,165],"sub-optimal":[112],"under":[114],"setting.":[116],"In":[117],"paper,":[119],"we":[120],"give":[121],"precise":[123],"definition":[124],"optimality":[127],"refined":[130],"provide":[133],"exact":[135],"form":[136],"an":[138],"asymmetric":[140],"designed":[143],"explicitly":[144],"distinguishing":[151],"through":[160],"theoretical":[161],"analysis.":[162],"We":[163],"propose":[164],"probabilistic":[166],"model":[167],"infer":[169],"edge":[171],"weights":[172],"graph,":[175],"can":[177],"be":[178],"jointly":[179],"trained":[180],"with":[181],"subsequent":[183],"component.":[186],"Extensive":[187],"experimental":[188],"results":[189],"demonstrate":[190],"effectiveness":[192],"our":[194],"method":[195],"rationality":[198],"graph.":[202]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":14}],"updated_date":"2026-04-13T07:58:08.660418","created_date":"2025-10-10T00:00:00"}
