A Hybrid Evolutionary Algorithm for the Diversified Top-k Weight Clique Search Problem (Student Abstract)

被引：0

作者：

Wu, Jun ^{[1
]}

Yin, Minghao ^{[1
]}

机构：

[1] Northeast Normal Univ, Sch Informat Sci & Technol, Changchun 130117, Peoples R China

来源：

THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE | 2022年

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The diversified top-k weight clique (DTKWC) search problem is an important generalization of the diversified top-k clique search problem, which extends the DTKC search problem by taking into account the weight of vertices. This problem involves finding at most k maximal weighted cliques that cover maximum weight of vertices with low overlapping in a given graph. In this study, a mixed integer linear program constraint formulation is proposed to model DTKWC search problem and an efficient hybrid evolutionary algorithm (HEA-D) based on some heuristic strategies is proposed to tackle it. Experiments on two sets of 110 graphs show that HEA-D outperforms the state-of-art methods.

引用

页码：13083 / 13084

页数：2

共 5 条

[1] Wu J, 2021, AAAI CONF ARTIF INTE, V35, P15929
[2] Local search for diversified Top-k clique search problem
Wu, Jun
Li, Chu-Min
Jiang, Lu
Zhou, Junping
Yin, Minghao
[J]. COMPUTERS & OPERATIONS RESEARCH, 2020, 116 (116)
[3] Diversified top-k clique search
Yuan, Long
Qin, Lu
Lin, Xuemin
Chang, Lijun
Zhang, Wenjie
[J]. VLDB JOURNAL, 2016, 25 (02) : 171 - 196
[4] Yuan L, 2015, PROC INT CONF DATA, P387, DOI 10.1109/ICDE.2015.7113300
[5] Solving diversified top-k weight clique search problem
Zhou, Junping
Li, Chumin
Zhou, Yupeng
Li, Mingyang
Liang, Lili
Wang, Jianan
[J]. SCIENCE CHINA-INFORMATION SCIENCES, 2021, 64 (05)

← 1 →