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

Proceedings of the 46th Annual Southeast Regional Conference on XX, ACM-SE 46

Volumn , Issue , 2008, Pages 475-480

  Ding, Li ^a   Dixon, Brandon ^a  

^a University of Alabama   (United States)

Author keywords

Crime investigation; k connectivity; Law enforcement; Social network analysis; Strong connections

Indexed keywords

ALABAMA; CRIME INVESTIGATION; DATA SOURCE; DUAL GRAPHS; K-CONNECTIVITY; KEY FACTORS; ORIENTED GRAPH; SOCIAL NETWORK ANALYSIS; SOCIAL NETWORKS; SYSTEM-BASED;

ELECTRIC NETWORK ANALYSIS; GRAPH THEORY; LAW ENFORCEMENT; SPONTANEOUS EMISSION;

BEHAVIORAL RESEARCH;

EID: 70449842997     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1593105.1593230     Document Type: Conference Paper

References (16)

1. Wasserman, S and Faust, K. 1994. Social network analysis: methods and applications. Cambridge University Press. 4-10
2. Rheingold, H. 1993. The virtual community: homesteading on the electronic frontier. Addison-Wesley Pub. 1993.
3. Said, Y. H., Wegman, E. J., Sharabati, W. K. and Rigsby, J. T. 2008. Social networks of author-coauthor relationships. Computational Statistics & Data Analysis, vol 52 (Jan, 2008), 2177-2184
4. Kossinets, G and Watts, D. J. 2006. Empirical Analysis of an Evolving Social Network. Science, vol. 311 (Jan, 2006), 88-90.
5. Chen, H., Chung, W., Xu, J.J., Wang, G., Qin, Y., and Chau, M. 2004. Crime data mining: a general framework and some examples. IEEE Computer, vol. 37 (Apr, 2004), 50-56.
6. Goldberg, H. G and Wong, R. W. H. 1998. Restructuring databases for knowledge discovery by consolidation and link information. In Proceedings of 1998 AAAI Fall Symposium on Artificial Intelligence and Link Analysis (Menlo Park, CA, 1998).
7. Goldberg, H. G and Wong, R. W. H. 1998. Restructuring transactional data for link analysis in the FinCen AI system. In Proceedings of 1998 AAAI Fall Symposium on Artificial Intelligence and Link Analysis (Menlo Park, CA, 1998).
8. Hauck, R.V., Atabakhsb, H., Ongvasith, P., Gupta, H., Chen, H. 2002. Using Coplink to analyze criminal-justice data. IEEE Computer, vol. 35 (Mar, 2002), 30-37.
9. Xu, J. J., Chen, H. 2004. Fighting organized crimes: using shortest-path algorithms to identify associations in criminal networks. Decision Support Systems, vol. 38 (2004), 473-487.
10. Watts, D. J. and Strogatz, S. 1998. Collective dynamics of 'small-world' networks. Nature, vol. 393 (Jun, 1998), 440-442.
11. Barabasi, A. L., Jeong, H., Neda, Z., Ravasz, E., Schubert, A. and Vicsek, T. 2002. Evolution of the social network of scientific collaborations. Physica A 311, (3-4) (2002), 590-614.
12. Harary, F. 1969. Graph Theory. 45-46
13. Moody, J. and White, D. R. 2003. Structural Cohesion and Embeddedness: A Hierarchical Concept of Social Groups. American Sociological Review, vol. 68 (2003), 103-127.
14. Clark, J. 1991. A first look at graph theory. World Scientific, 1991.
15. Cormen, T. H., Leiserson, C. E., Rivest, R. L. and Stein, C. 2001. Introduction to algorithms (second edition). MIT Press. 643-662.
16. Web site: http://www.jgraph.com/