{"id":"https://openalex.org/W2088971137","doi":"https://doi.org/10.1142/s1469026811003112","title":"A CLUSTERING-BASED NICHING FRAMEWORK FOR THE APPROXIMATION OF EQUIVALENT PARETO-SUBSETS","display_name":"A CLUSTERING-BASED NICHING FRAMEWORK FOR THE APPROXIMATION OF EQUIVALENT PARETO-SUBSETS","publication_year":2011,"publication_date":"2011-09-01","ids":{"openalex":"https://openalex.org/W2088971137","doi":"https://doi.org/10.1142/s1469026811003112","mag":"2088971137"},"language":"en","primary_location":{"id":"doi:10.1142/s1469026811003112","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1469026811003112","pdf_url":null,"source":{"id":"https://openalex.org/S206936884","display_name":"International Journal of Computational Intelligence and Applications","issn_l":"1469-0268","issn":["1469-0268","1757-5885"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence and Applications","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/A5103020462","display_name":"Oliver Kr\u00e4mer","orcid":"https://orcid.org/0000-0001-7607-1700"},"institutions":[{"id":"https://openalex.org/I129877168","display_name":"Carl von Ossietzky Universit\u00e4t Oldenburg","ror":"https://ror.org/033n9gh91","country_code":"DE","type":"education","lineage":["https://openalex.org/I129877168"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"OLIVER KRAMER","raw_affiliation_strings":["Department of Computer Science, Carl von Ossietzky University Oldenburg, Uhlhornsweg 84, 26111 Oldenburg, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Carl von Ossietzky University Oldenburg, Uhlhornsweg 84, 26111 Oldenburg, Germany","institution_ids":["https://openalex.org/I129877168"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074017762","display_name":"Holger Danielsiek","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"HOLGER DANIELSIEK","raw_affiliation_strings":["TU Dortmund, Department of Computer Science, Otto-Hahn-Str. 14, 44221 Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"TU Dortmund, Department of Computer Science, Otto-Hahn-Str. 14, 44221 Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103020462"],"corresponding_institution_ids":["https://openalex.org/I129877168"],"apc_list":null,"apc_paid":null,"fwci":0.6277,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.69961307,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"10","issue":"03","first_page":"295","last_page":"311"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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.998199999332428,"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/T11053","display_name":"Process Optimization and Integration","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7568964958190918},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.7384523153305054},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7010589241981506},{"id":"https://openalex.org/keywords/dbscan","display_name":"DBSCAN","score":0.6444628834724426},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5553784966468811},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5270612239837646},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.5130561590194702},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.48693931102752686},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4112307131290436},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22535336017608643},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.18485358357429504},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.1734907627105713},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.10080292820930481}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7568964958190918},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.7384523153305054},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7010589241981506},{"id":"https://openalex.org/C46576248","wikidata":"https://www.wikidata.org/wiki/Q1114630","display_name":"DBSCAN","level":5,"score":0.6444628834724426},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5553784966468811},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5270612239837646},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.5130561590194702},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.48693931102752686},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4112307131290436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22535336017608643},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.18485358357429504},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.1734907627105713},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.10080292820930481},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1469026811003112","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1469026811003112","pdf_url":null,"source":{"id":"https://openalex.org/S206936884","display_name":"International Journal of Computational Intelligence and Applications","issn_l":"1469-0268","issn":["1469-0268","1757-5885"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1525375343","https://openalex.org/W1534682696","https://openalex.org/W1572960541","https://openalex.org/W1576660662","https://openalex.org/W1582055249","https://openalex.org/W1595498733","https://openalex.org/W1606852530","https://openalex.org/W1612556207","https://openalex.org/W1659842140","https://openalex.org/W1673310716","https://openalex.org/W1905847227","https://openalex.org/W2007364060","https://openalex.org/W2008002935","https://openalex.org/W2038420231","https://openalex.org/W2066327002","https://openalex.org/W2086578213","https://openalex.org/W2096590200","https://openalex.org/W2105899518","https://openalex.org/W2106334424","https://openalex.org/W2116661285","https://openalex.org/W2116961716","https://openalex.org/W2118020555","https://openalex.org/W2125502051","https://openalex.org/W2126105956","https://openalex.org/W2144481507","https://openalex.org/W2277452449","https://openalex.org/W2315047081","https://openalex.org/W2798766386","https://openalex.org/W2904250082","https://openalex.org/W3023540311","https://openalex.org/W3140662957"],"related_works":["https://openalex.org/W3176449234","https://openalex.org/W2807508722","https://openalex.org/W2353158678","https://openalex.org/W2767235736","https://openalex.org/W4225278791","https://openalex.org/W2045002201","https://openalex.org/W2971352445","https://openalex.org/W4322502698","https://openalex.org/W2604015980","https://openalex.org/W2090178682"],"abstract_inverted_index":{"In":[0,57],"many":[1],"optimization":[2,88],"problems":[3,18],"in":[4,28],"practice,":[5],"multiple":[6,22],"objectives":[7],"have":[8],"to":[9,42,46,49,72,83,118],"be":[10,47],"optimized":[11],"at":[12,25],"the":[13,39,77,81,86,112],"same":[14],"time.":[15],"Some":[16],"multi-objective":[17,67,87],"are":[19],"characterized":[20],"by":[21],"connected":[23],"Pareto-sets":[24],"different":[26,55],"parts":[27],"decision":[29],"space":[30],"\u2014":[31],"also":[32],"called":[33],"equivalent":[34,74,122],"Pareto-subsets.":[35,75,123],"We":[36],"assume":[37],"that":[38,70,111],"practitioner":[40],"wants":[41],"approximate":[43,73,121],"all":[44],"Pareto-subsets":[45],"able":[48],"choose":[50],"among":[51],"various":[52],"solutions":[53],"with":[54],"characteristics.":[56],"this":[58],"work,":[59],"we":[60],"propose":[61],"a":[62],"clustering-based":[63],"niching":[64,113],"framework":[65,114],"for":[66],"population-based":[68],"approaches":[69],"allows":[71,115],"Iteratively,":[76],"clustering":[78,109],"process":[79,89],"assigns":[80],"population":[82],"niches,":[84],"and":[85,100,106,120],"concentrates":[90],"on":[91],"each":[92],"niche":[93],"independently.":[94],"Two":[95],"exemplary":[96],"hybridizations,":[97],"rake":[98],"selection":[99],"DBSCAN,":[101],"as":[102,104],"well":[103],"SMS-EMOA":[105],"kernel":[107],"density":[108],"demonstrate":[110],"enough":[116],"diversity":[117],"detect":[119]},"counts_by_year":[{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}