Efficient semi-supervised learning on locally informative multiple graphs
作者:
Highlights:
•
摘要
We address an issue of semi-supervised learning on multiple graphs, over which informative subgraphs are distributed. One application under this setting can be found in molecular biology, where different types of gene networks are generated depending upon experiments. Here an important problem is to annotate unknown genes by using functionally known genes, which connect to unknown genes in gene networks, in which informative parts vary over networks. We present a powerful, time-efficient approach for this problem by combining soft spectral clustering with label propagation for multiple graphs. We demonstrate the effectiveness and efficiency of our approach using both synthetic and real biological datasets.
论文关键词:Semi-supervised learning,Graph integration,Label propagation,Soft spectral clustering,EM (Expectation Maximization) algorithm
论文评审过程:Received 28 October 2010, Revised 11 July 2011, Accepted 16 August 2011, Available online 27 August 2011.
论文官网地址:https://doi.org/10.1016/j.patcog.2011.08.020