TY - GEN
T1 - Topic modeling with network regularization
AU - Mei, Qiaozhu
AU - Cai, Deng
AU - Zhang, Duo
AU - Zhai, Cheng Xiang
PY - 2008
Y1 - 2008
N2 - In this paper, we formally define the problem of topic modeling with network structure (TMN). We propose a novel solution to this problem, which regularizes a statistical topic model with a harmonic regularizer based on a graph structure in the data. The proposed method combines topic modeling and social network analysis, and leverages the power of both statistical topic models and discrete regularization. The output of this model can summarize well topics in text, map a topic onto the network, and discover topical communities. With appropriate instantiations of the topic model and the graph-based regularizer, our model can be applied to a wide range of text mining problems such as author-topic analysis, community discovery, and spatial text mining. Empirical experiments on two data sets with different genres show that our approach is effective and outperforms both text-oriented methods and network-oriented methods alone. The proposed model is general; it can be applied to any text collections with a mixture of topics and an associated network structure.
AB - In this paper, we formally define the problem of topic modeling with network structure (TMN). We propose a novel solution to this problem, which regularizes a statistical topic model with a harmonic regularizer based on a graph structure in the data. The proposed method combines topic modeling and social network analysis, and leverages the power of both statistical topic models and discrete regularization. The output of this model can summarize well topics in text, map a topic onto the network, and discover topical communities. With appropriate instantiations of the topic model and the graph-based regularizer, our model can be applied to a wide range of text mining problems such as author-topic analysis, community discovery, and spatial text mining. Empirical experiments on two data sets with different genres show that our approach is effective and outperforms both text-oriented methods and network-oriented methods alone. The proposed model is general; it can be applied to any text collections with a mixture of topics and an associated network structure.
KW - Graph-based regularization
KW - Social networks
KW - Statistical topic models
UR - http://www.scopus.com/inward/record.url?scp=57349152312&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=57349152312&partnerID=8YFLogxK
U2 - 10.1145/1367497.1367512
DO - 10.1145/1367497.1367512
M3 - Conference contribution
AN - SCOPUS:57349152312
SN - 9781605580852
T3 - Proceeding of the 17th International Conference on World Wide Web 2008, WWW'08
SP - 101
EP - 110
BT - Proceeding of the 17th International Conference on World Wide Web 2008, WWW'08
T2 - 17th International Conference on World Wide Web 2008, WWW'08
Y2 - 21 April 2008 through 25 April 2008
ER -