Please use this identifier to cite or link to this item:
|Title:||Correntropy based feature selection using binary projection||Authors:||Yan, H.
|Keywords:||Binary projection matrix
|Issue Date:||Dec-2011||Citation:||Yan, H., Yuan, X., Yan, S., Yang, J. (2011-12). Correntropy based feature selection using binary projection. Pattern Recognition 44 (12) : 2834-2842. ScholarBank@NUS Repository. https://doi.org/10.1016/j.patcog.2011.04.014||Abstract:||Most feature selection algorithms based on information-theoretic learning (ITL) adopt ranking process or greedy search as their searching strategies. The former selects features individually so that it ignores feature interaction and dependencies. The latter heavily relies on the search paths, as only one path will be explored with no possible back-track. In addition, both strategies typically lead to heuristic algorithms. To cope with these problems, this article proposes a novel feature selection framework based on correntropy in ITL, namely correntropy based feature selection using binary projection (BPFS). Our framework selects features by projecting the original high-dimensional data to a low-dimensional space through a special binary projection matrix. The formulated objective function aims at maximizing the correntropy between selected features and class labels. And this function can be efficiently optimized via standard mathematical tools. We apply the half-quadratic method to optimize the objective function in an iterative manner, where each iteration reduces to an assignment subproblem which can be highly efficiently solved with some off-the-shelf toolboxes. Comparative experiments on six real-world datasets indicate that our framework is effective and efficient. © 2011 Elsevier Ltd. All rights reserved.||Source Title:||Pattern Recognition||URI:||http://scholarbank.nus.edu.sg/handle/10635/55458||ISSN:||00313203||DOI:||10.1016/j.patcog.2011.04.014|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 4, 2019
WEB OF SCIENCETM
checked on Nov 27, 2019
checked on Dec 1, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.