1. Constrained Relational Topic Models
- Author
-
Enza Messina, Silvia Terragni, Elisabetta Fersini, Terragni, S, Fersini, E, and Messina, E
- Subjects
Topic model ,Structure (mathematical logic) ,Information Systems and Management ,Information retrieval ,Computer science ,Document classification ,Constrained Relational Topic Model ,computer.software_genre ,Class (biology) ,Latent Dirichlet allocation ,Computer Science Applications ,Theoretical Computer Science ,symbols.namesake ,Artificial Intelligence ,Control and Systems Engineering ,Benchmark (surveying) ,Domain knowledge ,Semi-supervised model ,symbols ,Probability distribution ,Latent Dirichlet Allocation ,computer ,Software - Abstract
Relational topic models (RTM) have been widely used to discover hidden topics in a collection of networked documents. In this paper, we introduce the class of Constrained Relational Topic Models (CRTM), a semi-supervised extension of RTM that, apart from modeling the structure of the document network, explicitly models some available domain knowledge. We propose two instances of CRTM that incorporate prior knowledge in the form of document constraints. The models smooth the probability distribution of topics such that two constrained documents can either share the same topics or denote distinct themes. Experimental results on benchmark relational datasets show significant performances of CRTM on a semi-supervised document classification task.
- Published
- 2020
- Full Text
- View/download PDF