Constant Approximation Algorithm for Minimizing Concave Impurity

Partitioning algorithms play a key role in many scientific and engineering disciplines. A partitioning algorithm divides a set into a number of disjoint subsets or partitions. Often, the quality of the resulted partitions is measured by the amount of impurity in each partition, the smaller impurity...

Full description

Bibliographic Details

Published in:	Proceedings of the ... IEEE International Conference on Acoustics, Speech and Signal Processing (1998) pp. 3635 - 3639
Main Authors:	Nguyen, Thuan, Le, Hoang, Nguyen, Thinh
Format:	Conference Proceeding
Language:	English
Published:	IEEE 06.06.2021
Subjects:	approximation Approximation algorithms Conferences Entropy Impurities impurity Partition Partitioning algorithms Signal processing Signal processing algorithms
ISSN:	2379-190X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!