nips nips2003 nips2003-118 nips2003-118-reference knowledge-graph by maker-knowledge-mining

118 nips-2003-Link Prediction in Relational Data


Source: pdf

Author: Ben Taskar, Ming-fai Wong, Pieter Abbeel, Daphne Koller

Abstract: Many real-world domains are relational in nature, consisting of a set of objects related to each other in complex ways. This paper focuses on predicting the existence and the type of links between entities in such domains. We apply the relational Markov network framework of Taskar et al. to define a joint probabilistic model over the entire link graph — entity attributes and links. The application of the RMN algorithm to this task requires the definition of probabilistic patterns over subgraph structures. We apply this method to two new relational datasets, one involving university webpages, and the other a social network. We show that the collective classification approach of RMNs, and the introduction of subgraph patterns over link labels, provide significant improvements in accuracy over flat classification, which attempts to predict each link in isolation. 1


reference text

[1] L. Adamic, O. Buyukkokten, and E. Adar. A social network caught in the web. http://www.hpl.hp.com/shl/papers/social/, 2002.

[2] M. Craven, D. DiPasquo, D. Freitag, A. McCallum, T. Mitchell, K. Nigam, and S. Slattery. Learning to extract symbolic knowledge from the world wide web. In Proc. AAAI, 1998.

[3] S. Della Pietra, V. Della Pietra, and J. Lafferty. Inducing features of random fields. IEEE Trans. on Pattern Analysis and Machine Intelligence, 19(4):380–393, 1997.

[4] L. Egghe and R. Rousseau. Introduction to Informetrics. Elsevier, 1990.

[5] L. Getoor, N. Friedman, D. Koller, and B. Taskar. Probabilistic models of relational structure. In Proc. ICML, 2001.

[6] L. Getoor, E. Segal, B. Taskar, and D. Koller. Probabilistic models of text and link structure for hypertext classification. In IJCAI Workshop on Text Learning: Beyond Supervision, 2001.

[7] R. Ghani, S. Slattery, and Y. Yang. Hypertext categorization using hyperlink patterns and meta data. In Proc ICML, 2001.

[8] J. M. Kleinberg. Authoritative sources in a hyperlinked environment. JACM, 46(5):604–632, 1999.

[9] D. Koller and A. Pfeffer. Probabilistic frame-based systems. In Proc. AAAI98, pages 580–587, 1998.

[10] Nada Lavra˘ and Saso D˘ eroski. Inductive Logic Programming: Techniques and Applications. c z Ellis Horwood, 1994.

[11] J. Neville and D. Jensen. Iterative classification in relational data. In AAAI Workshop on Learning Statistical Models from Relational Data, 2000.

[12] L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford University, 1998.

[13] J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, 1988.

[14] B. Taskar, P. Abbeel, and D. Koller. Discriminative probabilistic models for relational data. In Proc. UAI, 2002.

[15] B. Taskar, E. Segal, and D. Koller. Probabilistic classification and clustering in relational data. In Proc. IJCAI, pages 870–876, 2001.

[16] S. Wasserman and P. Pattison. Logit models and logistic regression for social networks. Psychometrika, 61(3):401–425, 1996.

[17] J. Yedidia, W. Freeman, and Y. Weiss. Generalized belief propagation. In Proc. NIPS, 2000.