Knowledge-Aware Bayesian Deep Topic Model
Abstract
We propose a Bayesian generative model for incorporating prior domain knowledge into hierarchical topic modeling.
Although embedded topic models (ETMs) and its variants have gained promising performance in text analysis, they mainly focus on mining word co-occurrence patterns, ignoring potentially easy-to-obtain prior topic hierarchies that could help enhance topic coherence.
While several knowledgebased topic models have recently been proposed, they are either only applicable to shallow hierarchies or sensitive to the quality of the provided prior knowledge.
To this end, we develop a novel deep ETM that jointly models the documents and the given prior knowledge by embedding the words and topics into the same space.
Guided by the provided domain knowledge, the proposed model tends to discover topic hierarchies that are organized into interpretable taxonomies.
Moreover, with a technique for adapting a given graph, our extended version allows the structure of the prior knowledge to be fine-tuned to match the target corpus.
Extensive experiments show that our proposed model efficiently integrates the prior knowledge and improves both hierarchical topic discovery and document representation.
Introduction
Topic models (TMs) such as latent Dirichlet allocation
(LDA) have enjoyed success in text mining and analysis in an unsupervised manner [4].
Typically, the goal of TMs is to infer per-document topic proportions and a set of latent topics from the target corpus using word co-occurrences within each document.
The extracted topics are widely used in various machine learning tasks [20, 19, 33, 39].
However, the objective function of most TMs is to maximize the likelihood of the observed data, which causes an over-concentration on high-frequency words.
Moreover, the infrequent words might be assigned to irrelevant topics due to the lack of side information.
Those two drawbacks could lead to human-unfriendly topics that fail to make sense to end users in practice.
This issue is further exacerbated in hierarchical cases where a large number of topics and their relevance need to be modeled [27, 12].
In many cases, users with prior domain knowledge are concerned with a specific topic structure, as shown in Fig.
Such a topic hierarchy provides semantic common sense among topics and words, which can guide high-quality topic discovery.
Therefore, several researches have attempted to exploit
[Figure]
various prior knowledge into topic modeling to improve topic representation.
For example, word correlation-based topic models [1, 30] use must-links and cannot-links to improve the interpretability of learned topics.
Word semantic methods [18, 11] allow users to predefine a set of seed words that could appear together in a certain topic to improve topic modeling.
Furthermore, knowledge graphbased topic models [17, 34] combine LDA with entity vectors to inject multi-relational knowledge, achieving better semantic coherence.
Although the above mentioned methods improve topic coherence in different ways, they only work with shallow topic models and ignore the relationships between topics
More recently, embedded topic models (ETMs) and their hierarchical variants [10, 38, 32, 12] employ distributed embedding vectors to encode semantic relationship, which have gained growing research interest due to their effectiveness and better flexibility.
Viewing words and topics as embeddings in a shared latent space makes it possible for ETMs to integrate prior knowledge in the forms of pretrained word embeddings or semantic regularities [10, 27, 13].
The main idea behind those models is to constrain the topic embeddings under the predefined topic structure.
Those models however are built on a strong assumption that the given topic hierarchy is well defined and matched to the target corpus, which is often unavailable in practice.
Such mismatched structure might hinder the learning process and lead to sub-optimal results.
To address the above shortcomings, in this paper, we first propose TopicKG, a knowledge graphguided deep ETM that views topics and words as nodes in the predefined topic tree.
As a Bayesian probabilistic model, TopicKG aims to model the document Bag-of-Word (BoW) vector and the given topic tree jointly by sharing the embedding vectors.
Specifically, we first adopt a deep document generation model to discover multi-layer document representations and topics.
To incorporate the human knowledge in the topic tree and guide the learning of topic hierarchy, a graph generative model is employed, which refines the node embeddings by exploring the belonging relations hidden in topic tree, resulting in more interpretable topics.
Besides, to address the mismatch between the given topic tree and target corpus, we further extend TopicKG to TopicKGA, which adopts the graph
A daptive technique to explore the missing links in topic tree from the target corpora, achieving better document representation.
The final revised topic tree is obtained by combining the prior structure of the given topic tree with the added structures learned from the current corpus.
Thus the topic tree in our TopicKGA has the ability to reinforce itself constantly according to the given corpus.
Finally, both the proposed models are based on variational autoencoders (VAEs) [21] and can be trained by maximizing the evidence lower bound (ELBO), enjoying promising flexibility and scalability.
The main contributions of this paper can be summarized as follows: 1) , A novel knowledge-aware deep ETM named TopicKG is proposed to incorporate prior domain knowledge into hierarchical topic modeling by accounting for the document and the given topic tree in a Bayesian generative framework.
2) , To overcome the drawback of the mismatch issue between the prior structure of the provided topic tree and the current corpus, TopicKG is further extended to TopicKGA, which allows to revise the prior structure to better represent the current corpus. 3) , Besides achieving promising performance on hierarchical topic discovery and document classification task, the proposed models give good flexibility and efficiency, providing a strong baseline for knowledge-based deep TMs.
Related Work
Embedded Topic Models:
The recent developed ETM is a new topic-modeling framework in embedding space.
Dieng et al.
[10] first proposed ETM with the goal of marrying traditional topic models with word embeddings.
In particular, ETM regards words and topics as continue embedding vectors and the topic’s distribution over words is calculated using the inner product of the topic’s embedding and each word’s embedding, which provides a natural way to incorporate word meanings into TMs.
In constrast to LDA, ETM employs the logistic-normal distribution to estimate the posterior of per-document topic proportion, making it is easier to reparameterization in the inference step.
All parameters in ETM are optimized by maximizing its evidence lower bound (ELBO).
To explore hierarchical document topical representations, ETM is extended to SawETM [12] with the gamma belief network [42].
SawETM designs the sawtooth connection (SC) to capture the relations between topics at two adjacent layers in the embedding space, resulting in more efficient algorithm for hierarchical topic mining.
Note that our proposed TopicKG is built upon SawETM, but different from
SawETM that only considers the BoW representation, which may fail to discover high quality topic hierarchies when a large of topics and their relations need to be modeled [27, 13], TopicKG introduces a novel Bayesian generative model where both document and the pre-specific domain knowledge are considered to integrate human knowledge into NTMs, resulting in a new knowledge-aware topic modeling framework.
Topic Models With Various Knowledge: Pre-trained language models such as BERT [9] and
GPT [6] have been successful in various natural language processing tasks.
Pre-trained on huge text, such models can serve as a powerful encoder that outputs contextual semantic embeddings.
Behind this idea, combining a TM with BERT via knowledge distillation [16] treats BERT as the teacher model to improve the representation of topic models.
CombinedTM [3] concatenates the
Bag-of-Word (BoW) vector with the BERT contextual embedding as the final input of a TM, and performs a consistent increase in topic coherence.
Despite their improvement, those BERT-based
TMs focus on the document latent representation, they ignore the relationship between words and topics.
Moreover they require a large amount of memory to load the pre-trained BERT.
On the other hand, incorporating knowledge graph ( e.g. , WordNet [28]) to improve existing NTMs becomes an interesting direction recently.
For example, [27] use the category tree (usually with simple and shallow structure) as the supervised information and preserve such relative hierarchical structure in the spherical embedding space.
to explore user interested topic structure.
[13] view words and topics as the Gaussian distributions and employ the asymmetrical Kullback–Leibler (KL) divergence to measure the directional similarity in the given topic hierarchy.
However, computing such KL divergence for each pair is time-consuming that limits its application to large-scale knowledge.
Moreover, those knowledge-based models ignore the mismatch problem between the given topic tree and the current corpus, leading to sub-optimal results in practice.
The Proposed Model
To incorporate human knowledge into deep TMs, we first propose TopicKG that generates the target corpus and the given topic tree in the Bayesian manner.
We further extend TopicKG to its adaptive version TopicKGA that allows the topic structure to be refined according to the current corpus, resulting in a better document representation.
Below we introduce the details of our proposed model.
3.1 Problem Formulation
Consider a corpus containing J documents with a vocabulary of V unique tokens.
Each document is represented by a BoW vector x ∈ R V + , where x v denotes the number of occurrences of the v th word.
Unlike other TMs that are purely data-driven, TopicKG intends to inject the knowledge graph to improve topic quality.
Specifically, we introduce a topic tree T as our prior knowledge, where each node e i ∈ T denotes a word or a topic.
For each topic node, there is a corresponding definition as shown in Fig.
Suppose there are L + 1 layers in the topic tree with the bottom word layer and L topic layers, and there are K l nodes T l : { e ( l ) 1 , ..., e ( l ) K l } at the l -th layer, where K 0 = V .
Generally, for the k -th topic node at the l -th layer e ( l ) k , we use S ( e ( l ) k ) to denote the set of its child nodes, and use C ( e ( l ) k ) to denote its key words extracted from the definition sentence.
Mathematically, we adopt the binary matrix S ( l ) ∈ { 0 , 1 } K l − 1 × K l and C ( l ) ∈ { 0 , 1 } V × K l , l = 1 , ..., L , to denote the belonging relations between two adjacent layers and the links between topics and their concept words, respectively.
Guided by this pre-specified topic tree, TopicKG expects to retrieve hierarchical topics from the target corpus that provide a clear taxonomy for the end users.
3.2 Knowledge-Aware Bayesian Deep Topic Model
Given the corpus D and topic tree T , we aim to discover hierarchical document representations and topic hierarchy by jointly modeling the BoW vector x , S ( l ) and C ( l ) , l = 1 , ...
L in a Bayesian framework.
Specifically, we employ the gamma belief network (GBN) of [40] to model the countvalue vector x
[Equation]
and use the semantic similarity between two node embeddings to generate the topic tree T .
The whole generative model with L layers can be expressed as:
[Equation]
where x j is generated as in Poisson factor analysis [41], in which x j is factorized as the product of the factor loading matrix (topics) Φ (1) ∈ R K 0 × K 1 + and the gamma distributed factor scores (topic proportions) θ (1) j ∈ R K 1 + under the Poisson likelihood; Then the GBN [42] is applied to explore multi-layer document representations by stacking hierarchical prior in the topic proportions θ j .
The topics at each layer Φ ( l ) , l = 1 , ..., L is calculated by the semantic similarity ( e.g. , the inner product) between corresponding topic embeddings, followed by a Softmax layer to satisfy the probability simplex:
(cid:80) K l − 1 k l − 1 =1 Φ ( l ) k l − 1 k = 1 .
e ( l ) k ∈ R
d is the embedding vector of k -th topic at l -th layer ( k -th node at l -th layer e lk in T ), d is the embedding dimension.
e (0) v is the embedding vector for v -th word in vocabulary.
σ ( · ) is the sigmoid function and Bern ( · ) denotes the Bernoulli distribution that is employed to model the two edge types S ( l ) and C ( l ) .
As suggested in [27] and [13], we use asymmetry to capture the directed relations in S ( l ) , while use symmetry to capture the semantic similarity between topics and their concept words.
W is a learnable parameter to guarantee the directed structure.
Under the Bernoulli likelihood, our TopicKG has the ability to incorporate the topic hierarchical relations in T into topic modeling by sharing word and topic embeddings with Φ .
In particular, for a node pair in T , the embedding semantics of the source and destination nodes need to be similar enough to determine whether there is an edge, which will guide the learning of Φ , resulting in more coherent topics and some appealing model properties as described below.
The Flexibility of Human Knowledge Incorporation: As mentioned above, guided by the predefined topic tree, TopicKG models x , S ( l ) and C ( l ) , l = 1 , ...
L jointly, making it possible for the learned hierarchical topics that not only satisfy the interpretable taxonomy structure but also prevent incoherent issues with the help of side information.
Besides, the incorporation of topic tree T is simple and flexible.
Firstly, as shown in Eq. 1 and Sec. 4, the plug-and-play module of S ( l ) and
C ( lk ) can be applied to most of ETMs without changing their model structures, which provides a convenient alternative for introducing side information to TMs.
Secondly, the pre-defined T can be constructed in various ways to encode our beliefs about the graph structure, e.g. , the knowledge graph, taxonomy, and hierarchical label tree [34, 17, 27].
The Relationship Between { Φ ( l ) } Ll =1 and { S ( l ) } Ll =1 : The topic distribution matrix Φ ( l ) and the symmetry matrix S ( l ) are related but play different roles.
The sparse structure matrix S ( l ) is constructed from the topic tree which will be used to guide the learning of the hierarchy of topics, while the learned topics Φ ( l ) contains more specific knowledge extracted from the text corpus, and can be viewed as the dense version of S ( l ) .
In other words, the topics learned from TopicKG retains the semantic structure of S ( l ) and enriches itself by the current corpora.
( ) 3 h ( ) 2 h ( ) 1 h ( ) 1 q ( ) 2 q ( ) 3 q ( )( )( )( ) T E ( ) T E
GCN
A E ada A
A ada A + A (0) E (0) E
A
A
GCN
[Figure]
3.3 Inference Network of TopicKG
The inference network of the proposed model is built around two main components: Weibull upwarddownward variational encoder and the GCN-based topic aggregation module.
The former aims to infer the topic proportions given the document, and the latter updates the node embedding by aggregating the neighbor information via the GCN layer.
Weibull Upward-Downward Variational Encoder:
To approximate the posterior of the topic proportions { θ ( l ) j } , like most of VAE-based methods, we define the variational distribution q ( θ j | x j ) , which can be further factorized as [31]:
[Equation]
In practice, it first obtains the latent feature by feeding the input x j into a residual upward neural networks: h ( l ) j = h ( l − 1) j + f
[Equation]
l ) W
[Equation]
l
[Equation]
h ( h
[Equation]
) , where l = 1 , ..., L , h (0)
j = x j , f ( l ) W ( l ) h ( · ) is a two layer fully connected network parameterized by W ( l ) h .
To complete the variational distribution, we adopt the Weibull downward stochastic path [37]:
[Equation]
where ⊕ denotes the concatenation at topic dimension, and we use the Softplus to make sure the positive Weibull shape and scale parameters.
f is a single layer fully connected network, correspondingly.
The Weibull distribution is chosen mainly because it is reparameterizable and the
KL divergence from the gamma to Weibull distributions has an analytic expression [37, 15].
GCN-Based Topic Aggregation: Attracted by the excellent ability of graph neural network (GCN) [22, 23] in propagating graph structure information, and the predefined topic tree can be viewed as a directed graph.
We thus construct a deterministic aggregating module for node embeddings with
GCN:
[Equation]
where T is the number of GCN layer, E (0)
∈ R
d × N is the node embedding matrix, and N = (cid:80)
Ll =
K l .
˜
A
= D − 12 AD − 12 is the normalized adjacent matrix with degree matrix D , e.g. , D ii = (cid:80) Nj =
A ij , A ∈ { 0 , 1 } N × N is the adjacent matrix of the topic tree T .
Unlike previous ETMs that view embeddings as independent learnable parameters, the GCN module in TopicKG updates the node embeddings by considering their child-level topics and related words, resulting in more meaningful topic embeddings.
We calculate { Φ ( l ) } Ll =1 via the updated node embeddings:
[Equation]
[Equation]
3.4 TopicKG With Adaptive Structure
One of the main assumptions in the previous section is that the pre-defined topic tree is helpful for the current corpus and the corresponding edges are highly reliable.
However, this is generally unrealistic in practical applications, as T may be (i) noisy, (ii) built on an ad hoc basis, (iii) not closely related to the topic discovering task [14, 8].
Consequently, we further propose TopicKGA that overcomes the above mismatching issue and revises the structure of the given topic tree based on the corpus at hand.
In detail, TopicKGA first randomly initializes a learnable node embedding dictionaries E A ∈ R d × N for all nodes in T .
Then an adaptive graph A ada is generated based on E A using the certain kernel function k :
[Equation]
Here, we choose the consine similarity to define our kernel function: k ( E A , E A ) =
E A E TA
||
E
A |||| E A
|| , and
Softmax function is used to normalize the adaptive matrix.
Note that, instead of generating A ada , we directly generate its normalized version to avoid unnecessary calculations [2].
During training, E A will be updated automatically to learn the hidden dependencies which are ignored by A .
Following [36], the final revised adjacency matrix is formed as (here we still use ˜ A to denote the revised graph for convenience):
[Equation]
which will enhance the GCN in Eq.
3 by replacing the adjacency matrix with the revised one.
Training
As a deep ETM, TopicKG intends to learn the latent document-topic distribution and the deterministic hierarchical topic embeddings.
Like other ETMs, the posterior of the topic proportions and topic embeddings are intractable to compute.
We thus derive an efficient algorithm for approximating the posterior with amortized variational inference [5], which makes the proposed model flexible for downstream task.
The resulting algorithm can either use pre-trained word embeddings, or train them from scratch.
The ELBO of the proposed model can be expressed as:
[Equation]
It consists of three main parts: the expected log-likelihood of x (first term), the concept structure log-likelihood (the two middle terms), and the KL divergence from prior p ( θ ( l ) j ) to q ( θ ( l ) j ) .
The graph weight β denotes the belief about the predefined topic tree.
Notably, the two middle terms distinguish the proposed models from previous deep ETMs.
On the one hand, it acts as a regularization that constrains the embedding vectors to conform to the provided prior structure, and on the other hand, it provides an alternative for ETM to introduce side information to improve its interpretability.
Annealed Training for TopicKGA:
In TopicKGA, the structure of the revised graph changes during the training.
To incorporate the new edges that are inferred from the target corpus, we develop an annealed training algorithm for TopicKGA.
Specifically, we update S ( l ) and C ( l ) in Eq.
7 every M iterations:
[Equation]
else
[Equation]
else
[Equation]
) where s is the threshold, and ˜ A ( l ) is the corresponding sub-block in ˜ A .
As E A becomes stable, the structure of the graph will converge to a good blueprint that balances the prior graph and the current corpus.
We summarize all training algorithm in Appendix.
Experiment
In this section, we conduct extensive experiments on several benchmark text datasets to evaluate the performance of the proposed models against other knowledge-based TMs, in terms of topic interpretability and document representations.
The code is available at https://github.com/wds2014/TopicKG.
5.1 Corpora
Our experiments are conducted on four widely used benchmark text datasets, varying in scale.
The datasets include 20 Newsgroups (20NG) [24], Reuters extracted from the Reuters-21578 dataset, R8, and Reuters Corpus Volume 2 (RCV2) [25].
R8 is a subset of Reuters that collected from 8 different classes.
For the multi-label RCV2 dataset, we follow previous works [29] in which documents with a single label at the second level topics are left, resulting in 0.1M documents totally.
Both R8 and
RCV2 are already pre-processed.
For other two datasets, we tokenize and clean text by excluding standard stop words and low-frequency words appearing less than 20 times [35].
The statistics of the preprocessed datasets are summarized in Appendix.
5.2 Baselines
To demonstrate the effectiveness of incorporating human knowledge into deep TMs, we consider several baselines for a fair comparison, including representative ETMs and recent knowledge-based topic models, described as follows: 1) , ETM [10], the first neural embedded topic model that assumes topics and words live in the same embedding space.
The topic distributions in ETM are calculated by the inner product of the word embedding matrix and the topic embedding. 2) , CombinedTM [3], a BERT-based neural topic model that uses the pre-trained BERT as its contextual encoder.
We use it as our BERT baseline. 3) , SawETM [12], a hierarchical ETM that employs the Poisson and gamma distributions to model the BoW vector and the latent representation, respectively. 4) ,
JoSH [27], a knowledge-based hierarchical topic mining method that uses category hierarchy as the side information and employs the EM algorithm to learn the spherical tree and text embedding. 5) ,
TopicNet [13], a semantic graph guided topic model that views the words and topics as the Gaussian distributions and uses the KL divergence to regularize the structure of the pre-defined tree.
For all baselines, we employ their official codes and default settings obtained from their release repositories.
5.3 External Knowledge
Since the learning of TopicKG involves a pre-defined topic tree, some generic knowledge graphs such as WordNet [28] provide a convenient way to bring in external knowledge.
WordNet is a large lexical database that groups semantically similar words into synonym sets, these sets are further linked by the hyponymy relation.
For example, in WordNet the category furniture includes bed, which in turn includes bunkbed.
With these relations, the topic structure can be easily defined according to certain heuristic rules.
Specifically, for each dataset we first get the word intersection of the vocabulary and
WordNet, the chosen words are then considered as leaf nodes of the topic hierarchy.
Afterwards, each leaf node can continuously find its ancestor nodes based on hyponymy relations and finally all leaf nodes converge to the same root node, resulting in an adaptive topic structure.
5.4 Settings
For all experiments, we set the embedding dimension as d = 50 , the knowledge confidence hyperparameter as β = 50 . 0 , the threshold as s = 0 . 4 .
Empirically, we find that the above settings work well for all datasets, we refer readers to the appendix for more detailed analysis.
We initialize the node embedding from the Gaussian distribution N (0 , 0 . 02) .
We set the batch size as 200 and use the
AdamW [26] optimizer with learning rate 0.01.
We generate a 7-layer topic hierarchy for each dataset with the method described in Sec. 5.3.
From the top to bottom, the number of topics at each layer are: 20NG: [1,2,11,66,185,277,270]; R8: [1,2,11,77,287,501,547]; RCV2: [1,2,11,68,263,469,562];
Reuters: [1,2,11,78,300,526,584].
For the single-layer methods (ETM and CombinedTM), we set the number of topics as the same of the first layer of deep models.
For all methods, we run the algorithms in comparison five times by modifying only the random seeds and calculate the mean and standard deviation.
All experiments are performed on an Nvidia RTX 3090-Ti GPU and our proposed models are implemented with PyTorch.
[Table]
5.5 Topic Interpretability
Generally, topic models are evaluated based on perplexity.
However, perplexity on the held-out test is not an appropriate measure of the topic quality and sometimes can even be contrary to human judgements [7, 34].
To this end, we instead adopt three common metrics, including Topic coherence ( TC ), Topic diversity ( TD ) and word embedding topic coherence ( WE ), to evaluate the learned topics from various aspects [10, 3].
TC measures the average Normalized Pointwise Mutual Information
(NPMI) over the top 10 words of each topic, and a higher score indicates more interpretable topics.
TD denotes the percentage of unique words in the top 25 words of the selected topics.
WE, as its name implies, provides an embedded measure of how similar the words in a topic are.
WE is calculated by the average pairwise cosine similarity of the word embeddings of the top-10 words in a topic.
We report the topic quality results at the first five layer in Fig.
We here focus on topic hierarchy and ignore the single layer methods.
We find that: 1) , Knowledge-based methods including JoSH,
CombinedTM, TopicNet and our proposed models are generally better than other likelihood-based
ETMs, which illustrates the benefit of incorporating side information; 2) , Our proposed TopicKG and
TopicKGA achieve higher performance than other knowledge-based models in most cases, especially on TC and WE tasks, which means our proposed model prefer to mine more coherent topics while achieving comparable TD.
We attribute this to the joint topic tree likelihood that provides an efficient alternative to integrate human knowledge into ETMs. 3) , Compared to TopicKG, its adaptive version
TopicKGA discovers better topics at higher layers.
It is not surprise that TopicKGA gives greater robustness and flexibility by refining the topic structure according to the current corpus.
[Figure]
5.6 Document Classification
Besides the topic quality evaluation, we also use document classification to compare the extrinsic predictive performance.
In detail, we collect the inferred topic proportions, e.g. , θ (1) , and than apply logistic regression to predict the document label.
We report the Micro F1 and Macro F1 score on 20NG, R8 and RCV2 datasets in Table.
Overall, the proposed models outperform the baselines on all corpora, which confirms the effectiveness of our innovation of combining human knowledge and ETMs in improving document latent representations.
Moreover, with the revised topic structure fine-tuned to the current corpus, TopicKGA surpasses other knowledge graph fixation methods with significant gaps.
This conclusion is consistent with one of our motivations that the predefined concept tree may not match the target corpus, leading to suboptimal document representations.
5.7 Qualitative Analysis
We visualize the learned topic hierarchies of TopicKG and TopicKGA on 20NG in Fig.
4(a-b), respectively.
Each topic box consists of the pre-specified concept name on the top bar and its keywords listed in the bottom content.
We can observe that 1) , The mined keywords are highly relevant to the corresponding topics, providing a clean description of their concepts.
2) , Guided by human knowledge, the connections between topics at two adjacent layers are highly interpretable, resulting in human-friendly topic taxonomies.
3) , More interestingly, to further verify the adaptive ability of our proposed TopicKGA, we manually added several free topics (dashed boxes in Fig. 4(b)) to each layer of the given topic tree, which can be viewed as the missing topics in the predefined knowledge and need to be learned from the target corpus.
We find that our TopicKGA indeed has the ability to capture the missing concepts, and revise the prior graph to match the current corpus.
5.8 Time Efficiency
To demonstrate the time efficiency of incorporating human knowledge into TMs, we run TopicKG, TopicKGA and
TopicNet (as they are implemented in PyTorch, JoSH is in
C) on RCV2 and 20NG dataset with a 7-layer topic tree.
Fig.
5 shows the Negative log-likelihood of documents x , which shows that the proposed models not only have faster learning speed than TopicNet, but also achieve better reconstruction performance on both small and large corpus.
This result illustrates the efficiency of the introduced graph likelihood which is important in real-time applications.
Conclusion
We develop an efficient Bayesian probabilistic model that integrates pre-specified domain knowledge into hierarchical ETMs.
The core idea is the joint document and topic tree modeling with the shared word and topic embeddings.
Besides, with the graph adaptive technique, TopicKGA has the ability to revise the given prior structure according to the target corpus, enjoying robustness and flexibility in practice.
Extensive experiments show that the proposed models outperform competitive methods in term of both topic quality and document classification task.
Moreover, thanks to the efficient knowledge incorporation algorithm, our proposed models achieve faster learning speed than other knowledge-base models.
Acknowledgements
This work was supported in part by the National Natural Science Foundation of China under Grant
U21B2006; in part by Shaanxi Youth Innovation Team Project; in part by the 111 Project under Grant
B18039; in part by the Fundamental Research Funds for the Central Universities QTZX22160.
[-The average length of R8 is 65.
-]
[-= 50 . 
-]