Robust Label Propagation on Multiple Networks
Authors:
- 12 December 2008
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 20 (1) , 35-44
Abstract
Transductive inference on graphs such as label propagation algorithms is receiving a lot of attention. In this paper, we address a label propagation problem on multiple networks and present a new algorithm that automatically integrates structure information brought in by multiple networks. The proposed method is robust in that irrelevant networks are automatically deemphasized, which is an advantage over Tsuda's approach (2005). We also show that the proposed algorithm can be interpreted as an expectation-maximization (EM) algorithm with a student-t prior. Finally, we demonstrate the usefulness of our method in protein function prediction and digit classification, and show analytically and experimentally that our algorithm is much more efficient than existing algorithms.Keywords
This publication has 10 references indexed in Scilit:
- Linear prediction models with graph regularization for web-page categorization2006
- Fast protein classification with multiple networksBioinformatics, 2005
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems2004
- A statistical framework for genomic data fusionBioinformatics, 2004
- Comparative assessment of large-scale data sets of protein–protein interactionsNature, 2002
- Products of Gaussians and Probabilistic Minor Component AnalysisNeural Computation, 2002
- The analysis of decomposition methods for support vector machinesIEEE Transactions on Neural Networks, 2000
- An overview of statistical learning theoryIEEE Transactions on Neural Networks, 1999
- A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants1998
- Maximum Likelihood from Incomplete Data Via the EM AlgorithmJournal of the Royal Statistical Society Series B: Statistical Methodology, 1977