| dc.contributor.author | Cavique, Luís | |
| dc.contributor.author | Mendes, Armando B. | |
| dc.contributor.author | Santos, Jorge M. A. | |
| dc.date.accessioned | 2013-07-23T10:32:37Z | |
| dc.date.available | 2013-07-23T10:32:37Z | |
| dc.date.issued | 2009 | |
| dc.date.updated | 2013-07-18T17:54:54Z | |
| dc.description | 14th Portuguese Conference on Artificial Intelligence, EPIA 2009, Aveiro, Portugal, October 12-15, 2009. | en |
| dc.description.abstract | 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. | en |
| dc.identifier.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. | en |
| dc.identifier.isbn | 978-3-642-04685-8 | |
| dc.identifier.uri | http://hdl.handle.net/10400.3/2148 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | yes | por |
| dc.publisher | Springer Berlin Heidelberg | por |
| dc.relation.uri | http://hdl.handle.net/10400.2/1777 | |
| dc.subject | Data Mining | en |
| dc.subject | Graph Mining | en |
| dc.subject | Social Networks | en |
| dc.title | An Algorithm to Discover the k-Clique Cover in Networks. | en |
| dc.type | book part | |
| dspace.entity.type | Publication | |
| oaire.citation.conferencePlace | Heidelberg, Berlin | por |
| oaire.citation.endPage | 373 | por |
| oaire.citation.startPage | 363 | por |
| oaire.citation.title | Progress in Artificial Intelligence | en |
| rcaap.rights | openAccess | por |
| rcaap.type | bookPart | por |
