Higher-Order Markov Tag-Topic Models for Tagged Documents and Images

09/25/2011
by   Jia Zeng, et al.
0

This paper studies the topic modeling problem of tagged documents and images. Higher-order relations among tagged documents and images are major and ubiquitous characteristics, and play positive roles in extracting reliable and interpretable topics. In this paper, we propose the tag-topic models (TTM) to depict such higher-order topic structural dependencies within the Markov random field (MRF) framework. First, we use the novel factor graph representation of latent Dirichlet allocation (LDA)-based topic models from the MRF perspective, and present an efficient loopy belief propagation (BP) algorithm for approximate inference and parameter estimation. Second, we propose the factor hypergraph representation of TTM, and focus on both pairwise and higher-order relation modeling among tagged documents and images. Efficient loopy BP algorithm is developed to learn TTM, which encourages the topic labeling smoothness among tagged documents and images. Extensive experimental results confirm the incorporation of higher-order relations to be effective in enhancing the overall topic modeling performance, when compared with current state-of-the-art topic models, in many text and image mining tasks of broad interests such as word and link prediction, document classification, and tag recommendation.

READ FULL TEXT

page 2

page 7

research
07/08/2019

Topic Modeling in Embedding Spaces

Topic modeling analyzes documents to learn meaningful patterns of words....
research
07/30/2015

Tag-Weighted Topic Model For Large-scale Semi-Structured Documents

To date, there have been massive Semi-Structured Documents (SSDs) during...
research
10/30/2021

Higher-Order Relations Skew Link Prediction in Graphs

The problem of link prediction is of active interest. The main approach ...
research
02/19/2018

Learning Hidden Markov Models from Pairwise Co-occurrences with Applications to Topic Modeling

We present a new algorithm for identifying the transition and emission p...
research
11/15/2016

Anchor-Free Correlated Topic Modeling: Identifiability and Algorithm

In topic modeling, many algorithms that guarantee identifiability of the...
research
08/13/2013

When are Overcomplete Topic Models Identifiable? Uniqueness of Tensor Tucker Decompositions with Structured Sparsity

Overcomplete latent representations have been very popular for unsupervi...
research
08/01/2016

Labeling Topics with Images using Neural Networks

Topics generated by topic models are usually represented by lists of t t...

Please sign up or login with your details

Forgot password? Click here to reset