{"id":"https://openalex.org/W2110760608","doi":"https://doi.org/10.1109/ddecs.2007.4295288","title":"Partitioning Optimization by Recursive Moves of Hierarchically Built Clusters","display_name":"Partitioning Optimization by Recursive Moves of Hierarchically Built Clusters","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2110760608","doi":"https://doi.org/10.1109/ddecs.2007.4295288","mag":"2110760608"},"language":"en","primary_location":{"id":"doi:10.1109/ddecs.2007.4295288","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ddecs.2007.4295288","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE Design and Diagnostics of Electronic Circuits and Systems","raw_type":"proceedings-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/A5088530992","display_name":"Roman Bazylevych","orcid":"https://orcid.org/0000-0002-7949-1353"},"institutions":[{"id":"https://openalex.org/I98435010","display_name":"Lviv Polytechnic National University","ror":"https://ror.org/0542q3127","country_code":"UA","type":"education","lineage":["https://openalex.org/I98435010"]}],"countries":["UA"],"is_corresponding":true,"raw_author_name":"Roman Bazylevych","raw_affiliation_strings":["University of Information Technology and Management, Lviv Polytechnic National University, Lviv, Ukraine","Lviv Polytech. Nat. Univ., Lviv"],"affiliations":[{"raw_affiliation_string":"University of Information Technology and Management, Lviv Polytechnic National University, Lviv, Ukraine","institution_ids":["https://openalex.org/I98435010"]},{"raw_affiliation_string":"Lviv Polytech. Nat. Univ., Lviv","institution_ids":["https://openalex.org/I98435010"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047970640","display_name":"Ihor Podolskyy","orcid":null},"institutions":[{"id":"https://openalex.org/I98435010","display_name":"Lviv Polytechnic National University","ror":"https://ror.org/0542q3127","country_code":"UA","type":"education","lineage":["https://openalex.org/I98435010"]}],"countries":["UA"],"is_corresponding":false,"raw_author_name":"Ihor Podolskyy","raw_affiliation_strings":["University of Information Technology and Management, Lviv Polytechnic National University, Lviv, Ukraine","Lviv Polytech. Nat. Univ., Lviv"],"affiliations":[{"raw_affiliation_string":"University of Information Technology and Management, Lviv Polytechnic National University, Lviv, Ukraine","institution_ids":["https://openalex.org/I98435010"]},{"raw_affiliation_string":"Lviv Polytech. Nat. Univ., Lviv","institution_ids":["https://openalex.org/I98435010"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068584153","display_name":"Lubov Bazylevych","orcid":null},"institutions":[{"id":"https://openalex.org/I98435010","display_name":"Lviv Polytechnic National University","ror":"https://ror.org/0542q3127","country_code":"UA","type":"education","lineage":["https://openalex.org/I98435010"]}],"countries":["UA"],"is_corresponding":false,"raw_author_name":"Lubov Bazylevych","raw_affiliation_strings":["University of Information Technology and Management, Lviv Polytechnic National University, Lviv, Ukraine","Lviv Polytech. Nat. Univ., Lviv"],"affiliations":[{"raw_affiliation_string":"University of Information Technology and Management, Lviv Polytechnic National University, Lviv, Ukraine","institution_ids":["https://openalex.org/I98435010"]},{"raw_affiliation_string":"Lviv Polytech. Nat. Univ., Lviv","institution_ids":["https://openalex.org/I98435010"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088530992"],"corresponding_institution_ids":["https://openalex.org/I98435010"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.14757368,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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.6637087464332581},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6476319432258606},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6302825212478638},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.5409889817237854},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5116284489631653},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.48771247267723083},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41699787974357605},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40461266040802},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.34789079427719116},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22580251097679138},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15731820464134216}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6637087464332581},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6476319432258606},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6302825212478638},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.5409889817237854},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5116284489631653},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.48771247267723083},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41699787974357605},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40461266040802},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34789079427719116},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22580251097679138},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15731820464134216},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ddecs.2007.4295288","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ddecs.2007.4295288","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE Design and Diagnostics of Electronic Circuits and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1844596588","https://openalex.org/W1977143123","https://openalex.org/W2103486643","https://openalex.org/W2120970098","https://openalex.org/W2128987859","https://openalex.org/W2145374351","https://openalex.org/W2156447148","https://openalex.org/W2158730834","https://openalex.org/W2169060214","https://openalex.org/W4242608849","https://openalex.org/W4249011143","https://openalex.org/W6684948532","https://openalex.org/W6824323157"],"related_works":["https://openalex.org/W2992415251","https://openalex.org/W4298130764","https://openalex.org/W4283765137","https://openalex.org/W2804364458","https://openalex.org/W2390808588","https://openalex.org/W2132641928","https://openalex.org/W4310225030","https://openalex.org/W2090259340","https://openalex.org/W1926736923","https://openalex.org/W3200375535"],"abstract_inverted_index":{"The":[0],"paper":[1],"presents":[2],"a":[3],"general":[4],"approach":[5],"for":[6,69],"partitioning":[7,41],"optimization":[8,44],"based":[9],"on":[10],"the":[11,15,34,45,78],"hierarchical":[12,35],"clustering":[13],"by":[14],"optimal":[16,46],"circuit":[17,37,47],"reduction":[18,48],"(OCR)":[19],"method.":[20],"This":[21],"method":[22],"has":[23],"proved":[24],"to":[25,32,75],"be":[26],"robust,":[27],"effective":[28],"and":[29,42,55,61],"efficient":[30,73],"tool":[31],"identify":[33],"clusters":[36,60],"structure.":[38],"For":[39],"initial":[40],"its":[43],"trees":[49],"are":[50,67,81],"used.":[51],"Recursive":[52],"moves":[53],"(transfers":[54],"exchanges)":[56],"of":[57,64],"hierarchically":[58],"built":[59],"their":[62],"groups":[63],"arbitrary":[65],"sizes":[66],"performed":[68],"optimization.":[70],"Some":[71],"new":[72],"procedures":[74],"escape":[76],"from":[77],"local":[79],"optima":[80],"suggested.":[82]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}