Loading…

Sub-Graph Learning for Spatiotemporal Forecasting via Knowledge Distillation

One of the challenges in studying the interactions in large graphs is to learn their diverse pattern and various interaction types. Hence, considering only one distribution and model to study all nodes and ignoring their diversity and local features in their neighborhoods, might severely affect the...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2022-11
Main Authors: Mehrabi, Mehrtash, Zhang, Yingxue
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Mehrabi, Mehrtash
Zhang, Yingxue
description One of the challenges in studying the interactions in large graphs is to learn their diverse pattern and various interaction types. Hence, considering only one distribution and model to study all nodes and ignoring their diversity and local features in their neighborhoods, might severely affect the overall performance. Based on the structural information of the nodes in the graph and the interactions between them, the main graph can be divided into multiple sub-graphs. This graph partitioning can tremendously affect the learning process, however the overall performance is highly dependent on the clustering method to avoid misleading the model. In this work, we present a new framework called KD-SGL to effectively learn the sub-graphs, where we define one global model to learn the overall structure of the graph and multiple local models for each sub-graph. We assess the performance of the proposed framework and evaluate it on public datasets. Based on the achieved results, it can improve the performance of the state-of-the-arts spatiotemporal models with comparable results compared to ensemble of models with less complexity.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2737601625</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2737601625</sourcerecordid><originalsourceid>FETCH-proquest_journals_27376016253</originalsourceid><addsrcrecordid>eNqNitEKgjAUQEcQJOU_DHoW5pbae2VBvtm7rJo2Wbvrbtbvp9AH9HTgnDMjERciTbYbzhck9r5njPG84FkmIlLVwzU5onQPWimJVtuOtoC0djJoCOrpAKWhJaC6SR-m_NaSni18jLp3iu71aI2Zbrsi81Yar-Ifl2RdHi67U-IQXoPyoelhQDumhheiyFma80z8d30Bbdw92A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2737601625</pqid></control><display><type>article</type><title>Sub-Graph Learning for Spatiotemporal Forecasting via Knowledge Distillation</title><source>Publicly Available Content Database</source><creator>Mehrabi, Mehrtash ; Zhang, Yingxue</creator><creatorcontrib>Mehrabi, Mehrtash ; Zhang, Yingxue</creatorcontrib><description>One of the challenges in studying the interactions in large graphs is to learn their diverse pattern and various interaction types. Hence, considering only one distribution and model to study all nodes and ignoring their diversity and local features in their neighborhoods, might severely affect the overall performance. Based on the structural information of the nodes in the graph and the interactions between them, the main graph can be divided into multiple sub-graphs. This graph partitioning can tremendously affect the learning process, however the overall performance is highly dependent on the clustering method to avoid misleading the model. In this work, we present a new framework called KD-SGL to effectively learn the sub-graphs, where we define one global model to learn the overall structure of the graph and multiple local models for each sub-graph. We assess the performance of the proposed framework and evaluate it on public datasets. Based on the achieved results, it can improve the performance of the state-of-the-arts spatiotemporal models with comparable results compared to ensemble of models with less complexity.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Clustering ; Distillation ; Graphs ; Machine learning ; Nodes ; Performance enhancement</subject><ispartof>arXiv.org, 2022-11</ispartof><rights>2022. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2737601625?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25751,37010,44588</link.rule.ids></links><search><creatorcontrib>Mehrabi, Mehrtash</creatorcontrib><creatorcontrib>Zhang, Yingxue</creatorcontrib><title>Sub-Graph Learning for Spatiotemporal Forecasting via Knowledge Distillation</title><title>arXiv.org</title><description>One of the challenges in studying the interactions in large graphs is to learn their diverse pattern and various interaction types. Hence, considering only one distribution and model to study all nodes and ignoring their diversity and local features in their neighborhoods, might severely affect the overall performance. Based on the structural information of the nodes in the graph and the interactions between them, the main graph can be divided into multiple sub-graphs. This graph partitioning can tremendously affect the learning process, however the overall performance is highly dependent on the clustering method to avoid misleading the model. In this work, we present a new framework called KD-SGL to effectively learn the sub-graphs, where we define one global model to learn the overall structure of the graph and multiple local models for each sub-graph. We assess the performance of the proposed framework and evaluate it on public datasets. Based on the achieved results, it can improve the performance of the state-of-the-arts spatiotemporal models with comparable results compared to ensemble of models with less complexity.</description><subject>Clustering</subject><subject>Distillation</subject><subject>Graphs</subject><subject>Machine learning</subject><subject>Nodes</subject><subject>Performance enhancement</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNitEKgjAUQEcQJOU_DHoW5pbae2VBvtm7rJo2Wbvrbtbvp9AH9HTgnDMjERciTbYbzhck9r5njPG84FkmIlLVwzU5onQPWimJVtuOtoC0djJoCOrpAKWhJaC6SR-m_NaSni18jLp3iu71aI2Zbrsi81Yar-Ifl2RdHi67U-IQXoPyoelhQDumhheiyFma80z8d30Bbdw92A</recordid><startdate>20221117</startdate><enddate>20221117</enddate><creator>Mehrabi, Mehrtash</creator><creator>Zhang, Yingxue</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20221117</creationdate><title>Sub-Graph Learning for Spatiotemporal Forecasting via Knowledge Distillation</title><author>Mehrabi, Mehrtash ; Zhang, Yingxue</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_27376016253</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Clustering</topic><topic>Distillation</topic><topic>Graphs</topic><topic>Machine learning</topic><topic>Nodes</topic><topic>Performance enhancement</topic><toplevel>online_resources</toplevel><creatorcontrib>Mehrabi, Mehrtash</creatorcontrib><creatorcontrib>Zhang, Yingxue</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mehrabi, Mehrtash</au><au>Zhang, Yingxue</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Sub-Graph Learning for Spatiotemporal Forecasting via Knowledge Distillation</atitle><jtitle>arXiv.org</jtitle><date>2022-11-17</date><risdate>2022</risdate><eissn>2331-8422</eissn><abstract>One of the challenges in studying the interactions in large graphs is to learn their diverse pattern and various interaction types. Hence, considering only one distribution and model to study all nodes and ignoring their diversity and local features in their neighborhoods, might severely affect the overall performance. Based on the structural information of the nodes in the graph and the interactions between them, the main graph can be divided into multiple sub-graphs. This graph partitioning can tremendously affect the learning process, however the overall performance is highly dependent on the clustering method to avoid misleading the model. In this work, we present a new framework called KD-SGL to effectively learn the sub-graphs, where we define one global model to learn the overall structure of the graph and multiple local models for each sub-graph. We assess the performance of the proposed framework and evaluate it on public datasets. Based on the achieved results, it can improve the performance of the state-of-the-arts spatiotemporal models with comparable results compared to ensemble of models with less complexity.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2022-11
issn 2331-8422
language eng
recordid cdi_proquest_journals_2737601625
source Publicly Available Content Database
subjects Clustering
Distillation
Graphs
Machine learning
Nodes
Performance enhancement
title Sub-Graph Learning for Spatiotemporal Forecasting via Knowledge Distillation
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T11%3A48%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Sub-Graph%20Learning%20for%20Spatiotemporal%20Forecasting%20via%20Knowledge%20Distillation&rft.jtitle=arXiv.org&rft.au=Mehrabi,%20Mehrtash&rft.date=2022-11-17&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2737601625%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_27376016253%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2737601625&rft_id=info:pmid/&rfr_iscdi=true