Advisor(s)
Abstract(s)
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.
Description
Keywords
Data mining Social networks Graph mining
Pedagogical Context
Citation
Cavique, Luís; Mendes, Armando B.; Santos, Jorge M. Azevedo - An algorithm to discover the k-clique cover in networks. In Lopes, Luís Seabra [et al.] eds. - "Progress in artificial intelligence" [Em linha]. Springer-Verlag : Berlin, 2009. ISBN 978-3-642-04685-8. p. 363-373
Publisher
Springer-Verlag Berlin Heidelberg