Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Jensen, D., Neville, J.: Linkage and autocorrelation cause feature selection bias in relational learning. In: 19th International Conference on Machine Learning, pp. 259–266. Morgan Kaufmann, San Francisco (2002)
Jensen, D., Neville, J., Gallagher, B.: Why collective inference improves relational classification. In: 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 593–598. ACM Press, New York (2004)
Taskar, B., Abbeel, B., Koller, D.: Discriminative probabilistic models for relational data. In: 18th Conference on Uncertainty in Artificial Intelligence, pp. 485–492. Morgan Kaufmann, San Francisco (2002)
Lafferty, J., McCallum, A., Pereira, F.: Conditional random fields: probabilistic models for segmenting and labeling sequence data. In: 18th International Conference on Machine Learning, pp. 282–289. Morgan Kaufmann, San Francisco (2001)
Taskar, B., Wong, M.F., Abbeel, P., Koller, D.: Link prediction in relational data. In: Neural Information Processing Systems 2003, pp. 659–666. The MIT Press, Cambridge (2004)
Segal, E., Wang, H., Koller, D.: Discovering molecular pathways from protein interaction and gene expression data. Bioinformatics 19(suppl. 1), i264–i272 ( (2003)
Bunescu, R.C., Mooney, R.J.: Relational Markov networks for collective information extraction. In: ICML-2004 Workshop on Statistical Relational Learning and its Connections to Other Fields, pp. 35–41. IMLS, Washington, DC (2004)
Liao, L., Fox, D., Kautz, H.: Location-based activity recognition using relational Markov networks. In: 19th International Joint Conference on Artificial Intelligence, pp. 773–778. Professional Book Center, Denver (2005)
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. PNAS 99(12), 7821–7826 (2002)
Besag, J.: Statistical analysis of non-lattice data. The Statistician 24(3), 179–195 (1975)
Neville, J., Jensen, D.: Collective classification with relational dependency networks. In: 2nd International Workshop on Multi-Relational Data Mining, pp. 77–91. ACM Press, New York (2003)
Domingos, P., Richardson, M.: Markov logic: a unifying framework for statistical relational learning. In: ICML-2004 Workshop on Statistical Relational Learning and its Connections to Other Fields, pp. 49–54. IMLS, Washington, DC (2004)
Fortunato, S.: Community detection in graphs. Physics Reports 486(3-5), 75–174 (2010)
Craven, M., DiPasquo, D., Freitag, D., McCallum, A., Mitchell, T., Nigam, K., Slattery, S.: Learning to extract symbolic knowledge from the World Wide Web. In: 15th National Conference on Artificial Intelligence, pp. 509–516. AAAI Press/The MIT Press, Menlo Park (1998)
Sen, P., Namata, G.M., Bilgic, M., Getoor, L., Gallagher, B., Eliassi-Rad, T.: Collective classification in network data. AI Magazine 29(3), 93–106 (2008)
Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. PNAS 105(4), 1118–1123 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wan, H., Lin, Y., Jia, C., Huang, H. (2011). Community-Based Relational Markov Networks in Complex Networks. In: Yao, J., Ramanna, S., Wang, G., Suraj, Z. (eds) Rough Sets and Knowledge Technology. RSKT 2011. Lecture Notes in Computer Science(), vol 6954. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24425-4_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-24425-4_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24424-7
Online ISBN: 978-3-642-24425-4
eBook Packages: Computer ScienceComputer Science (R0)