DocumentCode
576849
Title
Finding Hidden Nodes by Checking for Missing Nodes against Past Social Networks
Author
Chen, Alan Chia-Lung ; Elzohbi, Mohamad ; Elhajj, Ahmed ; Xylogiannopoulos, Konstantinos F. ; Karampelas, Panagiotis ; Ridley, Mick ; Alhajj, Reda
Author_Institution
Dept. of Comput. Sci., Univ. of Calgary, Calgary, AB, Canada
fYear
2012
fDate
26-28 Sept. 2012
Firstpage
239
Lastpage
246
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.
Keywords
Internet; social networking (online); criminal networks; distance measurement; hidden nodes; missing nodes; social networks; Computer science; Current measurement; Educational institutions; Graph theory; Shape; Social network services; Tin;
fLanguage
English
Publisher
ieee
Conference_Titel
Network-Based Information Systems (NBiS), 2012 15th International Conference on
Conference_Location
Melbourne, VIC
Print_ISBN
978-1-4673-2331-4
Type
conf
DOI
10.1109/NBiS.2012.57
Filename
6354833
Link To Document