{"id":"https://openalex.org/W4416912718","doi":"https://doi.org/10.1504/ijiei.2025.150111","title":"Study of meta-learning attempts to select algorithm for hard combinatorial optimisation problems","display_name":"Study of meta-learning attempts to select algorithm for hard combinatorial optimisation problems","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4416912718","doi":"https://doi.org/10.1504/ijiei.2025.150111"},"language":"en","primary_location":{"id":"doi:10.1504/ijiei.2025.150111","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijiei.2025.150111","pdf_url":null,"source":{"id":"https://openalex.org/S106085749","display_name":"International Journal of Intelligent Engineering Informatics","issn_l":"1758-8715","issn":["1758-8715","1758-8723"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Intelligent Engineering Informatics","raw_type":"journal-article"},"type":"article","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/A5017190377","display_name":"Neha Sehta","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neha Sehta","raw_affiliation_strings":["Department of Computer Engineering, Shri G.S. Institute of Technology and Science, Indore, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Shri G.S. Institute of Technology and Science, Indore, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028564840","display_name":"Urjita Thakar","orcid":"https://orcid.org/0000-0002-5697-3405"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Urjita Thakar","raw_affiliation_strings":["Department of Computer Engineering, Shri G.S. Institute of Technology and Science, Indore, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Shri G.S. Institute of Technology and Science, Indore, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19082124,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"4","first_page":"461","last_page":"486"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.9861000180244446,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12535","display_name":"Machine Learning and Data Classification","score":0.9861000180244446,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.0017000000225380063,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0013000000035390258,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/selection","display_name":"Selection (genetic algorithm)","score":0.628600001335144},{"id":"https://openalex.org/keywords/weighted-majority-algorithm","display_name":"Weighted Majority Algorithm","score":0.6211000084877014},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.6086999773979187},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5360999703407288},{"id":"https://openalex.org/keywords/feature-selection","display_name":"Feature selection","score":0.43650001287460327},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.3919999897480011},{"id":"https://openalex.org/keywords/selection-algorithm","display_name":"Selection algorithm","score":0.38920000195503235}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8658000230789185},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.628600001335144},{"id":"https://openalex.org/C95627357","wikidata":"https://www.wikidata.org/wiki/Q7979889","display_name":"Weighted Majority Algorithm","level":5,"score":0.6211000084877014},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.6086999773979187},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5372999906539917},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5360999703407288},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.5248000025749207},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5134999752044678},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.43650001287460327},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.3919999897480011},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.38920000195503235},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.3431999981403351},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.32679998874664307},{"id":"https://openalex.org/C8038995","wikidata":"https://www.wikidata.org/wiki/Q1152135","display_name":"Unsupervised learning","level":2,"score":0.32339999079704285},{"id":"https://openalex.org/C136389625","wikidata":"https://www.wikidata.org/wiki/Q334384","display_name":"Supervised learning","level":3,"score":0.3147999942302704},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.30630001425743103},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.3061000108718872},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.2874000072479248},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2676999866962433}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijiei.2025.150111","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijiei.2025.150111","pdf_url":null,"source":{"id":"https://openalex.org/S106085749","display_name":"International Journal of Intelligent Engineering Informatics","issn_l":"1758-8715","issn":["1758-8715","1758-8723"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Intelligent Engineering Informatics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,8,15,40,108],"large":[2],"number":[3,110],"of":[4,52,111],"techniques":[5,97],"to":[6,38,45,122,136,141,148],"solve":[7],"problem,":[9],"recommending":[10],"the":[11],"most":[12],"appropriate":[13],"for":[14,55],"specific":[16],"case":[17],"is":[18,62,104,130],"defined":[19],"as":[20,29],"algorithm":[21,46,56,76,85,123,137],"selection":[22,57,103,124,143],"problem.":[23],"Machine":[24],"learning":[25,30,96],"community":[26],"identified":[27],"this":[28,49],"task":[31],"and":[32,69,94],"called":[33],"it":[34,129],"meta-learning.":[35],"It":[36],"aims":[37],"identify":[39],"mapping":[41],"from":[42],"instance":[43,71,133],"characteristics":[44],"performance.":[47,138],"In":[48,139],"paper,":[50],"review":[51],"meta-learning":[53,145],"attempts":[54],"on":[58,116],"different":[59,117],"optimisation":[60],"problems,":[61],"presented.":[63],"Each":[64],"meta-data":[65],"tuple":[66],"contains":[67],"structural":[68],"other":[70],"features":[72],"along":[73],"with":[74],"target":[75],"performance":[77,91,115],"metrics.":[78],"Solution":[79],"quality,":[80],"success":[81],"probability,":[82],"approximation":[83],"ratio,":[84],"ranking,":[86],"run-time":[87],"requirement":[88],"are":[89],"key":[90],"measures.":[92],"Supervised":[93],"unsupervised":[95],"have":[98],"been":[99],"applied":[100],"effectively.":[101],"Algorithm":[102],"considered":[105],"valuable":[106],"when":[107],"vast":[109],"methods":[112],"exhibit":[113],"variable":[114],"instances.":[118],"The":[119],"black-box":[120],"approach":[121],"can":[125],"be":[126],"dropped":[127],"if":[128],"known":[131],"how":[132],"attributes":[134],"relate":[135],"contrast":[140],"straightforward":[142],"methods,":[144],"models":[146],"lead":[147],"acquire":[149],"high-quality":[150],"solutions.":[151]},"counts_by_year":[],"updated_date":"2025-12-03T23:09:05.601824","created_date":"2025-12-02T00:00:00"}