Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem
Maximum Common induced Subgraph (MCS) is an important NP-hard problem with wide real-world applications. Branch-and-Bound (BnB) is the basis of a class of efficient algorithms for MCS, consisting in successively selecting vertices to match and pruning when it is discovered that a solution better tha...
Saved in:
Published in | arXiv.org |
---|---|
Main Authors | , , , , |
Format | Paper |
Language | English |
Published |
Ithaca
Cornell University Library, arXiv.org
18.08.2022
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | Maximum Common induced Subgraph (MCS) is an important NP-hard problem with wide real-world applications. Branch-and-Bound (BnB) is the basis of a class of efficient algorithms for MCS, consisting in successively selecting vertices to match and pruning when it is discovered that a solution better than the best solution found so far does not exist. The method of selecting the vertices to match is essential for the performance of BnB. In this paper, we propose a new value function and a hybrid selection strategy used in reinforcement learning to define a new vertex selection method, and propose a new BnB algorithm, called McSplitDAL, for MCS. Extensive experiments show that McSplitDAL significantly improves the current best BnB algorithms, McSplit+LL and McSplit+RL. An empirical analysis is also performed to illustrate why the new value function and the hybrid selection strategy are effective. |
---|---|
AbstractList | Maximum Common induced Subgraph (MCS) is an important NP-hard problem with wide real-world applications. Branch-and-Bound (BnB) is the basis of a class of efficient algorithms for MCS, consisting in successively selecting vertices to match and pruning when it is discovered that a solution better than the best solution found so far does not exist. The method of selecting the vertices to match is essential for the performance of BnB. In this paper, we propose a new value function and a hybrid selection strategy used in reinforcement learning to define a new vertex selection method, and propose a new BnB algorithm, called McSplitDAL, for MCS. Extensive experiments show that McSplitDAL significantly improves the current best BnB algorithms, McSplit+LL and McSplit+RL. An empirical analysis is also performed to illustrate why the new value function and the hybrid selection strategy are effective. |
Author | He, Kun Zhao, Jiming Chu-Min, Li Liu, Yanli Jiang, Hua |
Author_xml | – sequence: 1 givenname: Yanli surname: Liu fullname: Liu, Yanli – sequence: 2 givenname: Jiming surname: Zhao fullname: Zhao, Jiming – sequence: 3 givenname: Li surname: Chu-Min fullname: Chu-Min, Li – sequence: 4 givenname: Hua surname: Jiang fullname: Jiang, Hua – sequence: 5 givenname: Kun surname: He fullname: He, Kun |
BookMark | eNqNit0KgjAYQEcUZOU7fNC1sOZfXUviRX9QdCuzpk7cZpvDevu86AG6OnDOWaCpVJJNkEN8f-NtA0LmyDWmwRiTKCZh6DvonH0KzZ9wYFRLLisYeF_DiQ1wp61lkFr56LmSUCoNfc3gSN9cWAGJEmLUV1tUmnY1XLQqWiZWaFbS1jD3xyVap_tbknmdVi_LTJ83ymo5ppzEONiQIAp3_n_XFzr5P9k |
ContentType | Paper |
Copyright | 2022. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
Copyright_xml | – notice: 2022. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
DBID | 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PIMPY PQEST PQQKQ PQUKI PRINS PTHSS |
DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One Community College ProQuest Central Korea SciTech Premium Collection ProQuest Engineering Collection Engineering Database Publicly Available Content Database ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
DatabaseTitle | Publicly Available Content Database Engineering Database Technology Collection ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest One Academic Engineering Collection |
DatabaseTitleList | Publicly Available Content Database |
Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Physics |
EISSN | 2331-8422 |
Genre | Working Paper/Pre-Print |
GroupedDBID | 8FE 8FG ABJCF ABUWG AFKRA ALMA_UNASSIGNED_HOLDINGS AZQEC BENPR BGLVJ CCPQU DWQXO FRJ HCIFZ L6V M7S M~E PIMPY PQEST PQQKQ PQUKI PRINS PTHSS |
ID | FETCH-proquest_journals_27041246593 |
IEDL.DBID | 8FG |
IngestDate | Tue Sep 24 23:40:39 EDT 2024 |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | false |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-proquest_journals_27041246593 |
OpenAccessLink | https://www.proquest.com/docview/2704124659/abstract/?pq-origsite=%requestingapplication% |
PQID | 2704124659 |
PQPubID | 2050157 |
ParticipantIDs | proquest_journals_2704124659 |
PublicationCentury | 2000 |
PublicationDate | 20220818 |
PublicationDateYYYYMMDD | 2022-08-18 |
PublicationDate_xml | – month: 08 year: 2022 text: 20220818 day: 18 |
PublicationDecade | 2020 |
PublicationPlace | Ithaca |
PublicationPlace_xml | – name: Ithaca |
PublicationTitle | arXiv.org |
PublicationYear | 2022 |
Publisher | Cornell University Library, arXiv.org |
Publisher_xml | – name: Cornell University Library, arXiv.org |
SSID | ssj0002672553 |
Score | 3.4066255 |
SecondaryResourceType | preprint |
Snippet | Maximum Common induced Subgraph (MCS) is an important NP-hard problem with wide real-world applications. Branch-and-Bound (BnB) is the basis of a class of... |
SourceID | proquest |
SourceType | Aggregation Database |
SubjectTerms | Algorithms Apexes Empirical analysis Learning |
Title | Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem |
URI | https://www.proquest.com/docview/2704124659/abstract/ |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3dS8MwED_miuCbn_gxR0BfQ2nTdO2ToLQWYbOIyt5GkiYiOJ1bC_ri324utvog7DEJhORI7i6X390P4HzEuYmMjKmqJKeRPTFUSJ5QZgKGLJkxqxzaYhIXD9HNlE97UHS5MAir7HSiU9TVm8IYuR-OHFFyzFNfSIwCqNq_WLxT5I_Cf9aWTGMDvABr4mHOeH79G20J45H1ndk_heusSL4NXikWerkDPf26C5sOfKlWe3BbfGLeFGlrnT4RDI4Sq37Io3hpNMmt7UH5EetgEuuwkbH4eJ43c4LZHbbbXn5Xd5qUP-ww-3CWZ_dXBe1WMWtPzGr2tz92AH379NeHQFgg09RUgUaJJkaLhFWKGxYaFavUpEcwWDfT8frhE9gKEcyPBV6TAfTrZaNPrYmt5dBJbwjeZTYp72xr_JV9A_kph6g |
link.rule.ids | 786,790,12792,21416,33408,33779,43635,43840 |
linkProvider | ProQuest |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1NT8MwDLVgE4Ibn4IxwBJcI9SmSdsTB0QpsI0dBtqtatMEITHY1lWCf08cOjgg7ZpIUWI5tvNi-wFchEKYwBSSqbIQLLAaw_JCRIwbjxNLpuSly7YYyPQpuB-LcQO4VU1a5dImOkNdfijCyC_90BElSxFfTWeMWKPod7Wh0FiHdsCt66RK8eT2F2PxZWgjZv7PzDrfkWxDe5hP9XwH1vT7Lmy4lEtV7cFj-kXVUth0OH1BgkTRGh18zt9qjYn1OCQ1tGEl2jAN-_nn66SeINV02GF75V23aRz-cMLsw3lyM7pO2XIXWaMnVfZ3Kn4ALfvg14eA3Cvi2JSeJjlGRucRL5Uw3DdKqtjER9BdtVJn9fQZbKajfi_r3Q0ejmHLp3R-avEadaG1mNf6xDrZRXHqJPkNi1eECw |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Hybrid+Learning+with+New+Value+Function+for+the+Maximum+Common+Subgraph+Problem&rft.jtitle=arXiv.org&rft.au=Liu%2C+Yanli&rft.au=Zhao%2C+Jiming&rft.au=Chu-Min%2C+Li&rft.au=Jiang%2C+Hua&rft.date=2022-08-18&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422 |