SENSOR (GROUP FEATURE) SELECTION WITH CONTROLLED REDUNDANCY IN A CONNECTIONIST FRAMEWORK

Rudrasis Chakraborty, Chin-Teng Lin, Nikhil R. Pal

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

For many applications, to reduce the processing time and the cost of decision making, we need to reduce the number of sensors, where each sensor produces a set of features. This sensor selection problem is a generalized feature selection problem. Here, we first present a sensor (group-feature) selection scheme based on Multi-Layered Perceptron Networks. This scheme sometimes selects redundant groups of features. So, we propose a selection scheme which can control the level of redundancy between the selected groups. The idea is general and can be used with any learning scheme. We have demonstrated the effectiveness of our scheme on several data sets. In this context, we define different measures of sensor dependency (dependency between groups of features). We have also presented an alternative learning scheme which is more effective than our old scheme. The proposed scheme is also adapted to radial basis function (RBS) network. The advantages of our scheme are threefold. It looks at all the groups together and hence can exploit nonlinear interaction between groups, if any. Our scheme can simultaneously select useful groups as well as learn the underlying system. The level of redundancy among groups can also be controlled.
Original languageEnglish
Article number 1450021
JournalInternational Journal of Neural Systems
Volume24
Issue number6
DOIs
StatePublished - Sep 2014

Keywords

  • FUNCTION NEURAL-NETWORK; MUTUAL INFORMATION; GENE SELECTION; CLASSIFICATION; MODEL; EPILEPSY; DEPENDENCY; ALGORITHM; RELEVANCE; VARIABLES

Fingerprint Dive into the research topics of 'SENSOR (GROUP FEATURE) SELECTION WITH CONTROLLED REDUNDANCY IN A CONNECTIONIST FRAMEWORK'. Together they form a unique fingerprint.

Cite this