Please use this identifier to cite or link to this item:
|Title:||Feature selection via set cover||Authors:||Dash, M.||Issue Date:||1997||Citation:||Dash, M. (1997). Feature selection via set cover. Proceedings of the IEEE Knowledge & Data Engineering Exchange Workshop, KDEX : 165-171. ScholarBank@NUS Repository.||Abstract:||In pattern classification, features are used to define classes. Feature selection is a preprocessing process that searches for an `optimal' subset of features. The class separability is normally used as the basic feature selection criterion. Instead of maximizing the class separability as in the literature, this work adopts a criterion aiming to maintain the discriminating power of the data describing its classes. In other words, the problem is formalized as that of finding the smallest set of features that is `consistent' in describing classes. We describe a multivariate measure of feature consistency. The new feature selection algorithm is based on Johnson's algorithm for Set Cover. Johnson's analysis implies that this algorithm runs in polynomial time, and outputs a consistent feature set whose size is within a log factor of the best possible. Our experiments show that its performance in practice is much better than this, and that it outperforms earlier methods using a similar amount of time.||Source Title:||Proceedings of the IEEE Knowledge & Data Engineering Exchange Workshop, KDEX||URI:||http://scholarbank.nus.edu.sg/handle/10635/132907|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 17, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.