Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.3/2148
Título: An Algorithm to Discover the k-Clique Cover in Networks.
Autor: Cavique, Luís
Mendes, Armando B.
Santos, Jorge M. A.
Palavras-chave: Data Mining
Graph Mining
Social Networks
Data: 2009
Editora: Springer Berlin Heidelberg
Citação: 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.
Resumo: 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.
Descrição: 14th Portuguese Conference on Artificial Intelligence, EPIA 2009, Aveiro, Portugal, October 12-15, 2009.
Peer review: yes
URI: http://hdl.handle.net/10400.3/2148
ISBN: 978-3-642-04685-8
Aparece nas colecções:DME - Parte ou Capítulo de um Livro / Part of Book or Chapter of Book

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
progress in AI.pdf189,4 kBAdobe PDFVer/Abrir


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.