Using an edge-dual graph and k-connectivity to identify strong connections in social networks

Authors:
Li Ding;Brandon Dixon
Affiliations:
The University of Alabama, Tuscaloosa, AL;The University of Alabama, Tuscaloosa, AL
Venue:
Proceedings of the 46th Annual Southeast Regional Conference on XX
Year:
2008

Citing 6
Cited 1

Introduction to algorithms

Introduction to algorithms
The Virtual Community: Homesteading on the Electronic Frontier

The Virtual Community: Homesteading on the Electronic Frontier
Using Coplink to Analyze Criminal-Justice Data

Computer
Crime Data Mining: A General Framework and Some Examples

Computer
Fighting organized crimes: using shortest-path algorithms to identify associations in criminal networks

Decision Support Systems
RETRACTED: Social networks of author--coauthor relationships

Computational Statistics & Data Analysis

PerpSearch: an integrated crime detection system

ISI'09 Proceedings of the 2009 IEEE international conference on Intelligence and security informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

How close two entities are in social network is a key factor of SNA (Social Network Analysis). Recent studies of social networks contain a large number of entities and huge number of relations/connections in the networks. Efficiently and accurately analyzing relationships in the network is important component of SNA, especially for law enforcement. In this paper we propose using the edge-dual graph to transform the traditional social network graph to a relation context oriented graph and using modified k-connectivity concepts to evaluate the robustness of the relations. We also describe an implementation of a system based on a 450GB data source, involving 5 million people in Alabama. We use this large scale implementation to evaluate the performance and correctness of the proposal. Our evaluation suggests that using this relation context oriented technology will help to construct a more accurate social network.