{"id":"https://openalex.org/W3185437794","doi":"https://doi.org/10.1109/siu53274.2021.9477866","title":"Learning Heuristics for the Maximum Clique Enumeration Problem Using Higher-Order Graph Structures","display_name":"Learning Heuristics for the Maximum Clique Enumeration Problem Using Higher-Order Graph Structures","publication_year":2021,"publication_date":"2021-06-09","ids":{"openalex":"https://openalex.org/W3185437794","doi":"https://doi.org/10.1109/siu53274.2021.9477866","mag":"3185437794"},"language":"en","primary_location":{"id":"doi:10.1109/siu53274.2021.9477866","doi":"https://doi.org/10.1109/siu53274.2021.9477866","is_oa":false,"landing_page_url":"https://doi.org/10.1109/siu53274.2021.9477866","pdf_url":null,"source":{"id":"https://openalex.org/S4363607818","display_name":"Signal Processing and Communications Applications Conference (SIU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 29th Signal Processing and Communications Applications Conference (SIU)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017908783","display_name":"Ali Baran Ta\u015fdemir","orcid":"https://orcid.org/0000-0001-5271-5751","observed_orcids":["https://orcid.org/0000-0001-5271-5751"]},"institutions":[{"id":"https://openalex.org/I66514158","display_name":"Hacettepe University","ror":"https://ror.org/04kwvgz42","country_code":"TR","type":"education","lineage":["https://openalex.org/I66514158"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Ali Baran Tasdemir","raw_affiliation_strings":["Hacettepe Üniversitesi,Bilgisayar M\u00fchendisli\u011fi B\u00f6l\u00fcm\u00fc,Ankara,Türkiye"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hacettepe Üniversitesi,Bilgisayar M\u00fchendisli\u011fi B\u00f6l\u00fcm\u00fc,Ankara,Türkiye","institution_ids":["https://openalex.org/I66514158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081950548","display_name":"Lale \u00d6zkahya","orcid":"https://orcid.org/0000-0001-6105-1694","observed_orcids":["https://orcid.org/0000-0001-6105-1694"]},"institutions":[{"id":"https://openalex.org/I66514158","display_name":"Hacettepe University","ror":"https://ror.org/04kwvgz42","country_code":"TR","type":"education","lineage":["https://openalex.org/I66514158"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Lale Ozkahya","raw_affiliation_strings":["Hacettepe Üniversitesi,Bilgisayar M\u00fchendisli\u011fi B\u00f6l\u00fcm\u00fc,Ankara,Türkiye"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hacettepe Üniversitesi,Bilgisayar M\u00fchendisli\u011fi B\u00f6l\u00fcm\u00fc,Ankara,Türkiye","institution_ids":["https://openalex.org/I66514158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66514158"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06590475,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.8598999977111816,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.8598999977111816,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.09440000355243683,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.026200000196695328,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/learned-heuristics","display_name":"learned heuristics","score":0.8939999938011169},{"id":"https://openalex.org/keywords/node-classification","display_name":"node classification","score":0.7710000276565552},{"id":"https://openalex.org/keywords/graphlets","display_name":"graphlets","score":0.9290000200271606},{"id":"https://openalex.org/keywords/pruning","display_name":"pruning","score":0.5839999914169312},{"id":"https://openalex.org/keywords/np-hard-combinatorial-optimization","display_name":"NP-hard combinatorial optimization","score":0.9160000085830688},{"id":"https://openalex.org/keywords/decision-boundaries","display_name":"decision boundaries","score":0.5109999775886536}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.8244112730026245},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.76563560962677},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6832225918769836},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.673201322555542},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5210134983062744},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5066235661506653},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5010926723480225},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4856061339378357},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.44878721237182617},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41898196935653687},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3439496159553528},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3389776945114136},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2044157087802887},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1179862916469574},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11254945397377014},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/siu53274.2021.9477866","doi":"https://doi.org/10.1109/siu53274.2021.9477866","is_oa":false,"landing_page_url":"https://doi.org/10.1109/siu53274.2021.9477866","pdf_url":null,"source":{"id":"https://openalex.org/S4363607818","display_name":"Signal Processing and Communications Applications Conference (SIU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 29th Signal Processing and Communications Applications Conference (SIU)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W229097380","https://openalex.org/W1567562836","https://openalex.org/W1849256610","https://openalex.org/W2040420521","https://openalex.org/W2046112356","https://openalex.org/W2080925589","https://openalex.org/W2090200605","https://openalex.org/W2109154902","https://openalex.org/W2126186592","https://openalex.org/W2130190334","https://openalex.org/W2159156271","https://openalex.org/W2241571695","https://openalex.org/W2283469138","https://openalex.org/W2294347342","https://openalex.org/W2492149513","https://openalex.org/W2585003791","https://openalex.org/W2904922632","https://openalex.org/W2977931005","https://openalex.org/W2997922658"],"related_works":["https://openalex.org/W4319944882","https://openalex.org/W2977931005","https://openalex.org/W4390905357","https://openalex.org/W2997922658","https://openalex.org/W4313531872","https://openalex.org/W2550459898","https://openalex.org/W2162164123","https://openalex.org/W4231112007","https://openalex.org/W3095929990","https://openalex.org/W4288855015"],"abstract_inverted_index":{"Recently,":[0],"various":[1],"NP-hard":[2],"combinatorial":[3],"optimization":[4],"problems":[5,168],"have":[6,80],"been":[7,23,81],"solved":[8],"by":[9],"learned":[10],"heuristics":[11],"using":[12],"complex":[13],"learning":[14,92],"models.":[15],"In":[16,42],"particular,":[17],"node":[18,55,61],"classification":[19,62],"in":[20,35,59,84,112,160],"graphs":[21],"has":[22],"a":[24,54,91,113],"helpful":[25],"method":[26,146],"towards":[27,63],"finding":[28],"the":[29,40,47,60,65,85,96,105,118,121,127,131,133,162],"decision":[30],"boundary":[31],"to":[32,94,100,116,140,151],"distinguish":[33],"nodes":[34,97],"an":[36],"optimal":[37],"set":[38],"from":[39,153],"rest.":[41],"this":[43,108,136],"work,":[44],"we":[45],"investigate":[46],"role":[48],"of":[49,87,104,120,130,135,164],"local":[50,76],"graphlet":[51],"counts":[52],"surrounding":[53],"as":[56],"graph":[57,166],"features":[58,83],"solving":[64],"maximum":[66,102,122],"clique":[67,103,123],"enumeration":[68,124],"problem.":[69,125],"Graphlets":[70],"are":[71],"small":[72],"induced":[73],"subgraphs,":[74],"whose":[75],"and":[77,143,156],"global":[78],"frequencies":[79],"important":[82],"analysis":[86],"networks.":[88],"We":[89],"use":[90],"framework":[93,137],"identify":[95],"that":[98],"belong":[99],"some":[101],"network.":[106],"Consequently,":[107],"idea":[109],"is":[110,138,149],"used":[111,159],"pruning":[114],"process":[115],"reduce":[117],"runtime":[119],"Besides":[126],"high":[128,170],"accuracy":[129],"results,":[132],"performance":[134],"shown":[139],"be":[141,158],"scalable":[142],"robust.":[144],"The":[145],"presented":[147],"here":[148],"applicable":[150],"networks":[152],"all":[154],"sizes":[155],"can":[157],"estimating":[161],"solution":[163],"other":[165],"search":[167],"with":[169],"complexity.":[171]},"counts_by_year":[],"updated_date":"2026-10-05T09:50:58.205359","created_date":"2021-08-02T00:00:00"}