{"id":3691,"date":"2023-11-06T00:27:00","date_gmt":"2023-11-06T00:27:00","guid":{"rendered":"https:\/\/blogs.qub.ac.uk\/dipsa\/?p=3691"},"modified":"2026-05-01T01:23:23","modified_gmt":"2026-05-01T00:23:23","slug":"machine-learning-based-per-instance-algorithm-selection-for-high-performance-subgraph-isomorphism-enumeration","status":"publish","type":"post","link":"https:\/\/blogs.qub.ac.uk\/dipsa\/machine-learning-based-per-instance-algorithm-selection-for-high-performance-subgraph-isomorphism-enumeration\/","title":{"rendered":"Paper presentation at META 2023 in Marrakech, Morocco"},"content":{"rendered":"\n<p class=\"wp-block-paragraph\">I recently travelled to <strong>Marrakech, Morocco<\/strong>, to present my research at the <strong>9th International Conference on Metaheuristics and Nature-Inspired Computing (META 2023)<\/strong>. Held from <strong>November 1\u20134, 2023<\/strong>, the conference provided an incredible atmosphere for discussing how meta-heuristics can tackle complex optimisation problems.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">My paper, <strong>&#8220;Machine learning-based per-instance algorithm selection for high-performance subgraph isomorphism enumeration,&#8221;<\/strong> addresses a classic &#8220;needle in a haystack&#8221; problem: finding small patterns (subgraphs) within massive data graphs.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">In graph analytics, no single algorithm is the fastest for every problem instance. My research proposes a metaheuristic approach that uses <strong>Machine Learning (ML)<\/strong> to predict the fastest algorithm for a specific graph pair.<\/p>\n\n\n\n<div class=\"wp-block-buttons is-content-justification-center is-layout-flex wp-container-core-buttons-is-layout-fe48e5de wp-block-buttons-is-layout-flex\">\n<div class=\"wp-block-button has-custom-width wp-block-button__width-50 is-style-outline is-style-outline--1\"><a class=\"wp-block-button__link has-text-align-center wp-element-button\" href=\"https:\/\/pure.qub.ac.uk\/en\/publications\/machine-learning-based-per-instance-algorithm-selection-for-high-\">Find the paper on Pure<\/a><\/div>\n<\/div>\n\n\n\n<p class=\"wp-block-paragraph\">Some pictures from the presentation are below.<\/p>\n\n\n\n<figure class=\"wp-block-gallery has-nested-images columns-default is-cropped wp-block-gallery-2 is-layout-flex wp-block-gallery-is-layout-flex\">\n<figure class=\"wp-block-image size-large\"><img fetchpriority=\"high\" decoding=\"async\" width=\"1024\" height=\"576\" data-id=\"3826\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231102_120454371.MP_-1024x576.jpg\" alt=\"\" class=\"wp-image-3826\" srcset=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231102_120454371.MP_-1024x576.jpg 1024w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231102_120454371.MP_-300x169.jpg 300w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231102_120454371.MP_-768x432.jpg 768w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231102_120454371.MP_-1536x864.jpg 1536w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231102_120454371.MP_-2048x1152.jpg 2048w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231102_120454371.MP_-1110x624.jpg 1110w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231102_120454371.MP_-528x297.jpg 528w\" sizes=\"(max-width: 1024px) 100vw, 1024px\" \/><\/figure>\n\n\n\n<figure class=\"wp-block-image size-large\"><img decoding=\"async\" width=\"1024\" height=\"576\" data-id=\"3827\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231102_120239285-1024x576.jpg\" alt=\"\" class=\"wp-image-3827\" srcset=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231102_120239285-1024x576.jpg 1024w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231102_120239285-300x169.jpg 300w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231102_120239285-768x432.jpg 768w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231102_120239285-1536x864.jpg 1536w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231102_120239285-2048x1152.jpg 2048w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231102_120239285-1110x624.jpg 1110w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231102_120239285-528x297.jpg 528w\" sizes=\"(max-width: 1024px) 100vw, 1024px\" \/><\/figure>\n<\/figure>\n\n\n\n<p class=\"wp-block-paragraph\">The video of the paper presentation is given below.<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe title=\"Machine learning-based per-instance algorithm selection for high-performance subgraph isomorphism\" width=\"1140\" height=\"641\" src=\"https:\/\/www.youtube.com\/embed\/rKk-_Y2OyNo?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" referrerpolicy=\"strict-origin-when-cross-origin\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>I recently travelled to Marrakech, Morocco, to present my research at the 9th International Conference on Metaheuristics and Nature-Inspired Computing (META 2023). Held from November 1\u20134, 2023, the conference provided an incredible atmosphere for discussing how meta-heuristics can tackle complex optimisation problems. My paper, &#8220;Machine learning-based per-instance algorithm selection for high-performance subgraph isomorphism enumeration,&#8221; addresses [&hellip;]<\/p>\n","protected":false},"author":1149,"featured_media":2714,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[151,69],"tags":[],"class_list":["post-3691","post","type-post","status-publish","format-standard","has-post-thumbnail","category-graph-algorithms","category-subgraph-isomorphism","czr-hentry"],"jetpack_featured_media_url":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/ni5.jpg","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/posts\/3691","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/users\/1149"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/comments?post=3691"}],"version-history":[{"count":3,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/posts\/3691\/revisions"}],"predecessor-version":[{"id":3843,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/posts\/3691\/revisions\/3843"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/media\/2714"}],"wp:attachment":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/media?parent=3691"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/categories?post=3691"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/tags?post=3691"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}