| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 189.4 KB | Adobe PDF |
Advisor(s)
Abstract(s)
In social network analysis, a k-clique is a relaxed clique, i.e., a kclique 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.
Description
14th Portuguese Conference on Artificial Intelligence, EPIA 2009, Aveiro, Portugal, October 12-15, 2009.
Keywords
Data Mining Graph Mining Social Networks
Citation
Cavique, Luis ; Mendes, Armando B. e Santos, Jorge M.A. (2009). "An Algorithm to Discover the k-Clique Cover in Networks", In Lopes, L. Seabra et al. (Eds.) «Progress in Artificial Intelligence», Proceedings of the 14th Portuguese Conference on Artificial Intelligence, EPIA 2009, LNCS 5816, Springer-Verlag Berlin Heidelberg, pp. 363-373. ISBN: 978-3-642-04685-8.
Publisher
Springer Berlin Heidelberg