dc.contributor.author | Fan, Y | |
dc.contributor.author | Ma, Z | |
dc.contributor.author | Su, K | |
dc.contributor.author | Li, C | |
dc.contributor.author | Rao, C | |
dc.contributor.author | Liu, RH | |
dc.contributor.author | Latecki, LJ | |
dc.date.accessioned | 2021-02-04T06:54:40Z | |
dc.date.available | 2021-02-04T06:54:40Z | |
dc.date.issued | 2018 | |
dc.identifier.isbn | 9781538638767 | |
dc.identifier.issn | 1082-3409 | |
dc.identifier.doi | 10.1109/ICTAI.2017.00168 | |
dc.identifier.uri | http://hdl.handle.net/10072/401690 | |
dc.description.abstract | In this paper, we develop a local search algorithm to solve the Maximum Weight Clique (MWC) problem. Firstly we design a novel scoring function to measure the benefits of a local move. Then we develop a Cycle Estimation based ReStart (CERS) strategy to resolve the cycling issue in the local search process. Experimental results show that our solver achieves state-of-the-art performances on the large sparse graphs as well as large dense graphs. Also we present a theorem which shows the necessity of the restart strategies in current state-of-the-art local search algorithms. | |
dc.description.peerreviewed | Yes | |
dc.language | English | |
dc.publisher | IEEE | |
dc.relation.ispartofconferencename | 29th International Conference on Tools with Artificial Intelligence (ICTAI 2017) | |
dc.relation.ispartofconferencetitle | Proceedings - 2017 International Conference on Tools with Artificial Intelligence, ICTAI 2017 | |
dc.relation.ispartofdatefrom | 2017-11-06 | |
dc.relation.ispartofdateto | 2017-11-08 | |
dc.relation.ispartoflocation | Boston, USA | |
dc.relation.ispartofpagefrom | 1099 | |
dc.relation.ispartofpageto | 1104 | |
dc.subject.fieldofresearch | Artificial intelligence | |
dc.subject.fieldofresearchcode | 4602 | |
dc.subject.keywords | Science & Technology | |
dc.subject.keywords | Engineering, Electrical & Electronic | |
dc.subject.keywords | Computer Science | |
dc.title | Efficient local search for maximum weight cliques in large graphs | |
dc.type | Conference output | |
dc.type.description | E1 - Conferences | |
dcterms.bibliographicCitation | Fan, Y; Ma, Z; Su, K; Li, C; Rao, C; Liu, RH; Latecki, LJ, Efficient local search for maximum weight cliques in large graphs, Proceedings - 2017 International Conference on Tools with Artificial Intelligence, ICTAI 2017, 2018, pp. 1099-1104 | |
dc.date.updated | 2021-02-04T06:51:39Z | |
gro.hasfulltext | No Full Text | |
gro.griffith.author | Su, Kaile | |