|
Scheda bibliografica proveniente da importazione di metadati da altro sistema |
| Tipo: |
Testo a stampa, Risorsa analitica |
| É contributo di: |
Graph-based representations in pattern recognition |
| Titolo: |
A Continuous-Based Approach for Partial Clique Enumeration |
| Pubblicazione: |
Berlin ; Heidelberg ; New York : Springer, ©2007 |
| Descrizione fisica: |
61-70 |
| Titolo uniforme: |
Graph-based representations in pattern recognition |
| Numeri standard: |
DOI 10.1007/978-3-540-72903-7_6  |
| Sommario o abstract: |
In many applications of computer vision and pattern recognition which use graph-based knowledge representation, it is of great interest to be able to extract the K largest cliques in a graph, but most methods are geared either towards extracting the single clique of maximum size, or enumerating all cliques, without following any particular order. In this paper we present a novel approach for partial clique enumeration, that is, the extraction of the K largest cliques of a graph. Our approach is based on a continuous formulation of the clique problem developed by Motzkin and Straus, and is able to avoid extracting the same clique multiple times. This is done by casting the problem into a game-theoretic framework and iteratively rendering unstable the solutions that have already been extracted |
| Altre responsabilitą: |
Samuel Bul+¦
Andrea Torsello
Marcello Pelillo |
| Classificazione Dewey: |
006 ed.22 Metodi speciali di elaborazione |
| Lingua della pubblicazione: |
Inglese |
| Paese di pubblicazione: |
Germania ; Stati Uniti d'America |
| Codice identificativo: |
IT/ItRC/00017346 |
| data di importazione: |
01-01-2014 |
|
Full text |
Lista sintetica
CNR - Area della Ricerca di Genova Servizio di Documentazione Scientifica
SEI QUI: HOME
SCHEDA BIBLIOGRAFICA
