{"id":"https://openalex.org/W4387848795","doi":"https://doi.org/10.1145/3583780.3615227","title":"Stochastic Subgraph Neighborhood Pooling for Subgraph Classification","display_name":"Stochastic Subgraph Neighborhood Pooling for Subgraph Classification","publication_year":2023,"publication_date":"2023-10-21","ids":{"openalex":"https://openalex.org/W4387848795","doi":"https://doi.org/10.1145/3583780.3615227"},"language":"en","primary_location":{"id":"doi:10.1145/3583780.3615227","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583780.3615227","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM International Conference on Information and Knowledge Management","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/A5071301260","display_name":"Shweta Ann Jacob","orcid":"https://orcid.org/0000-0003-1665-0799"},"institutions":[{"id":"https://openalex.org/I39470171","display_name":"University of Ontario Institute of Technology","ror":"https://ror.org/016zre027","country_code":"CA","type":"education","lineage":["https://openalex.org/I39470171"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Shweta Ann Jacob","raw_affiliation_strings":["University of Ontario Institute of Technology, Oshawa, ON, Canada"],"affiliations":[{"raw_affiliation_string":"University of Ontario Institute of Technology, Oshawa, ON, Canada","institution_ids":["https://openalex.org/I39470171"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031848981","display_name":"Paul Louis","orcid":"https://orcid.org/0000-0002-4090-2434"},"institutions":[{"id":"https://openalex.org/I39470171","display_name":"University of Ontario Institute of Technology","ror":"https://ror.org/016zre027","country_code":"CA","type":"education","lineage":["https://openalex.org/I39470171"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Paul Louis","raw_affiliation_strings":["University of Ontario Institute of Technology, Oshawa, ON, Canada"],"affiliations":[{"raw_affiliation_string":"University of Ontario Institute of Technology, Oshawa, ON, Canada","institution_ids":["https://openalex.org/I39470171"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058217217","display_name":"Amirali Salehi\u2010Abari","orcid":"https://orcid.org/0000-0001-8053-7710"},"institutions":[{"id":"https://openalex.org/I39470171","display_name":"University of Ontario Institute of Technology","ror":"https://ror.org/016zre027","country_code":"CA","type":"education","lineage":["https://openalex.org/I39470171"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Amirali Salehi-Abari","raw_affiliation_strings":["University of Ontario Institute of Technology, Oshawa, ON, Canada"],"affiliations":[{"raw_affiliation_string":"University of Ontario Institute of Technology, Oshawa, ON, Canada","institution_ids":["https://openalex.org/I39470171"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5071301260"],"corresponding_institution_ids":["https://openalex.org/I39470171"],"apc_list":null,"apc_paid":null,"fwci":0.8741,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79190955,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"3963","last_page":"3967"},"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/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.9695000052452087,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9539999961853027,"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/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.8803975582122803},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.7910109758377075},{"id":"https://openalex.org/keywords/pooling","display_name":"Pooling","score":0.7467905282974243},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6383506059646606},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.631761372089386},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.5065268278121948},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4937189519405365},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.45558199286460876},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4494915008544922},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27569955587387085},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16427239775657654},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.153633713722229},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.11674079298973083}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.8803975582122803},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.7910109758377075},{"id":"https://openalex.org/C70437156","wikidata":"https://www.wikidata.org/wiki/Q7228652","display_name":"Pooling","level":2,"score":0.7467905282974243},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6383506059646606},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.631761372089386},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.5065268278121948},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4937189519405365},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.45558199286460876},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4494915008544922},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27569955587387085},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16427239775657654},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.153633713722229},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.11674079298973083}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3583780.3615227","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583780.3615227","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM International Conference on Information and Knowledge Management","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7599999904632568}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2788919350","https://openalex.org/W2807021761","https://openalex.org/W2808803559","https://openalex.org/W2911495555","https://openalex.org/W2912083425","https://openalex.org/W3100848837","https://openalex.org/W3116202926","https://openalex.org/W4306317318","https://openalex.org/W4311003543"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W2886672068","https://openalex.org/W2953496651","https://openalex.org/W1512756268","https://openalex.org/W3208942821","https://openalex.org/W167435155","https://openalex.org/W2035609387","https://openalex.org/W2566098902","https://openalex.org/W1887488684","https://openalex.org/W4281613391"],"abstract_inverted_index":{"Subgraph":[0,110],"classification":[1,52],"is":[2,13,68,146],"an":[3],"emerging":[4],"field":[5],"in":[6,157],"graph":[7,25,44],"representation":[8],"learning":[9],"where":[10],"the":[11,58,62,66,71,101,117,128],"task":[12],"to":[14,47,96,148,154],"classify":[15],"a":[16,21,24,31],"group":[17],"of":[18,33,61],"nodes":[19],"(i.e.,":[20,64,122],"subgraph)":[22],"within":[23,70],"(e.g.,":[26],"identifying":[27],"rare":[28],"diseases":[29],"given":[30],"collection":[32],"phenotypes).":[34],"Graph":[35],"neural":[36],"network":[37],"(GNN)":[38],"solutions":[39],"for":[40,130],"node,":[41],"link,":[42],"and":[43,93,119],"tasks":[45],"fail":[46],"perform":[48],"well":[49],"on":[50],"subgraph":[51,63,67,118],"as":[53],"they":[54],"do":[55],"not":[56,94],"capture":[57],"external":[59,123],"topology":[60],"how":[65],"located":[69],"larger":[72],"graph).":[73],"The":[74],"current":[75],"state-of-the-art":[76,149],"models":[77],"address":[78,100],"this":[79],"shortcoming":[80],"through":[81],"either":[82],"labeling":[83,136],"tricks":[84],"or":[85,145],"multiple":[86],"message-passing":[87],"channels,":[88],"which":[89,114],"are":[90],"computationally":[91,132],"expensive":[92,133],"scalable":[95],"large":[97],"graphs.":[98],"To":[99],"scalability":[102],"issue":[103],"while":[104,126,151],"maintaining":[105],"generalization,":[106],"we":[107],"propose":[108],"Stochastic":[109],"Neighborhood":[111],"Pooling":[112],"(SSNP),":[113],"jointly":[115],"aggregates":[116],"its":[120],"neighborhood":[121],"topology)":[124],"information":[125],"removing":[127],"need":[129],"any":[131],"operations":[134],"(e.g.":[135],"tricks).":[137],"Our":[138],"extensive":[139],"experiments":[140],"demonstrate":[141],"that":[142],"SSNP":[143],"outperforms":[144],"comparable":[147],"methods":[150],"being":[152],"up":[153],"13x":[155],"faster":[156],"runtime.":[158]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}