{"id":"https://openalex.org/W4414360423","doi":"https://doi.org/10.24963/ijcai.2025/386","title":"Let\u2019s Group: A Plug-and-Play SubGraph Learning Method for Memory-Efficient Spatio-Temporal Graph Modeling","display_name":"Let\u2019s Group: A Plug-and-Play SubGraph Learning Method for Memory-Efficient Spatio-Temporal Graph Modeling","publication_year":2025,"publication_date":"2025-09-01","ids":{"openalex":"https://openalex.org/W4414360423","doi":"https://doi.org/10.24963/ijcai.2025/386"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2025/386","is_oa":false,"landing_page_url":"https://doi.org/10.24963/ijcai.2025/386","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"conference-paper","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/A5041712546","display_name":"Wenchao Weng","orcid":"https://orcid.org/0000-0002-9677-3213"},"institutions":[{"id":"https://openalex.org/I55712492","display_name":"Zhejiang University of Technology","ror":"https://ror.org/02djqfd08","country_code":"CN","type":"education","lineage":["https://openalex.org/I55712492"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenchao Weng","raw_affiliation_strings":["Zhejiang University of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Zhejiang University of Technology","institution_ids":["https://openalex.org/I55712492"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075892883","display_name":"Hanyu Jiang","orcid":null},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hanyu Jiang","raw_affiliation_strings":["Hangzhou Dianzi University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hangzhou Dianzi University","institution_ids":["https://openalex.org/I50760025"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010641929","display_name":"Mei Wu","orcid":"https://orcid.org/0000-0002-6819-0360"},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Mei Wu","raw_affiliation_strings":["Hangzhou Dianzi University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hangzhou Dianzi University","institution_ids":["https://openalex.org/I50760025"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075148478","display_name":"Xiao Han","orcid":"https://orcid.org/0000-0003-1331-0860"},"institutions":[{"id":"https://openalex.org/I55712492","display_name":"Zhejiang University of Technology","ror":"https://ror.org/02djqfd08","country_code":"CN","type":"education","lineage":["https://openalex.org/I55712492"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiao Han","raw_affiliation_strings":["Zhejiang University of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Zhejiang University of Technology","institution_ids":["https://openalex.org/I55712492"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076008697","display_name":"Haidong Gao","orcid":"https://orcid.org/0000-0003-2774-5013"},"institutions":[{"id":"https://openalex.org/I55712492","display_name":"Zhejiang University of Technology","ror":"https://ror.org/02djqfd08","country_code":"CN","type":"education","lineage":["https://openalex.org/I55712492"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haidong Gao","raw_affiliation_strings":["Zhejiang University of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Zhejiang University of Technology","institution_ids":["https://openalex.org/I55712492"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091016267","display_name":"Guojiang Shen","orcid":null},"institutions":[{"id":"https://openalex.org/I55712492","display_name":"Zhejiang University of Technology","ror":"https://ror.org/02djqfd08","country_code":"CN","type":"education","lineage":["https://openalex.org/I55712492"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guojiang Shen","raw_affiliation_strings":["Zhejiang University of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Zhejiang University of Technology","institution_ids":["https://openalex.org/I55712492"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030323127","display_name":"Xiangjie Kong","orcid":"https://orcid.org/0000-0003-2698-3319"},"institutions":[{"id":"https://openalex.org/I55712492","display_name":"Zhejiang University of Technology","ror":"https://ror.org/02djqfd08","country_code":"CN","type":"education","lineage":["https://openalex.org/I55712492"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiangjie Kong","raw_affiliation_strings":["Zhejiang University of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Zhejiang University of Technology","institution_ids":["https://openalex.org/I55712492"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3471","last_page":"3479"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10757","display_name":"Geographic Information Systems Studies","score":0.9890999794006348,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10203","display_name":"Recommender Systems and Techniques","score":0.9884999990463257,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/redundancy","display_name":"Redundancy (engineering)","score":0.5001999735832214},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49140000343322754},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.45879998803138733},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.45559999346733093},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4345000088214874},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.3896999955177307},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3619999885559082},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.3562000095844269}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7383999824523926},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5267000198364258},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5001999735832214},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49140000343322754},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.45879998803138733},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.45559999346733093},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4345000088214874},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.3896999955177307},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3619999885559082},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3562000095844269},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.3495999872684479},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3490999937057495},{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.3197000026702881},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.31520000100135803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3109999895095825},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.30979999899864197},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.30790001153945923},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2971999943256378},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.26750001311302185},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2587999999523163},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2533999979496002}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2025/386","is_oa":false,"landing_page_url":"https://doi.org/10.24963/ijcai.2025/386","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","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":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Spatio-temporal":[0],"graph":[1,97,105],"modeling":[2],"is":[3,175],"widely":[4],"applied":[5],"to":[6,14,60,84,108,158],"spatio-temporal":[7,41],"data,":[8,42],"analyzing":[9],"the":[10,20,62,92,96,104],"relationships":[11],"between":[12],"data":[13],"achieve":[15],"accurate":[16],"predictions.":[17],"However,":[18],"despite":[19],"excellent":[21],"predictive":[22],"performance":[23],"of":[24,80,145],"increasingly":[25],"complex":[26],"models,":[27],"their":[28,45],"intricate":[29],"architectures":[30],"result":[31],"in":[32,162],"significant":[33],"memory":[34,63,82,154,165],"overhead":[35,64],"and":[36],"computational":[37],"complexity":[38],"when":[39],"handling":[40],"which":[43,76,129],"limits":[44],"practical":[46],"applications.":[47],"To":[48,118],"address":[49],"these":[50],"challenges,":[51],"we":[52,69,121],"propose":[53],"a":[54,71,78,123,159],"plug-and-play":[55],"SubGraph":[56,72,124],"Learning":[57],"(SGL)":[58],"method":[59],"reduce":[61,153],"without":[65],"compromising":[66],"performance.":[67,171],"Specifically,":[68],"introduce":[70],"Partition":[73],"Module":[74,127],"(SGPM),":[75],"leverages":[77],"set":[79],"learnable":[81],"vectors":[83],"select":[85],"node":[86,134],"groups":[87],"with":[88],"similar":[89],"features":[90,135],"from":[91,136],"graph,":[93],"effectively":[94],"partitioning":[95,103],"into":[98],"smaller":[99],"subgraphs.":[100,138],"Noting":[101],"that":[102,149],"may":[106],"lead":[107],"feature":[109],"redundancy,":[110],"as":[111],"overlapping":[112],"information":[113],"across":[114],"subgraphs":[115],"can":[116,151],"occur.":[117],"overcome":[119],"this,":[120],"design":[122],"Feature":[125],"Aggregation":[126],"(SGFAM),":[128],"mitigates":[130],"redundancy":[131],"by":[132],"averaging":[133],"different":[137],"Experiments":[139],"on":[140],"four":[141],"traffic":[142],"network":[143],"datasets":[144],"various":[146],"scales":[147],"demonstrate":[148],"SGL":[150],"significantly":[152],"overhead,":[155,166],"achieving":[156],"up":[157],"56.4\\%":[160],"reduction":[161],"average":[163],"GPU":[164],"while":[167],"maintaining":[168],"robust":[169],"prediction":[170],"The":[172],"source":[173],"code":[174],"available":[176],"at":[177],"https://github.com/wengwenchao123/SubGraph-Learning.":[178]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}