{"id":"https://openalex.org/W3210036019","doi":"https://doi.org/10.1109/dsaa53316.2021.9564202","title":"Adversarially Generating Rank-Constrained Graphs","display_name":"Adversarially Generating Rank-Constrained Graphs","publication_year":2021,"publication_date":"2021-10-06","ids":{"openalex":"https://openalex.org/W3210036019","doi":"https://doi.org/10.1109/dsaa53316.2021.9564202","mag":"3210036019"},"language":"en","primary_location":{"id":"doi:10.1109/dsaa53316.2021.9564202","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dsaa53316.2021.9564202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE 8th International Conference on Data Science and Advanced Analytics (DSAA)","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/A5022498356","display_name":"William Shiao","orcid":"https://orcid.org/0000-0001-5813-2266"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"William Shiao","raw_affiliation_strings":["Dept. of Computer Science and Engineering, University of California, Riverside"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, University of California, Riverside","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054849323","display_name":"Evangelos E. Papalexakis","orcid":"https://orcid.org/0000-0002-3411-8483"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Evangelos E. Papalexakis","raw_affiliation_strings":["Dept. of Computer Science and Engineering, University of California, Riverside"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, University of California, Riverside","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022498356"],"corresponding_institution_ids":["https://openalex.org/I103635307"],"apc_list":null,"apc_paid":null,"fwci":0.4079,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69476664,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.9990000128746033,"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/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.9990000128746033,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9961000084877014,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9957000017166138,"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/rank","display_name":"Rank (graph theory)","score":0.7357052564620972},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6009224653244019},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5264261960983276},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5020921230316162},{"id":"https://openalex.org/keywords/graph-product","display_name":"Graph product","score":0.4984261989593506},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46279168128967285},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33346444368362427},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2860403060913086},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25529107451438904},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.14622682332992554}],"concepts":[{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.7357052564620972},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6009224653244019},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5264261960983276},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5020921230316162},{"id":"https://openalex.org/C68103157","wikidata":"https://www.wikidata.org/wiki/Q569347","display_name":"Graph product","level":5,"score":0.4984261989593506},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46279168128967285},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33346444368362427},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2860403060913086},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25529107451438904},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.14622682332992554},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dsaa53316.2021.9564202","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dsaa53316.2021.9564202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE 8th International Conference on Data Science and Advanced Analytics (DSAA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G657183182","display_name":null,"funder_award_id":"IIS 2046086","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1522301498","https://openalex.org/W1710476689","https://openalex.org/W1986326495","https://openalex.org/W2032005951","https://openalex.org/W2076844992","https://openalex.org/W2106221905","https://openalex.org/W2124637492","https://openalex.org/W2125865219","https://openalex.org/W2144799688","https://openalex.org/W2153959628","https://openalex.org/W2155910443","https://openalex.org/W2768532803","https://openalex.org/W2792402990","https://openalex.org/W2806115886","https://openalex.org/W2806351858","https://openalex.org/W2905110430","https://openalex.org/W2948056114","https://openalex.org/W2951101948","https://openalex.org/W2962879692","https://openalex.org/W2963169753","https://openalex.org/W2963999633","https://openalex.org/W2964015378","https://openalex.org/W2964057425","https://openalex.org/W2964121744","https://openalex.org/W2964271403","https://openalex.org/W2998122931","https://openalex.org/W3071263141","https://openalex.org/W4229523247","https://openalex.org/W4234057457","https://openalex.org/W4252973173","https://openalex.org/W4289436753","https://openalex.org/W4295521014","https://openalex.org/W4297951436","https://openalex.org/W4298289240","https://openalex.org/W6678814708"],"related_works":["https://openalex.org/W3013085049","https://openalex.org/W2152992791","https://openalex.org/W1560496689","https://openalex.org/W4386900933","https://openalex.org/W4385301946","https://openalex.org/W4297797135","https://openalex.org/W3125672081","https://openalex.org/W1673581201","https://openalex.org/W2991991550","https://openalex.org/W64182352"],"abstract_inverted_index":{"Graph":[0],"generation":[1],"is":[2],"a":[3,10,69,171],"task":[4],"that":[5,55,62,78,113],"has":[6,59],"been":[7,60],"explored":[8],"with":[9,137,140],"wide":[11],"variety":[12],"of":[13,29,35,52,68,83,99,109,156],"methods.":[14],"Recently,":[15],"several":[16],"papers":[17],"have":[18,43,126],"applied":[19],"Generative":[20],"Adversarial":[21],"Networks":[22],"(GANs)":[23],"to":[24,49,95,120,143,182],"this":[25,103,184],"task,":[26],"but":[27,162],"most":[28],"these":[30],"methods":[31,91],"result":[32],"in":[33,54,118,164],"graphs":[34,42,82,135,155],"full":[36],"or":[37,144],"unknown":[38],"rank.":[39,128,149],"Many":[40],"real-world":[41],"low":[44,65],"rank,":[45,161],"which":[46,117,179],"roughly":[47],"translates":[48],"the":[50,64,97,147,159,177],"number":[51],"communities":[53],"graph.":[56],"Furthermore,":[57],"it":[58],"shown":[61],"taking":[63],"rank":[66,85,98,141,173],"approximation":[67],"graph":[70,123],"can":[71],"defend":[72],"against":[73,81],"adversarial":[74],"attacks.":[75],"This":[76],"suggests":[77],"testing":[79],"models":[80],"different":[84],"may":[86],"be":[87],"useful.":[88],"However,":[89],"current":[90],"provide":[92],"no":[93],"way":[94],"control":[96,183],"generated":[100],"graphs.":[101],"In":[102],"paper,":[104],"we":[105],"propose":[106,170],"two":[107],"variants":[108],"BRGAN:":[110],"GAN":[111],"architectures":[112],"generates":[114,133,154],"synthetic":[115,134],"graphs,":[116],"addition":[119],"having":[121],"realistic":[122,166],"features,":[124],"also":[125,169],"bounded":[127],"Our":[129,150],"first":[130],"variant,":[131,152],"BRGAN-A,":[132],"competitive":[136],"state-of-the-art":[138],"models,":[139],"equal":[142],"lower":[145],"than":[146],"desired":[148,160],"second":[151],"BRGAN-B,":[153],"almost":[157],"exactly":[158],"results":[163],"less":[165],"results.":[167],"We":[168],"novel":[172],"penalty":[174],"term":[175],"on":[176],"generator,":[178],"allows":[180],"us":[181],"realism-rank":[185],"tradeoff.":[186]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}