{"id":"https://openalex.org/W3008765698","doi":"https://doi.org/10.1109/bigdata47090.2019.9006047","title":"Filtering Strategies for Inexact Subgraph Matching on Noisy Multiplex Networks","display_name":"Filtering Strategies for Inexact Subgraph Matching on Noisy Multiplex Networks","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3008765698","doi":"https://doi.org/10.1109/bigdata47090.2019.9006047","mag":"3008765698"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata47090.2019.9006047","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata47090.2019.9006047","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Big Data (Big Data)","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/A5089905338","display_name":"Alexei Kopylov","orcid":null},"institutions":[{"id":"https://openalex.org/I200576644","display_name":"HRL Laboratories (United States)","ror":"https://ror.org/05p7te762","country_code":"US","type":"company","lineage":["https://openalex.org/I200576644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexei Kopylov","raw_affiliation_strings":["HRL Laboratories, Malibu, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"HRL Laboratories, Malibu, CA, USA","institution_ids":["https://openalex.org/I200576644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102267796","display_name":"Jiejun Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I200576644","display_name":"HRL Laboratories (United States)","ror":"https://ror.org/05p7te762","country_code":"US","type":"company","lineage":["https://openalex.org/I200576644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jiejun Xu","raw_affiliation_strings":["HRL Laboratories, Malibu, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"HRL Laboratories, Malibu, CA, USA","institution_ids":["https://openalex.org/I200576644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0122,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.835009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9997000098228455,"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.9997000098228455,"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 Theory and Algorithms","score":0.9990000128746033,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9937999844551086,"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.7038900852203369},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6008049249649048},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5222312211990356},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5180549621582031},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.4385104477405548},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.41724690794944763},{"id":"https://openalex.org/keywords/multiplex","display_name":"Multiplex","score":0.41413944959640503},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3430216610431671},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.32704252004623413},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3237399458885193},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2425748109817505},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20329606533050537}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7038900852203369},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6008049249649048},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5222312211990356},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5180549621582031},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.4385104477405548},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.41724690794944763},{"id":"https://openalex.org/C2781188995","wikidata":"https://www.wikidata.org/wiki/Q6934982","display_name":"Multiplex","level":2,"score":0.41413944959640503},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3430216610431671},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.32704252004623413},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3237399458885193},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2425748109817505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20329606533050537},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C60644358","wikidata":"https://www.wikidata.org/wiki/Q128570","display_name":"Bioinformatics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata47090.2019.9006047","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata47090.2019.9006047","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5400000214576721,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W348531675","https://openalex.org/W1834012719","https://openalex.org/W2048653843","https://openalex.org/W2147913014","https://openalex.org/W2222512263","https://openalex.org/W2254833717","https://openalex.org/W2492277691","https://openalex.org/W2744353700","https://openalex.org/W2913192763","https://openalex.org/W2948742909","https://openalex.org/W2963749288","https://openalex.org/W2966799376","https://openalex.org/W3007127002","https://openalex.org/W3037826211"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W231720905","https://openalex.org/W2604893261","https://openalex.org/W2915540008","https://openalex.org/W1482551403","https://openalex.org/W2361654510","https://openalex.org/W2128390795","https://openalex.org/W2604114816","https://openalex.org/W2954463587","https://openalex.org/W2393701947"],"abstract_inverted_index":{"We":[0,105],"study":[1],"the":[2,35,40,53,80,107,110,120,137,143,148],"problem":[3],"of":[4,32,47,109,142],"detecting":[5],"matching":[6,25,55,133],"subgraphs":[7,74],"in":[8,39],"a":[9,29,62,84,114],"large":[10,166],"multiplex":[11,41,116],"background":[12,86],"network":[13,117],"based":[14,65],"on":[15,66,113],"predefined":[16],"subgraph":[17,24,49,132],"templates.":[18],"Our":[19,127],"approach":[20,60,94,128,155],"extends":[21],"existing":[22],"filtering-based":[23],"algorithms":[26],"and":[27,51,103,139],"proposes":[28,61],"new":[30,63],"set":[31],"filters":[33],"leveraging":[34],"monotone":[36],"function":[37],"properties":[38],"setting.":[42],"This":[43,88],"enables":[44],"effective":[45],"pruning":[46],"irrelevant":[48],"regions":[50],"expedites":[52],"overall":[54],"process.":[56],"In":[57],"addition,":[58],"our":[59,153],"strategy":[64],"maximum":[67],"likelihood":[68],"estimate":[69],"to":[70,79,91,95,164],"identify":[71],"\u201cclosely":[72],"matched\u201d":[73],"that":[75,159],"are":[76,99],"not":[77],"isomorphic":[78],"given":[81],"templates":[82],"from":[83],"noisy":[85,140],"network.":[87],"allows":[89],"us":[90],"generalize":[92],"this":[93],"real-world":[96,115],"networks,":[97],"which":[98,145],"often":[100],"noisy,":[101],"incomplete":[102],"ambiguous.":[104],"demonstrate":[106],"effectiveness":[108],"proposed":[111,154],"method":[112],"provided":[118],"by":[119],"DARPA":[121],"Modeling":[122],"Adversarial":[123],"Activity":[124],"(MAA)":[125],"program.":[126],"obtains":[129],"highly":[130],"accurate":[131],"results":[134],"for":[135],"both":[136],"clean":[138],"versions":[141],"network,":[144],"significantly":[146],"outperforms":[147],"baseline":[149],"filtering":[150],"methods.":[151],"Furthermore,":[152],"is":[156],"parallelizable":[157],"such":[158],"it":[160],"can":[161],"scale":[162],"up":[163],"handle":[165],"input":[167],"networks.":[168]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}