{"id":"https://openalex.org/W6906728982","doi":"https://doi.org/10.17877/de290r-19922","title":"Multi-objective analysis of machine learning algorithms using model-based optimization techniques","display_name":"Multi-objective analysis of machine learning algorithms using model-based optimization techniques","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W6906728982","doi":"https://doi.org/10.17877/de290r-19922"},"language":"en","primary_location":{"id":"pmh:oai:eldorado.tu-dortmund.de:2003/37937","is_oa":true,"landing_page_url":"http://hdl.handle.net/2003/37937","pdf_url":"http://hdl.handle.net/2003/37937","source":{"id":"https://openalex.org/S4306401691","display_name":"Eldorado (Technical University of Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2003/37937","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Horn, Daniel","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Horn, Daniel","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3796346,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.43389999866485596,"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.43389999866485596,"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.25360000133514404,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.02930000051856041,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/margin","display_name":"Margin (machine learning)","score":0.5960000157356262},{"id":"https://openalex.org/keywords/online-machine-learning","display_name":"Online machine learning","score":0.553600013256073},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5074999928474426},{"id":"https://openalex.org/keywords/computational-learning-theory","display_name":"Computational learning theory","score":0.507099986076355},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.4984000027179718},{"id":"https://openalex.org/keywords/hyperparameter-optimization","display_name":"Hyperparameter optimization","score":0.4772000014781952},{"id":"https://openalex.org/keywords/bayesian-optimization","display_name":"Bayesian optimization","score":0.4629000127315521},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4187999963760376}],"concepts":[{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.7379000186920166},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.704200029373169},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6748999953269958},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.5960000157356262},{"id":"https://openalex.org/C115903097","wikidata":"https://www.wikidata.org/wiki/Q7094097","display_name":"Online machine learning","level":3,"score":0.553600013256073},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5360999703407288},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5074999928474426},{"id":"https://openalex.org/C50292564","wikidata":"https://www.wikidata.org/wiki/Q2462783","display_name":"Computational learning theory","level":3,"score":0.507099986076355},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.4984000027179718},{"id":"https://openalex.org/C10485038","wikidata":"https://www.wikidata.org/wiki/Q48996162","display_name":"Hyperparameter optimization","level":3,"score":0.4772000014781952},{"id":"https://openalex.org/C2778049539","wikidata":"https://www.wikidata.org/wiki/Q17002908","display_name":"Bayesian optimization","level":2,"score":0.4629000127315521},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4187999963760376},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3928000032901764},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.34929999709129333},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.3418000042438507},{"id":"https://openalex.org/C2781002164","wikidata":"https://www.wikidata.org/wiki/Q6822311","display_name":"Meta learning (computer science)","level":3,"score":0.3255999982357025},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.3102000057697296},{"id":"https://openalex.org/C77967617","wikidata":"https://www.wikidata.org/wiki/Q4677561","display_name":"Active learning (machine learning)","level":2,"score":0.30660000443458557},{"id":"https://openalex.org/C24138899","wikidata":"https://www.wikidata.org/wiki/Q17141258","display_name":"Instance-based learning","level":3,"score":0.2930000126361847},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2687999904155731}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:eldorado.tu-dortmund.de:2003/37937","is_oa":true,"landing_page_url":"http://hdl.handle.net/2003/37937","pdf_url":"http://hdl.handle.net/2003/37937","source":{"id":"https://openalex.org/S4306401691","display_name":"Eldorado (Technical University of Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},{"id":"doi:10.17877/de290r-19922","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-19922","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:eldorado.tu-dortmund.de:2003/37937","is_oa":true,"landing_page_url":"http://hdl.handle.net/2003/37937","pdf_url":"http://hdl.handle.net/2003/37937","source":{"id":"https://openalex.org/S4306401691","display_name":"Eldorado (Technical University of Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6906728982.pdf","grobid_xml":"https://content.openalex.org/works/W6906728982.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"My":[0],"dissertation":[1,41],"deals":[2],"with":[3,369,376],"the":[4,33,49,61,74,77,81,85,108,132,162,189,191,200,206,209,218,223,232,243,249,265,296,325,335,351,356,360,411],"research":[5],"areas":[6],"optimization":[7,58,123,142,166,177,186,316],"and":[8,29,84,121,148,179,196,225,395],"machine":[9,53,112,170],"learning.":[10],"However,":[11],"both":[12],"of":[13,35,63,80,87,110,119,199,208,222,280,321,327,390],"them":[14],"are":[15,158,174,180,405],"too":[16],"extensive":[17],"to":[18,91,125,130,183,214,217,226,242,248,259,268,366,371,384,400,408],"be":[19,92,126,215,227,269,367,385,398],"covered":[20],"by":[21,73],"a":[22,26,64,100,103,117,253,274,278,339,388],"single":[23,27,254,275],"person":[24],"in":[25,128,149,302,410],"work,":[28,237],"that":[30,404],"is":[31,71,138,193,205,257,311,341],"not":[32,272],"goal":[34],"my":[36,40],"work":[37,323,357],"either.":[38],"Therefore,":[39],"focuses":[42,358],"on":[43,57,116,169,359,387],"interactions":[44],"between":[45,264],"these":[46],"fields.":[47],"On":[48,161],"one":[50,284],"hand,":[51,164],"most":[52,111,201],"learning":[54,113,171],"algorithms":[55,114,152,167,178],"rely":[56,168],"techniques.":[59],"First,":[60],"training":[62,392,412],"learner":[65],"often":[66],"implies":[67],"an":[68,122],"optimization.":[69],"This":[70,310],"demonstrated":[72],"SVM,":[75],"where":[76,252],"weighted":[78],"sum":[79,86],"margin":[82,88],"size":[83],"violations":[89],"has":[90,124,213,365],"optimized.":[93],"Many":[94],"other":[95,163,305],"learners":[96],"internally":[97],"optimize":[98],"either":[99],"least-squares":[101],"or":[102,155],"maximum":[104],"likelihood":[105],"problem.":[106],"Second,":[107],"performance":[109],"depends":[115],"set":[118,279,389],"hyper-parameters":[120],"conducted":[127],"order":[129],"find":[131],"best":[133,255,281,336,352],"performing":[134],"model.":[135],"Unfortunately,":[136],"there":[137],"no":[139],"globally":[140],"accepted":[141],"algorithm":[143,329,333,337,348,353,364],"for":[144,230,285,290,299,313,338],"hyper-parameter":[145],"tuning":[146],"problems,":[147],"practice":[150],"naive":[151],"like":[153],"random":[154],"grid":[156],"search":[157],"frequently":[159],"used.":[160],"some":[165,303],"models.":[172],"They":[173],"called":[175],"model-based":[176,314],"mostly":[181],"used":[182],"solve":[184],"expensive":[185],"problems.":[187],"During":[188],"optimization,":[190],"model":[192,210],"iteratively":[194],"refined":[195],"exploited.":[197],"One":[198],"challenging":[202],"tasks":[203],"here":[204],"choice":[207],"class.":[211],"It":[212],"applicable":[216],"particular":[219],"parameter":[220],"space":[221],"OP":[224],"well":[228],"suited":[229],"modeling":[231],"function\u2019s":[233],"landscape.":[234],"In":[235,246,331],"this":[236,322,380],"I":[238],"gave":[239],"special":[240],"attention":[241],"multi-objective":[244,292,315,361],"case.":[245],"contrast":[247],"single-objective":[250,300],"case,":[251],"solution":[256],"likely":[258],"exist,":[260],"all":[261,377],"possible":[262],"trade-offs":[263],"objectives":[266],"have":[267],"considered.":[270],"Hence,":[271],"only":[273,397],"best,":[276],"but":[277],"solutions":[282],"exists,":[283],"each":[286],"trade-off.":[287],"Although":[288],"approaches":[289,298],"solving":[291,344],"problems":[293,301],"differ":[294],"from":[295],"corresponding":[297],"parts,":[304],"parts":[306],"can":[307,396],"remain":[308],"unchanged.":[309],"shown":[312],"algorithms.":[317],"The":[318],"last":[319],"third":[320],"addresses":[324],"field":[326],"offline":[328,347,378],"selection.":[330],"online":[332],"selection":[334,349,381],"problem":[340],"selected":[342,368],"while":[343],"it.":[345],"Contrary,":[346],"guesses":[350],"a-priori.":[354],"Again,":[355],"case:":[362],"An":[363],"respect":[370],"multiple,":[372],"conflicting":[373],"objectives.":[374],"As":[375],"techniques,":[379],"rule":[382],"hast":[383],"trained":[386],"available":[391],"data":[393,402],"sets":[394,403],"applied":[399],"new":[401],"similar":[406],"enough":[407],"those":[409],"set.":[413]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}