{"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.