{"id":"https://openalex.org/W3161372444","doi":"https://doi.org/10.1109/icassp39728.2021.9415005","title":"Constant Approximation Algorithm for Minimizing Concave Impurity","display_name":"Constant Approximation Algorithm for Minimizing Concave Impurity","publication_year":2021,"publication_date":"2021-05-13","ids":{"openalex":"https://openalex.org/W3161372444","doi":"https://doi.org/10.1109/icassp39728.2021.9415005","mag":"3161372444"},"language":"en","primary_location":{"id":"doi:10.1109/icassp39728.2021.9415005","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp39728.2021.9415005","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","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/A5103267786","display_name":"Thuan Nguyen","orcid":"https://orcid.org/0000-0003-3064-7609"},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Thuan Nguyen","raw_affiliation_strings":["Oregon State University,School of EECS,Corvallis,OR,USA,97331-5501"],"affiliations":[{"raw_affiliation_string":"Oregon State University,School of EECS,Corvallis,OR,USA,97331-5501","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112863745","display_name":"Hoang Le","orcid":"https://orcid.org/0000-0002-5908-0733"},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hoang Le","raw_affiliation_strings":["Oregon State University,School of EECS,Corvallis,OR,USA,97331-5501"],"affiliations":[{"raw_affiliation_string":"Oregon State University,School of EECS,Corvallis,OR,USA,97331-5501","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075106229","display_name":"Thinh Nguyen","orcid":"https://orcid.org/0000-0001-5964-5872"},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thinh Nguyen","raw_affiliation_strings":["Oregon State University,School of EECS,Corvallis,OR,USA,97331-5501"],"affiliations":[{"raw_affiliation_string":"Oregon State University,School of EECS,Corvallis,OR,USA,97331-5501","institution_ids":["https://openalex.org/I131249849"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103267786"],"corresponding_institution_ids":["https://openalex.org/I131249849"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0647771,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"3635","last_page":"3639"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/disjoint-sets","display_name":"Disjoint sets","score":0.7211803197860718},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6939197778701782},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6878499388694763},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5730823278427124},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5626724362373352},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.49033164978027344},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47166264057159424},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45789653062820435},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.447128564119339},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44435402750968933},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42541152238845825},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3536917567253113}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7211803197860718},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6939197778701782},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6878499388694763},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5730823278427124},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5626724362373352},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.49033164978027344},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47166264057159424},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45789653062820435},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.447128564119339},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44435402750968933},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42541152238845825},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3536917567253113},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp39728.2021.9415005","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp39728.2021.9415005","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","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":34,"referenced_works":["https://openalex.org/W1595613095","https://openalex.org/W2064580901","https://openalex.org/W2080209778","https://openalex.org/W2082896932","https://openalex.org/W2096765209","https://openalex.org/W2099111195","https://openalex.org/W2125055259","https://openalex.org/W2135579862","https://openalex.org/W2138570191","https://openalex.org/W2169528353","https://openalex.org/W2210387432","https://openalex.org/W2583360924","https://openalex.org/W2804756264","https://openalex.org/W2946564624","https://openalex.org/W2962702487","https://openalex.org/W2997411276","https://openalex.org/W3000704864","https://openalex.org/W3016253806","https://openalex.org/W3036930198","https://openalex.org/W3039417385","https://openalex.org/W3039913603","https://openalex.org/W3096903942","https://openalex.org/W3114784257","https://openalex.org/W3123110187","https://openalex.org/W4287906252","https://openalex.org/W4297957988","https://openalex.org/W6635548358","https://openalex.org/W6674201379","https://openalex.org/W6680765659","https://openalex.org/W6752165900","https://openalex.org/W6763526042","https://openalex.org/W6772295492","https://openalex.org/W6772480181","https://openalex.org/W6788814645"],"related_works":["https://openalex.org/W2015634066","https://openalex.org/W2048339306","https://openalex.org/W2028295504","https://openalex.org/W3046629113","https://openalex.org/W4377371889","https://openalex.org/W2962917430","https://openalex.org/W1598028160","https://openalex.org/W2028468530","https://openalex.org/W1862126075","https://openalex.org/W2113623403"],"abstract_inverted_index":{"Partitioning":[0],"algorithms":[1,111],"play":[2],"a":[3,16,19,61,82,130],"key":[4],"role":[5],"in":[6,40,60,157],"many":[7,99,109,160],"scientific":[8],"and":[9,63,106,163],"engineering":[10],"disciplines.":[11],"A":[12],"partitioning":[13],"algorithm":[14,133,150],"divides":[15],"set":[17,62],"into":[18],"number":[20,56,67],"of":[21,29,38,49,57,68,88,104,147],"disjoint":[22],"subsets":[23],"or":[24],"partitions.":[25,51],"Often,":[26],"the":[27,30,36,43,46,50,55,66,77,86,122,139,144,148,154,165,172],"quality":[28,48],"resulted":[31],"partitions":[32,79],"is":[33,151,175],"measured":[34],"by":[35],"amount":[37],"impurity":[39,45,161],"each":[41],"partition,":[42],"smaller":[44],"higher":[47],"Let":[52],"M":[53],"be":[54,65],"N-dimensional":[58],"elements":[59],"K":[64,105,169],"desired":[69],"partitions,":[70],"then":[71],"an":[72],"exhaustive":[73],"search":[74],"over":[75],"all":[76],"possible":[78],"to":[80,183],"find":[81],"minimum":[83],"partition":[84],"has":[85],"complexity":[87,115,174],"O(K":[89],"<sup":[90,179],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[91,180],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">M</sup>":[92],")":[93,182],"which":[94],"quickly":[95],"becomes":[96],"impractical":[97],"for":[98,159,168],"applications":[100],"with":[101,112,134],"modest":[102],"values":[103],"M.":[107],"Thus,":[108],"approximate":[110],"polynomial":[113],"time":[114,132],"have":[116],"been":[117],"proposed,":[118],"but":[119],"few":[120],"provide":[121],"bounded":[123,135],"guarantee.":[124],"In":[125],"this":[126],"paper,":[127],"we":[128],"propose":[129],"linear":[131],"guarantee":[136,145],"based":[137],"on":[138],"maximum":[140],"likelihood":[141],"principle.":[142],"Furthermore,":[143],"bound":[146],"proposed":[149],"better":[152],"than":[153],"state-of-the-art":[155],"method":[156],"[1]":[158],"functions,":[162],"at":[164],"same":[166],"time,":[167],"\u2265":[170],"N,":[171],"computational":[173],"reduced":[176],"from":[177],"O(M":[178],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">3</sup>":[181],"O(M).":[184]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}