A Parameterized Probabilistic Model of Network Evolution for Supervised Link Prediction
Authors:
- 1 December 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE International Conference on Data Mining (ICDM)
- No. 15504786,p. 340-349
Abstract
We introduce a new approach to the problem of link prediction for network structured domains, such as the Web, social networks, and biological networks. Our approach is based on the topological features of network structures, not on the node features. We present a novel parameterized probabilistic model of network evolution and derive an efficient incremental learning algorithm for such models, which is then used to predict links among the nodes. We show some promising experimental results using biological network data sets.Keywords
This publication has 19 references indexed in Scilit:
- Prediction and ranking algorithms for event-based network dataACM SIGKDD Explorations Newsletter, 2005
- Learning kernels from biological networks by maximizing entropyBioinformatics, 2004
- The KEGG resource for deciphering the genomeNucleic Acids Research, 2004
- The Structure and Function of Complex NetworksSIAM Review, 2003
- Stochastic models for the Web graph2002
- Comparative assessment of large-scale data sets of protein–protein interactionsNature, 2002
- Clustering and preferential attachment in growing networksPhysical Review E, 2001
- Text Classification from Labeled and Unlabeled Documents using EMMachine Learning, 2000
- The Web as a Graph: Measurements, Models, and Methods1999
- A New Status Index Derived from Sociometric AnalysisPsychometrika, 1953