乐胖代购免代理版

{"id":"https://openalex.org/W1997541087","doi":"https://doi.org/10.1016/j.procs.2011.08.037","title":"A Clustering Method Based on Dynamic Self Organizing Trees for Post-Pareto Optimality Analysis","display_name":"A Clustering Method Based on Dynamic Self Organizing Trees for Post-Pareto Optimality Analysis","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1997541087","doi":"https://doi.org/10.1016/j.procs.2011.08.037","mag":"1997541087"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2011.08.037","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1016/j.procs.2011.08.037","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087111089","display_name":"Oswaldo Aguirre","orcid":null},"institutions":[{"id":"https://openalex.org/I164936912","display_name":"The University of Texas at El Paso","ror":"https://ror.org/04d5vba33","country_code":"US","type":"funder","lineage":["https://openalex.org/I164936912"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Oswaldo Aguirre","raw_affiliation_strings":["Computational Science Program. The Universtiry of Texas at El Paso, 500 West University, El Paso, TX 79968-0521, United States of America"],"affiliations":[{"raw_affiliation_string":"Computational Science Program. The Universtiry of Texas at El Paso, 500 West University, El Paso, TX 79968-0521, United States of America","institution_ids":["https://openalex.org/I164936912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011349015","display_name":"Heidi Taboada","orcid":"https://orcid.org/0009-0005-1535-4404"},"institutions":[{"id":"https://openalex.org/I164936912","display_name":"The University of Texas at El Paso","ror":"https://ror.org/04d5vba33","country_code":"US","type":"funder","lineage":["https://openalex.org/I164936912"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Heidi Taboada","raw_affiliation_strings":["Department of Industrial, Manufacturing and Systems Engineering. The Universtiry of Texas at El Paso, 500 West University, El Paso, TX 79968-0521, United States of America"],"affiliations":[{"raw_affiliation_string":"Department of Industrial, Manufacturing and Systems Engineering. The Universtiry of Texas at El Paso, 500 West University, El Paso, TX 79968-0521, United States of America","institution_ids":["https://openalex.org/I164936912"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":16,"citation_normalized_percentile":{"value":0.798271,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":89},"biblio":{"volume":"6","issue":null,"first_page":"195","last_page":"200"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998,"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":0.9998,"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.9992,"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/T10320","display_name":"Neural Networks and Applications","score":0.9934,"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/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.529706},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.43134418},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42974532}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7853639},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.7232169},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6713258},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.60879713},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6054107},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.529706},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.46742624},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4338646},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.43134418},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42974532},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42322683},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27178612},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16657716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16210794},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.12076855},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2011.08.037","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2011.08.037","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[{"display_name":"Peace, justice, and strong institutions","score":0.78,"id":"https://metadata.un.org/sdg/16"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":11,"referenced_works":["https://openalex.org/W1987971958","https://openalex.org/W1992809732","https://openalex.org/W1997188340","https://openalex.org/W2040613244","https://openalex.org/W2070196774","https://openalex.org/W2087255792","https://openalex.org/W2112668677","https://openalex.org/W2116993833","https://openalex.org/W2146942658","https://openalex.org/W2301266038","https://openalex.org/W2301635360"],"related_works":["https://openalex.org/W4287635425","https://openalex.org/W4240078139","https://openalex.org/W3127946984","https://openalex.org/W3094456605","https://openalex.org/W2486691257","https://openalex.org/W2292688905","https://openalex.org/W2082323286","https://openalex.org/W1997381757","https://openalex.org/W1993518163","https://openalex.org/W1971520370"],"abstract_inverted_index":{"Multiple":[0],"objective":[1,9,180],"optimization":[2,6,20,181],"involves":[3,16,42],"the":[4,19,23,39,43,49,54,58,62,66,75,87,100,115,150,153,187,190],"simultaneous":[5],"of":[7,14,35,45,53,77,89,110,143,155,189],"several":[8],"functions.":[10],"Solving":[11],"this":[12],"type":[13],"problem":[15,182],"two":[17,131],"stages;":[18],"stage":[21,29,69],"and":[22,145,157],"post-Pareto":[24,126],"analysis":[25],"stage.":[26,64],"The":[27,171],"first":[28,63],"focuses":[30,60],"in":[31,57,61,165,176,183],"obtaining":[32,74],"a":[33,96,106,122,177],"set":[34,76,102],"nondominated":[36,78],"solutions":[37],"while":[38],"second":[40],"one":[41,46,81],"selection":[44],"solution":[47,82],"from":[48,93,161],"Pareto":[50],"set.":[51],"Most":[52],"work":[55],"found":[56],"literature":[59],"However,":[65],"decision":[67],"making":[68],"is":[70,94,135,174],"as":[71,73,121],"important":[72],"solutions.":[79,111],"Selecting":[80],"over":[83],"others,":[84],"or":[85],"reducing":[86],"number":[88,109,142,154],"alternatives":[90],"to":[91,124,138,167,185],"choose":[92],"not":[95],"simple":[97],"task":[98],"since":[99],"Pareto-optimal":[101],"can":[103,158],"potentially":[104],"contain":[105],"very":[107],"large":[108],"This":[112,128],"paper":[113],"introduces":[114],"dynamic":[116],"self":[117],"organizing":[118],"tree":[119],"algorithm":[120,129,151],"method":[123,173],"perform":[125],"analysis.":[127],"offers":[130],"main":[132],"advantages:":[133],"there":[134],"no":[136],"need":[137],"provide":[139],"an":[140],"initial":[141],"clusters,":[144,156],"at":[146],"each":[147],"hierarchical":[148,163],"level,":[149],"optimizes":[152],"reassign":[159],"data":[160],"previous":[162],"levels":[164],"order":[166,184],"rearrange":[168],"misclustered":[169],"data.":[170],"proposed":[172],"tested":[175],"well-known":[178],"multiple":[179],"show":[186],"performance":[188],"algorithm.":[191]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1997541087","counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-04-18T20:05:42.831625","created_date":"2016-06-24"}