|
Volumn , Issue , 2011, Pages 123-128
|
Understanding graph sampling algorithms for social network analysis
a b c b a d a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
CLUSTERING COEFFICIENT;
DATA SETS;
DIRECTED GRAPHS;
GRAPH PROPERTIES;
NODE DEGREE DISTRIBUTION;
REPRESENTATIVE SAMPLE;
SAMPLING ALGORITHM;
SAMPLING RESULTS;
SOCIAL GRAPHS;
SOCIAL NETWORK ANALYSIS;
SOCIAL NETWORKS;
ARTS COMPUTING;
DATA PROCESSING;
DISTRIBUTED COMPUTER SYSTEMS;
ELECTRIC NETWORK ANALYSIS;
LEARNING ALGORITHMS;
SOCIAL SCIENCES COMPUTING;
GRAPH THEORY;
|
EID: 80052424453
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/ICDCSW.2011.34 Document Type: Conference Paper |
Times cited : (91)
|
References (17)
|