{"id":"https://openalex.org/W2796251419","doi":"https://doi.org/10.1109/dsw.2018.8439911","title":"LEARNING FLEXIBLE REPRESENTATIONS OF STOCHASTIC PROCESSES ON GRAPHS","display_name":"LEARNING FLEXIBLE REPRESENTATIONS OF STOCHASTIC PROCESSES ON GRAPHS","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2796251419","doi":"https://doi.org/10.1109/dsw.2018.8439911","mag":"2796251419"},"language":"en","primary_location":{"id":"doi:10.1109/dsw.2018.8439911","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dsw.2018.8439911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Data Science Workshop (DSW)","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/A5020111697","display_name":"Addison Bohannon","orcid":"https://orcid.org/0000-0003-3019-4822"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Addison W. Bohannon","raw_affiliation_strings":["Center for Sci. Comp. and Mathematical Modeling, University of Maryland, College Park, MD"],"affiliations":[{"raw_affiliation_string":"Center for Sci. Comp. and Mathematical Modeling, University of Maryland, College Park, MD","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053858045","display_name":"Brian M. Sadler","orcid":"https://orcid.org/0000-0002-9564-3812"},"institutions":[{"id":"https://openalex.org/I166416128","display_name":"DEVCOM Army Research Laboratory","ror":"https://ror.org/011hc8f90","country_code":"US","type":"government","lineage":["https://openalex.org/I1304082316","https://openalex.org/I1330347796","https://openalex.org/I166416128","https://openalex.org/I2802705668","https://openalex.org/I4210154437"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian M. Sadler","raw_affiliation_strings":["US Army Research Laboratory, Adelphi, MD"],"affiliations":[{"raw_affiliation_string":"US Army Research Laboratory, Adelphi, MD","institution_ids":["https://openalex.org/I166416128"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049105209","display_name":"Radu B\u0103lan","orcid":"https://orcid.org/0000-0002-6217-3236"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Radu V. Balan","raw_affiliation_strings":["Center for Sci. Comp. and Mathematical Modeling, University of Maryland, College Park, MD"],"affiliations":[{"raw_affiliation_string":"Center for Sci. Comp. and Mathematical Modeling, University of Maryland, College Park, MD","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020111697"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03357919,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"521","issue":null,"first_page":"61","last_page":"65"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":1.0,"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":1.0,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9962000250816345,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9932000041007996,"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.6881537437438965},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5887812972068787},{"id":"https://openalex.org/keywords/graph-product","display_name":"Graph product","score":0.5329139232635498},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.453273206949234},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.45232897996902466},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4392291009426117},{"id":"https://openalex.org/keywords/moral-graph","display_name":"Moral graph","score":0.4298710823059082},{"id":"https://openalex.org/keywords/convolution","display_name":"Convolution (computer science)","score":0.4171912670135498},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4138012230396271},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.365867018699646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3158196210861206},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.2728549838066101},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.25648176670074463},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.24367862939834595},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.19203424453735352}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6881537437438965},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5887812972068787},{"id":"https://openalex.org/C68103157","wikidata":"https://www.wikidata.org/wiki/Q569347","display_name":"Graph product","level":5,"score":0.5329139232635498},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.453273206949234},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.45232897996902466},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4392291009426117},{"id":"https://openalex.org/C148067565","wikidata":"https://www.wikidata.org/wiki/Q3323718","display_name":"Moral graph","level":5,"score":0.4298710823059082},{"id":"https://openalex.org/C45347329","wikidata":"https://www.wikidata.org/wiki/Q5166604","display_name":"Convolution (computer science)","level":3,"score":0.4171912670135498},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4138012230396271},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.365867018699646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3158196210861206},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.2728549838066101},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.25648176670074463},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.24367862939834595},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.19203424453735352}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dsw.2018.8439911","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dsw.2018.8439911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Data Science Workshop (DSW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1575147392","https://openalex.org/W1662382123","https://openalex.org/W1698699930","https://openalex.org/W1990488619","https://openalex.org/W1991252559","https://openalex.org/W1994906459","https://openalex.org/W2010961394","https://openalex.org/W2101491865","https://openalex.org/W2261689926","https://openalex.org/W2335062971","https://openalex.org/W2521050763","https://openalex.org/W2558748708","https://openalex.org/W2610174843","https://openalex.org/W2616297073","https://openalex.org/W2775013440","https://openalex.org/W2781888589","https://openalex.org/W2796431263","https://openalex.org/W2919115771","https://openalex.org/W2963460103","https://openalex.org/W2964015378","https://openalex.org/W2964311892","https://openalex.org/W2964321699","https://openalex.org/W3106050203","https://openalex.org/W4251910796","https://openalex.org/W4293651439","https://openalex.org/W4297747096","https://openalex.org/W6637178625","https://openalex.org/W6720006811","https://openalex.org/W6726873649"],"related_works":["https://openalex.org/W2043128958","https://openalex.org/W4214487273","https://openalex.org/W3196191381","https://openalex.org/W4287028074","https://openalex.org/W3191289342","https://openalex.org/W4322810890","https://openalex.org/W2174928083","https://openalex.org/W1036516582","https://openalex.org/W1569841275","https://openalex.org/W2981133959"],"abstract_inverted_index":{"Graph":[0],"convolutional":[1,7,26,76],"networks":[2,9,28],"adapt":[3],"the":[4,22,53,80],"architecture":[5],"of":[6,14,25,52,59],"neural":[8,27],"to":[10,71,103],"learn":[11],"rich":[12],"representations":[13,113],"data":[15],"supported":[16,43],"on":[17,44,66],"arbitrary":[18],"graphs":[19,70],"by":[20],"replacing":[21],"convolution":[23],"operations":[24,37,61,83],"with":[29],"graph-dependent":[30,35],"linear":[31,36,60,82],"operations.":[32],"However,":[33],"these":[34],"are":[38],"developed":[39],"for":[40,62],"scalar":[41],"functions":[42],"undirected":[45],"graphs.":[46],"We":[47],"propose":[48],"both":[49],"a":[50,57],"generalization":[51],"underlying":[54],"graph":[55,75,116],"and":[56,98,107],"class":[58],"stochastic":[63],"(time-varying)":[64],"processes":[65],"directed":[67],"(or":[68],"undirected)":[69],"be":[72],"used":[73],"in":[74,111],"networks.":[77],"By":[78],"parameterizing":[79],"proposed":[81],"using":[84],"functional":[85],"calculus,":[86],"we":[87],"can":[88],"achieve":[89],"arbitrarily":[90],"low":[91],"learning":[92,112],"complexity.":[93],"The":[94],"combined":[95],"graphical":[96],"model":[97,104],"filtering":[99],"approach":[100],"is":[101],"shown":[102],"richer":[105],"behaviors":[106],"display":[108],"greater":[109],"flexibility":[110],"than":[114],"product":[115],"methods.":[117]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}