Relational Markov networks (RMNs) are a joint probabilistic model for an entire collection of related entities. The model is able to mine relational data effectively by integrating information from content attributes of individual entities as well as the links among them, yet the prediction accuracy is greatly affected by the definition of the relational clique templates. Maximum likelihood estimation (MLE) is used to estimate the model parameters, but this can be quite costly because multiple rounds of approximate inference are required over the entire dataset. In this paper, we propose constructing RMNs basing on the community structures of complex networks, and present a discriminative maximum pseudolikelihood estimation (DMPLE) approach for training RMNs. Experiments on the collective classification and link prediction tasks on some real-world datasets show that our approaches perform well in terms of accuracy and efficiency. © 2011 Springer-Verlag.
CITATION STYLE
Wan, H., Lin, Y., Jia, C., & Huang, H. (2011). Community-based relational Markov networks in complex networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6954 LNAI, pp. 301–310). https://doi.org/10.1007/978-3-642-24425-4_40
Mendeley helps you to discover research relevant for your work.