Paper Info
Title
Finding Hidden Nodes by Checking for Missing Nodes against Past Social Networks
Abstract
One of the issues with using social networks for analysis is the problem of having missing nodes in the network. Having missing nodes can significantly impact the results of the analysis, and should be avoided as much as possible. For social network analysis to be more effective for criminal networks, where there are likely missing nodes, the number of missing nodes needs to be reduced. This research provides a method to help identifying hidden nodes in a network using previously collected social network data. In general the main idea is to take a social network and match the nodes of that network to the nodes of a previous social network, such that most of the overall structure of the social network is maintained. This mapping is completed by using various measures of the social network as distance measures. The outputted information will help investigators identify the importance of the missing nodes, and decide whether the missing nodes are significant enough to spend the time to uncover or not.
Year
DOI
Venue
2012
10.1109/NBiS.2012.57
NBiS
Keywords
Field
DocType
main idea,social network,missing node,hidden node,social network data,distance measure,likely missing node,criminal network,previous social network,missing nodes,past social networks,finding hidden nodes,social network analysis,graph theory,computer science,shape,tin,internet
Network science,Dynamic network analysis,Data mining,Computer science,Social network analysis,Evolving networks,Computer network,Hierarchical network model,Weighted network,Overlay network,Broadcast communication network
Conference
ISBN
Citations 
PageRank 
978-1-4673-2331-4
1
0.35
References 
Authors
8
7
Name
Order
Citations
PageRank
Alan Chia-Lung Chen141.05
Mohamad Elzohbi261.42
Ahmed Elhajj310.35
Konstantinos F. Xylogiannopoulos4187.74
Panagiotis Karampelas53415.16
Mick Ridley6717.56
Reda Alhajj71919205.67