Streaming Network Embedding with Memory Refreshing
碩士 === 國立臺灣大學 === 電機工程學研究所 === 107 === Static network embedding has been widely studied to convert the sparse structure information to a dense latent space for various applications. However, real networks are continuously evolving, and deriving the whole embedding for every snapshot is computational...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2019
|
Online Access: | http://ndltd.ncl.edu.tw/handle/4hh7ps |
id |
ndltd-TW-107NTU05442079 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-107NTU054420792019-11-21T05:34:26Z http://ndltd.ncl.edu.tw/handle/4hh7ps Streaming Network Embedding with Memory Refreshing 基於記憶更新機制的串流網路嵌入學習 Hsi-Wen Chen 陳璽文 碩士 國立臺灣大學 電機工程學研究所 107 Static network embedding has been widely studied to convert the sparse structure information to a dense latent space for various applications. However, real networks are continuously evolving, and deriving the whole embedding for every snapshot is computationally intensive. In this paper, therefore, we explore streaming network embedding to 1) efficiently identify the nodes required to update the embeddings under multi-type network changes and 2) carefully revise the embeddings to maintain transduction over different parts of the network. Specifically, we propose a new representation learning framework, named Graph Memory Refreshing (GMR), to preserve both structural information and embedding consistency for streaming network embedding. We prove that GMR is more consistent than other state-of-the-art methods. Experimental results manifest that GMR outperforms the baselines in both the accuracy and the running time. Sheng-De Wang De-Nian Yang 王勝德 楊得年 2019 學位論文 ; thesis 50 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺灣大學 === 電機工程學研究所 === 107 === Static network embedding has been widely studied to convert the sparse structure information to a dense latent space for various applications. However, real networks are continuously evolving, and deriving the whole embedding for every snapshot is computationally intensive. In this paper, therefore, we explore streaming network embedding to 1) efficiently identify the nodes required to update the embeddings under multi-type network changes and 2) carefully revise the embeddings to maintain transduction over different parts of the network. Specifically, we propose a new representation learning framework, named Graph Memory Refreshing (GMR), to preserve both structural information and embedding consistency for streaming network embedding. We prove that GMR is more consistent than other state-of-the-art methods. Experimental results manifest that GMR outperforms the baselines in both the accuracy and the running time.
|
author2 |
Sheng-De Wang |
author_facet |
Sheng-De Wang Hsi-Wen Chen 陳璽文 |
author |
Hsi-Wen Chen 陳璽文 |
spellingShingle |
Hsi-Wen Chen 陳璽文 Streaming Network Embedding with Memory Refreshing |
author_sort |
Hsi-Wen Chen |
title |
Streaming Network Embedding with Memory Refreshing |
title_short |
Streaming Network Embedding with Memory Refreshing |
title_full |
Streaming Network Embedding with Memory Refreshing |
title_fullStr |
Streaming Network Embedding with Memory Refreshing |
title_full_unstemmed |
Streaming Network Embedding with Memory Refreshing |
title_sort |
streaming network embedding with memory refreshing |
publishDate |
2019 |
url |
http://ndltd.ncl.edu.tw/handle/4hh7ps |
work_keys_str_mv |
AT hsiwenchen streamingnetworkembeddingwithmemoryrefreshing AT chénxǐwén streamingnetworkembeddingwithmemoryrefreshing AT hsiwenchen jīyújìyìgèngxīnjīzhìdechuànliúwǎnglùqiànrùxuéxí AT chénxǐwén jīyújìyìgèngxīnjīzhìdechuànliúwǎnglùqiànrùxuéxí |
_version_ |
1719294534302564352 |