語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Link prediction in social networks =...
~
Mitra, Pabitra.
Link prediction in social networks = role of power law distribution /
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
正題名/作者:
Link prediction in social networks/ by Virinchi Srinivas, Pabitra Mitra.
其他題名:
role of power law distribution /
作者:
Srinivas, Virinchi.
其他作者:
Mitra, Pabitra.
出版者:
Cham :Springer International Publishing : : 2016.,
面頁冊數:
ix, 67 p. :ill., digital ; : 24 cm.;
Contained By:
Springer eBooks
標題:
Data mining. -
電子資源:
http://dx.doi.org/10.1007/978-3-319-28922-9
ISBN:
9783319289229
Link prediction in social networks = role of power law distribution /
Srinivas, Virinchi.
Link prediction in social networks
role of power law distribution /[electronic resource] :by Virinchi Srinivas, Pabitra Mitra. - Cham :Springer International Publishing :2016. - ix, 67 p. :ill., digital ;24 cm. - SpringerBriefs in computer science,2191-5768. - SpringerBriefs in computer science..
Introduction -- Link Prediction Using Degree Thresholding -- Locally Adaptive Link Prediction -- Two Phase Framework for Link Prediction -- Applications of Link Prediction -- Conclusion.
This work presents link prediction similarity measures for social networks that exploit the degree distribution of the networks. In the context of link prediction in dense networks, the text proposes similarity measures based on Markov inequality degree thresholding (MIDTs), which only consider nodes whose degree is above a threshold for a possible link. Also presented are similarity measures based on cliques (CNC, AAC, RAC), which assign extra weight between nodes sharing a greater number of cliques. Additionally, a locally adaptive (LA) similarity measure is proposed that assigns different weights to common nodes based on the degree distribution of the local neighborhood and the degree distribution of the network. In the context of link prediction in dense networks, the text introduces a novel two-phase framework that adds edges to the sparse graph to forma boost graph.
ISBN: 9783319289229
Standard No.: 10.1007/978-3-319-28922-9doiSubjects--Topical Terms:
528622
Data mining.
LC Class. No.: QA76.9.D343
Dewey Class. No.: 006.312
Link prediction in social networks = role of power law distribution /
LDR
:02125nam a2200337 a 4500
001
861919
003
DE-He213
005
20160817133058.0
006
m d
007
cr nn 008maaau
008
170720s2016 gw s 0 eng d
020
$a
9783319289229
$q
(electronic bk.)
020
$a
9783319289212
$q
(paper)
024
7
$a
10.1007/978-3-319-28922-9
$2
doi
035
$a
978-3-319-28922-9
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA76.9.D343
072
7
$a
UNF
$2
bicssc
072
7
$a
UYQE
$2
bicssc
072
7
$a
COM021030
$2
bisacsh
082
0 4
$a
006.312
$2
23
090
$a
QA76.9.D343
$b
S774 2016
100
1
$a
Srinivas, Virinchi.
$3
1104657
245
1 0
$a
Link prediction in social networks
$h
[electronic resource] :
$b
role of power law distribution /
$c
by Virinchi Srinivas, Pabitra Mitra.
260
$a
Cham :
$c
2016.
$b
Springer International Publishing :
$b
Imprint: Springer,
300
$a
ix, 67 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
SpringerBriefs in computer science,
$x
2191-5768
505
0
$a
Introduction -- Link Prediction Using Degree Thresholding -- Locally Adaptive Link Prediction -- Two Phase Framework for Link Prediction -- Applications of Link Prediction -- Conclusion.
520
$a
This work presents link prediction similarity measures for social networks that exploit the degree distribution of the networks. In the context of link prediction in dense networks, the text proposes similarity measures based on Markov inequality degree thresholding (MIDTs), which only consider nodes whose degree is above a threshold for a possible link. Also presented are similarity measures based on cliques (CNC, AAC, RAC), which assign extra weight between nodes sharing a greater number of cliques. Additionally, a locally adaptive (LA) similarity measure is proposed that assigns different weights to common nodes based on the degree distribution of the local neighborhood and the degree distribution of the network. In the context of link prediction in dense networks, the text introduces a novel two-phase framework that adds edges to the sparse graph to forma boost graph.
650
0
$a
Data mining.
$3
528622
650
0
$a
Online social networks.
$3
565357
650
1 4
$a
Computer Science.
$3
593922
650
2 4
$a
Data Mining and Knowledge Discovery.
$3
677765
650
2 4
$a
Computer Communication Networks.
$3
669310
700
1
$a
Mitra, Pabitra.
$3
1104658
710
2
$a
SpringerLink (Online service)
$3
593884
773
0
$t
Springer eBooks
830
0
$a
SpringerBriefs in computer science.
$3
883114
856
4 0
$u
http://dx.doi.org/10.1007/978-3-319-28922-9
950
$a
Computer Science (Springer-11645)
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入