A Restart Local Search for Solving Diversified Top-<i>k</i> Weight Clique Search Problem
Diversified top-<i>k</i> weight clique (DTKWC) search problem is an important generalization of the diversified top-<i>k</i> clique (DTKC) search problem with practical applications. The diversified top-<i>k</i> weight clique search problem aims to search <i>...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
MDPI AG
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/65a2700f3e004a41b157ebf270590db4 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | Diversified top-<i>k</i> weight clique (DTKWC) search problem is an important generalization of the diversified top-<i>k</i> clique (DTKC) search problem with practical applications. The diversified top-<i>k</i> weight clique search problem aims to search <i>k</i> maximal cliques that can cover the maximum weight in a vertex weighted graph. In this work, we propose a novel local search algorithm called TOPKWCLQ for the DTKWC search problem which mainly includes two strategies. First, a restart strategy is adopted, which repeated the construction and updating processes of the maximal weight clique set. Second, a scoring heuristic is designed by giving different priorities for maximal weight cliques in candidate set. Meanwhile, a constraint model of the DTKWC search problem is constructed such that the research concerns can be evaluated. Experimental results show that the proposed algorithm TOPKWCLQ outperforms than the comparison algorithm on large-scale real-world graphs. |
|---|