Li Ding
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.
- Wasserman, S and Faust, K. 1994. Social network analysis: methods and applications. Cambridge University Press. 4--10Google Scholar
- Rheingold, H. 1993. The virtual community: homesteading on the electronic frontier. Addison-Wesley Pub. 1993. Google ScholarDigital Library
- 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 Google ScholarDigital Library
- Kossinets, G and Watts, D. J. 2006. Empirical Analysis of an Evolving Social Network. Science, vol. 311 (Jan, 2006), 88--90.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- 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).Google Scholar
- 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).Google Scholar
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Watts, D. J. and Strogatz, S. 1998. Collective dynamics of 'small-world' networks. Nature, vol. 393 (Jun, 1998), 440--442.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- Harary, F. 1969. Graph Theory. 45--46Google Scholar
- 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.Google ScholarCross Ref
- Clark, J. 1991. A first look at graph theory. World Scientific, 1991.Google ScholarCross Ref
- Cormen, T. H., Leiserson, C. E., Rivest, R. L. and Stein, C. 2001. Introduction to algorithms (second edition). MIT Press. 643--662. Google ScholarDigital Library
- Web site: http://www.jgraph.com/Google Scholar
Index Terms
- Using an edge-dual graph and k-connectivity to identify strong connections in social networks
Recommendations
A relation context oriented approach to identify strong ties in social networks
Strong ties play a crucial role in transmitting sensitive information in social networks, especially in the criminal justice domain. However, large social networks containing many entities and relations may also contain a large amount of noisy data. ...
Rainbow trees in graphs and generalized connectivity
An edge-colored tree T is a rainbow tree if no two edges of T are assigned the same color. Let G be a nontrivial connected graph of order n and let k be an integer with 2 ≤ k ≤ n. A k-rainbow coloring of G is an edge coloring of G having the property ...
Extra edge connectivity and isoperimetric edge connectivity
An edge set S of a connected graph G is a k-extra edge cut, if G-S is no longer connected, and each component of G-S has at least k vertices. The cardinality of a minimum k-extra edge cut, denoted by @l"k(G), is the k-extra edge connectivity of G. The ...
Comments