{"id":"https://openalex.org/W3016253806","doi":"https://doi.org/10.1109/icassp40776.2020.9054763","title":"A Linear Time Partitioning Algorithm for Frequency Weighted Impurity Functions","display_name":"A Linear Time Partitioning Algorithm for Frequency Weighted Impurity Functions","publication_year":2020,"publication_date":"2020-04-09","ids":{"openalex":"https://openalex.org/W3016253806","doi":"https://doi.org/10.1109/icassp40776.2020.9054763","mag":"3016253806"},"language":"en","primary_location":{"id":"doi:10.1109/icassp40776.2020.9054763","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp40776.2020.9054763","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2020 - 2020 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":["School of EECS, Oregon State University, Corvallis, OR, USA"],"affiliations":[{"raw_affiliation_string":"School of EECS, Oregon State University, Corvallis, OR, USA","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089127605","display_name":"Thinh Nguyen","orcid":"https://orcid.org/0000-0001-5336-5773"},"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":["School of EECS, Oregon State University, Corvallis, OR, USA"],"affiliations":[{"raw_affiliation_string":"School of EECS, Oregon State University, Corvallis, OR, USA","institution_ids":["https://openalex.org/I131249849"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103267786"],"corresponding_institution_ids":["https://openalex.org/I131249849"],"apc_list":null,"apc_paid":null,"fwci":0.9251,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76279835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"59","issue":null,"first_page":"5375","last_page":"5379"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9975000023841858,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9965000152587891,"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/cluster-analysis","display_name":"Cluster analysis","score":0.5785632729530334},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5233844518661499},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5036787390708923},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4771965444087982},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.43536576628685},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4048752784729004},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36780545115470886},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.290000855922699},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09229320287704468}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5785632729530334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5233844518661499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5036787390708923},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4771965444087982},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.43536576628685},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4048752784729004},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36780545115470886},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.290000855922699},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09229320287704468}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp40776.2020.9054763","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp40776.2020.9054763","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2020 - 2020 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":35,"referenced_works":["https://openalex.org/W1532880632","https://openalex.org/W1644328877","https://openalex.org/W1686946872","https://openalex.org/W2080209778","https://openalex.org/W2082896932","https://openalex.org/W2096765209","https://openalex.org/W2125055259","https://openalex.org/W2135579862","https://openalex.org/W2164368671","https://openalex.org/W2169528353","https://openalex.org/W2583360924","https://openalex.org/W2804756264","https://openalex.org/W2884108386","https://openalex.org/W2946564624","https://openalex.org/W2962702487","https://openalex.org/W2978067824","https://openalex.org/W2996942366","https://openalex.org/W2997411276","https://openalex.org/W2999140884","https://openalex.org/W2999538300","https://openalex.org/W3000361376","https://openalex.org/W3000704864","https://openalex.org/W4250589301","https://openalex.org/W4287906252","https://openalex.org/W4297957988","https://openalex.org/W6637108112","https://openalex.org/W6674201379","https://openalex.org/W6752165900","https://openalex.org/W6763526042","https://openalex.org/W6772226806","https://openalex.org/W6772295492","https://openalex.org/W6772397019","https://openalex.org/W6772480181","https://openalex.org/W6773067411","https://openalex.org/W6773479446"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W4298130764","https://openalex.org/W2804364458","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2132641928","https://openalex.org/W2181413294","https://openalex.org/W4310225030"],"abstract_inverted_index":{"Partitioning":[0],"algorithms":[1,55],"play":[2],"a":[3,31,37,82,94,113,116],"key":[4],"role":[5],"in":[6,16,133],"machine":[7],"learning,":[8],"signal":[9],"processing,":[10],"and":[11,25,64,108],"communications.":[12],"They":[13],"are":[14,61],"used":[15],"many":[17],"well-known":[18,117],"NP-hard":[19],"problems":[20],"such":[21,74,104],"as":[22,75,105],"k-means":[23],"clustering":[24],"vector":[26],"quantization.":[27],"The":[28,45],"goodness":[29],"of":[30,69,97,137],"partition":[32,47],"scheme":[33],"is":[34,48],"measured":[35],"by":[36,130],"given":[38,71],"impurity":[39,72,92,98],"function":[40,73],"over":[41],"the":[42,51,70,90,122,127,134,138],"resulted":[43],"partitions.":[44],"optimal":[46,59,123],"one(s)":[49],"with":[50],"minimum":[52,91],"impurity.":[53],"Practical":[54],"for":[56,88,93],"finding":[57,89],"an":[58],"partitioning":[60],"approximate,":[62],"heuristic,":[63,83],"often":[65],"assume":[66],"certain":[67],"properties":[68],"concavity/convexity.":[76],"In":[77],"this":[78],"paper,":[79],"we":[80],"propose":[81],"efficient":[84],"(linear":[85],"time)":[86],"algorithm":[87],"broader":[95],"class":[96],"functions":[99],"which":[100,119],"includes":[101],"popular":[102],"impurities":[103],"Gini":[106],"index":[107],"entropy.":[109],"We":[110],"also":[111],"make":[112],"connection":[114],"to":[115,126],"result":[118],"states":[120],"that":[121],"partitions":[124],"correspond":[125],"regions":[128],"separated":[129],"hyperplane":[131],"cuts":[132],"probability":[135],"space":[136],"posterior":[139],"distribution.":[140]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}