發(fā)布時(shí)間：2018-06-19 05:34

  本文選題：社會(huì)網(wǎng)絡(luò) + 鏈接預(yù)測(cè)　； 參考：《中國(guó)科技論文》2013年07期

【摘要】：針對(duì)社會(huì)網(wǎng)絡(luò)中節(jié)點(diǎn)關(guān)系預(yù)測(cè)困難的問(wèn)題,提出了一種新的鏈接預(yù)測(cè)算法:鄰居關(guān)系權(quán)值算法。該算法將共同鄰居節(jié)點(diǎn)與其他鄰居節(jié)點(diǎn)之間的邊賦予不同的權(quán)值,進(jìn)而計(jì)算被預(yù)測(cè)節(jié)點(diǎn)之間的相似性。算法通過(guò)5個(gè)社會(huì)網(wǎng)絡(luò)數(shù)據(jù)集進(jìn)行實(shí)驗(yàn),采用AUC(area under the receiver operating characteristic curve)指標(biāo)和Precision指標(biāo)評(píng)價(jià)其效果。實(shí)驗(yàn)表明新算法的預(yù)測(cè)準(zhǔn)確率整體上高于已有的基于節(jié)點(diǎn)相似性的鏈接預(yù)測(cè)算法,同時(shí)該算法保持了較低的時(shí)間復(fù)雜度。
[Abstract]:A new link prediction algorithm is proposed to solve the problem of node relationship prediction in social networks . A new link prediction algorithm is proposed , which gives different weights to the edges between the common neighbor nodes and other neighbor nodes , and then calculates the similarity between the predicted nodes . The algorithm uses the area under the receiver operating characteristic curve index and the Precision index to evaluate its effect . The experiment shows that the prediction accuracy of the new algorithm is higher than that of the existing link prediction algorithm based on node similarity , and the algorithm keeps the lower time complexity .
【作者單位】： 哈爾濱工程大學(xué)計(jì)算機(jī)科學(xué)與技術(shù)學(xué)院;
【基金】：高等學(xué)校博士學(xué)科點(diǎn)專項(xiàng)科研基金資助項(xiàng)目(20112304110011) 國(guó)家自然科學(xué)基金資助項(xiàng)目(61073041,61073043)
【分類號(hào)】：TP393.0

【參考文獻(xiàn)】

相關(guān)期刊論文 前3條

1 呂琳媛;;復(fù)雜網(wǎng)絡(luò)鏈路預(yù)測(cè)[J];電子科技大學(xué)學(xué)報(bào);2010年05期

2 東昱曉;柯慶;吳斌;;基于節(jié)點(diǎn)相似性的鏈接預(yù)測(cè)[J];計(jì)算機(jī)科學(xué);2011年07期

3 楊s，

本文編號(hào)：2038693