An Algorithm to Discover the k-Clique Cover in Networks
In social network analysis, a k-clique is a relaxed clique, i.e., a k-clique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between any two vertices is no greater than k. The visualization of a small number of vertices can be easily performed in a graph. However, when the number of vertices and edges increases the visualization becomes incomprehensible. In this paper, we propose a new graph mining approach based on k-cliques. The concept of relaxed clique is extended to the whole graph, to achieve a general view, by covering the network with k-cliques. The sequence of k-clique covers is presented, combining small world concepts with community structure components. Computational results and examples are presented.
KeywordsData mining graph mining social networks
Unable to display preview. Download preview PDF.
- 2.Berners-Lee, T.: The Next Wave of the Web: Plenary Panel. In: 15th International World Wide Web Conference, WWW2006, Edinburgh, Scotland (2006)Google Scholar
- 3.Cavique, L., Luz, C.: A Heuristic for the Stability Number of a Graph based on Convex Quadratic Programming and Tabu Search, special issue of the Journal of Mathematical Sciences, Aveiro Seminar on Control Optimization and Graph Theory, Second Series (to appear, 2009)Google Scholar
- 7.DIMACS: Maximum clique, graph coloring, and satisfiability, Second DIMACS implementation challenge (1995), http://dimacs.rutgers.edu/Challenges/ (accessed April 2009)
- 9.Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. In: SIGCOMM, pp. 251–262 (1999)Google Scholar
- 12.Grossman, J., Ion, P., Castro, R.D.: The Erdos number Project (2007), http://www.oakland.edu/enp/ (accessed April 2009)
- 14.Kellerman, E.: Determination of keyword conflict. IBM Technical Disclosure Bulletin 16(2), 544–546 (1973)Google Scholar
- 16.Milgram, S.: The Small World Problem. Psychology Today 1(1), 60–67 (1967)Google Scholar
- 18.Moreno, J.L.: Who Shall Survive? Nervous and Mental Disease Publishing Company, Washington DC (1934)Google Scholar
- 19.Scott, J.: Social Network Analysis - A Handbook. Sage Publications, London (2000)Google Scholar
- 20.Soriano, P., Gendreau, M.: Tabu search algorithms for the maximum clique. In: Johnson, D.S., Trick, M.A. (eds.) Clique, Coloring and Satisfiability, Second Implementation Challenge DIMACS, pp. 221–242 (1996)Google Scholar