Enhancing Graph Variational Autoencoder for Short Text Topic Modeling with Mutual Information Maximization

Yuhang Ge, Xuegang Hu
{"title":"Enhancing Graph Variational Autoencoder for Short Text Topic Modeling with Mutual Information Maximization","authors":"Yuhang Ge, Xuegang Hu","doi":"10.1109/ICKG55886.2022.00016","DOIUrl":null,"url":null,"abstract":"Neural topic models can successfully capture thematic patterns of the document with black-box variational inference, but they still suffer from sparsity problem when facing short texts with limited contextual information. To alleviate the sparsity problem, some graph-based methods have been proposed to explicitly model the word co-occurrence patterns. However, they ignore sequential information and word relevance degree in the document, resulting in inaccurate topic representations. Therefore, we propose a novel graph-based neural topic model, namely mutual Information enhanced Graph Topic Model (InfoGTM), which leverages the sequential information and takes into account the word relevance degree into topic modeling using a more accurate semantic graph. More specifically, instead of pre-computing statistical word co-occurrence, we develop an automatic way to dynamically construct semantic graph with a multi-head attention mechanism, which integrates both contextual and words structure information into the semantic graph, thereby providing more accurate word co-occurrence information. After that, a graph variational auto-encoder topic modeling framework is adopted to generate topic proportions for each short text. To further enhance the topic representation, we maximize the mutual information between input words and topic representations to ensure more semantic information could be compressed. Besides, mutual information maximization could preserve the smooth manifold structure of short texts, which enables the spread the similar topic representation from neighboring short texts. Substantial experiments are conducted on several benchmark data sets that verify the superiority of our method compared to the state-of-the-arts regard to the topic coherence performance.","PeriodicalId":278067,"journal":{"name":"2022 IEEE International Conference on Knowledge Graph (ICKG)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Knowledge Graph (ICKG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICKG55886.2022.00016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Neural topic models can successfully capture thematic patterns of the document with black-box variational inference, but they still suffer from sparsity problem when facing short texts with limited contextual information. To alleviate the sparsity problem, some graph-based methods have been proposed to explicitly model the word co-occurrence patterns. However, they ignore sequential information and word relevance degree in the document, resulting in inaccurate topic representations. Therefore, we propose a novel graph-based neural topic model, namely mutual Information enhanced Graph Topic Model (InfoGTM), which leverages the sequential information and takes into account the word relevance degree into topic modeling using a more accurate semantic graph. More specifically, instead of pre-computing statistical word co-occurrence, we develop an automatic way to dynamically construct semantic graph with a multi-head attention mechanism, which integrates both contextual and words structure information into the semantic graph, thereby providing more accurate word co-occurrence information. After that, a graph variational auto-encoder topic modeling framework is adopted to generate topic proportions for each short text. To further enhance the topic representation, we maximize the mutual information between input words and topic representations to ensure more semantic information could be compressed. Besides, mutual information maximization could preserve the smooth manifold structure of short texts, which enables the spread the similar topic representation from neighboring short texts. Substantial experiments are conducted on several benchmark data sets that verify the superiority of our method compared to the state-of-the-arts regard to the topic coherence performance.
基于互信息最大化的图变分自编码器的短文本主题建模
神经主题模型可以通过黑盒变分推理成功地捕获文档的主题模式,但在面对上下文信息有限的短文本时仍然存在稀疏性问题。为了缓解稀疏性问题,人们提出了一些基于图的方法来显式地对词共现模式建模。然而,它们忽略了文档中的顺序信息和单词关联度,导致主题表示不准确。因此,我们提出了一种新的基于图的神经主题模型,即互信息增强图主题模型(InfoGTM),该模型利用序列信息,并使用更精确的语义图将词的关联度考虑到主题建模中。更具体地说,我们开发了一种基于多头注意机制的自动动态构建语义图的方法,而不是预先计算统计词共现,将上下文信息和词结构信息集成到语义图中,从而提供更准确的词共现信息。然后,采用图变分自编码器主题建模框架,生成每个短文本的主题比例。为了进一步增强主题表示,我们最大化了输入词和主题表示之间的互信息,以确保可以压缩更多的语义信息。此外,互信息最大化可以保持短文本流畅的流形结构,从而使相邻短文本的相似主题表示得以传播。在几个基准数据集上进行了大量实验,验证了我们的方法与最先进的主题相干性能相比的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信