TEAGS:时间感知的子图文本嵌入方法
TEAGS: Time-aware Text Embedding Approach to Generate Subgraphs
摘要:
传染(例如病毒、流言)在传播图中的节点上传播。我们可以使用节点的时间和文本数据来计算边权重,然后生成具有高度相关节点的子图。这对许多应用都是有益的。然而,挑战也很多。首先,每对节点之间的传播模式可能随时间而改变。其次,传染的方式并不总是相同的。因此,包括主题建模在内的现有文本挖掘方法不能有效地计算边权重。第三,由于传播受时间的影响,词-词共现模式可能在不同的时间维度上不同,这会降低词嵌入方法的有效性。我们认为,应该考虑多方面的时间维度(小时,天等),以更好地计算节点之间的相关性权重。在这项工作中,我们设计了一个新的框架,一方面,集成了基于神经网络的时间感知词嵌入组件,通过多个时间方面来构建词向量,另一方面,使用时间生成模型来计算权重。随后,我们提出了一个最大堆图切割算法来生成子图。我们通过对真实世界数据集的全面实验来验证我们的模型。实验结果表明,该模型能更有效地检索子图,并且在词嵌入和传播过程中都应注意时间动态性。
英文摘要:
Contagions (e.g. virus, gossip) spread over the nodes in propagation graphs. We can use the temporal and textual data of the nodes to compute the edge weights and then generate subgraphs with highly relevant nodes. This is beneficial to many applications. Yet, challenges abound. First, the propagation pattern between each pair of nodes may change by time. Second, not always the same contagion propagates. Hence, the state-of-the-art text mining approaches including topic-modeling cannot effectively compute the edge weights. Third, since the propagation is affected by time, the word-word co-occurrence patterns may differ in various temporal dimensions, that can decrease the effectiveness of word embedding approaches. We argue that multi-aspect temporal dimensions (hour, day, etc) should be considered to better calculate the correlation weights between the nodes. In this work, we devise a novel framework that on the one hand, integrates a neural network based time-aware word embedding component to construct the word vectors through multiple temporal facets, and on the other hand, uses a temporal generative model to compute the weights. Subsequently, we propose a Max-Heap Graph cutting algorithm to generate subgraphs. We validate our model through comprehensive experiments on real-world datasets. The results show that our model can retrieve the subgraphs more effective than other rivals and the temporal dynamics should be noticed both in word embedding and propagation processes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。