中文摘要：

针对当前主流的基于网络拓扑结构的链路预测算法普遍存在召回率较低的问题，研究发现一些算法输出的结果中部分正确结果具有互补性，据此采用基于Boosting的集成学习方法对其进行改进。按照网络中节点之间是否存在链接关系，将链路预测问题定义为二分类问题，进一步遵循算法互补的原则选择若干具有代表性的链路预测算法作为弱分类器，基于AdaBoost算法提出并实现了一个新型链路预测算法。在arXiv论文合作网络和电子邮件网络等真实数据集上的实验结果表明，该算法的准确率以及召回率表现均显著优于当前的主流算法。

英文摘要：

The mainstream of current link prediction algorithm based on network topology structure generally have the problem of low efficiency of recalls. Study found that the correct results from some of the link prediction algorithms are complementary, accordingly, the Boosting method was considered to improve it. According to whether there is a link re-lationship between the nodes, the problem was divided into two categories, thus the link prediction algorithm as a two classification problem was defined. Furthermore, the algorithm complementary principle to select a number of represent-ative link prediction algorithms as weak classifiers was followed, and a novel link prediction algorithm based on the AdaBoost algorithm was come up. The experimental results on the data from real dataset like the arXiv paper cooperation network and E-mail network show that, the novel algorithm has a better accuracy than the current mainstream algorithms.