{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T19:37:56Z","timestamp":1730230676336,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,6]]},"DOI":"10.1109\/icassp39728.2021.9415005","type":"proceedings-article","created":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T19:53:45Z","timestamp":1620935625000},"page":"3635-3639","source":"Crossref","is-referenced-by-count":0,"title":["Constant Approximation Algorithm for Minimizing Concave Impurity"],"prefix":"10.1109","author":[{"given":"Thuan","family":"Nguyen","sequence":"first","affiliation":[{"name":"Oregon State University,School of EECS,Corvallis,OR,USA,97331-5501"}]},{"given":"Hoang","family":"Le","sequence":"additional","affiliation":[{"name":"Oregon State University,School of EECS,Corvallis,OR,USA,97331-5501"}]},{"given":"Thinh","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Oregon State University,School of EECS,Corvallis,OR,USA,97331-5501"}]}],"member":"263","reference":[{"key":"ref10","first-page":"448","article-title":"Low-Complexity Quantization of Discrete Memoryless Channels","author":"jiuyang zhang","year":"2016","journal-title":"Int Symp Information Theory Its Applications (ISITA)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.3035525"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3002910"},{"key":"ref13","first-page":"1","article-title":"Communication-channel optimized impurity partition","author":"nguyen","year":"2020","journal-title":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference"},{"key":"ref14","article-title":"Optimal quantizer structure for binary discrete input continuous output channels under an arbitrary quantized-output constraint","author":"nguyen","year":"2020","journal-title":"International Symposium on Information Theory (ISIT)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/VTC2020-Spring48590.2020.9128395"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/VTC2020-Spring48590.2020.9128966"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054763"},{"key":"ref18","article-title":"Minimizing impurity partition under constraints","author":"nguyen","year":"2020","journal-title":"Transaction on Communications"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2327016"},{"journal-title":"C4 5 Programs for Machine Learning","year":"2014","author":"quinlan","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3031629"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/34.88569"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009869804967"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176348789"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1991.150402"},{"key":"ref2","article-title":"Optimal mutual information quantization is np-complete","author":"mumey","year":"2003","journal-title":"Proc Neural Inf Coding (NIC) Workshop"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1201\/9781315139470"},{"key":"ref1","first-page":"1242","article-title":"New results on information theoretic clustering","author":"cicalese","year":"2019","journal-title":"International Conference on Machine Learning"},{"key":"ref20","first-page":"2860","article-title":"Binary partitions with approximate minimum impurity","author":"laber","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref22","first-page":"1265","article-title":"A divisive information-theoretic feature clustering algorithm for text classification","volume":"3","author":"dhillon","year":"2003","journal-title":"Journal of Machine Learning Research"},{"journal-title":"Elements of Information Theory","year":"2012","author":"cover","key":"ref21"},{"key":"ref24","first-page":"200","article-title":"The power of word clusters for text classification","volume":"1","author":"slonim","year":"2001","journal-title":"23rd European Colloquium on Information Retrieval Research"},{"key":"ref23","first-page":"1705","article-title":"Clustering with bregman divergences","volume":"6","author":"banerjee","year":"2005","journal-title":"Journal of Machine Learning Research"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/290941.290970"}],"event":{"name":"ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2021,6,6]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2021,6,11]]}},"container-title":["ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9413349\/9413350\/09415005.pdf?arnumber=9415005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T00:19:54Z","timestamp":1659485994000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9415005\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,6]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/icassp39728.2021.9415005","relation":{},"subject":[],"published":{"date-parts":[[2021,6,6]]}}}