Skip to main navigation Skip to search Skip to main content

Yüksek-derece çizge yapilari ile maksimum klik sayma problemine yönelik buluşsal yöntemleri öǧrenme

Translated title of the contribution: Learning heuristics for the maximum clique enumeration problem using higher-order graph structures

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

Recently, various NP-hard combinatorial optimization problems have been solved by learned heuristics using complex learning models. In particular, node classification in graphs has been a helpful method towards finding the decision boundary to distinguish nodes in an optimal set from the rest. In this work, we investigate the role of local graphlet counts surrounding a node as graph features in the node classification towards solving the maximum clique enumeration problem. Graphlets are small induced subgraphs, whose local and global frequencies have been important features in the analysis of networks. We use a learning framework to identify the nodes that belong to some maximum clique of the network. Consequently, this idea is used in a pruning process to reduce the runtime of the maximum clique enumeration problem. Besides the high accuracy of the results, the performance of this framework is shown to be scalable and robust. The method presented here is applicable to networks from all sizes and can be used in estimating the solution of other graph search problems with high complexity.

Translated title of the contributionLearning heuristics for the maximum clique enumeration problem using higher-order graph structures
Original languageTurkish
Title of host publicationSIU 2021 - 29th IEEE Conference on Signal Processing and Communications Applications, Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781665436496
DOIs
Publication statusPublished - 9 Jun 2021
Event29th IEEE Conference on Signal Processing and Communications Applications, SIU 2021 - Virtual, Istanbul, Turkey
Duration: 9 Jun 202111 Jun 2021

Publication series

NameSIU 2021 - 29th IEEE Conference on Signal Processing and Communications Applications, Proceedings

Conference

Conference29th IEEE Conference on Signal Processing and Communications Applications, SIU 2021
Country/TerritoryTurkey
CityVirtual, Istanbul
Period9/06/2111/06/21

Fingerprint

Dive into the research topics of 'Learning heuristics for the maximum clique enumeration problem using higher-order graph structures'. Together they form a unique fingerprint.

Cite this