View in EDS

Feature selection in possibilistic modeling.

Saved in:

Bibliographic Details
Title:	Feature selection in possibilistic modeling.
Authors:	Ammar Bouhamed, S.¹ sonda.ammar@gmail.com, Khanfir Kallel, I.¹ imen.khanfir.kallel@gmail.com, Sellami Masmoudi, D.¹ dorra.masmoudi@enis.rnu.tn, Solaiman, B.² basel.solaiman@telecom-bretagne.eu
Source:	Pattern Recognition. Nov2015, Vol. 48 Issue 11, p3627-3640. 14p.
Subjects:	Feature selection, Mathematical models, Computational complexity, Set theory, Distribution (Probability theory)
Abstract:	Feature selection is becoming increasingly important for the reduction of computing complexity. In this context, conventional approaches have random performances, because They can succeed for some contexts and fail for others. Possibilistic modeling is a powerful paradigm being able to handle data imperfection or redundancy and is not affected by data variability. Therefore, in this paper, we propose a new feature selection strategy for possibilitic modeling. The proposed approach is based on two issues in order to extract relevant features: the measure of feature importance as well as the possibility distribution uncertainty degree. The importance of one feature can be considered under two aspects: The first one is related to the scattering within one class and the second one reflects the feature power for class discrimination. Therefore, we apply, here, Shapley index paradigm which selects features who minimize the intra-class distance and who maximize the inter-class distance. The previous process is refined using possibility distribution uncertainty degree in order to resolve some conflict problems between feature׳s importance values. [ABSTRACT FROM AUTHOR]
	Copyright of Pattern Recognition is the property of Pergamon Press - An Imprint of Elsevier Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	Feature selection is becoming increasingly important for the reduction of computing complexity. In this context, conventional approaches have random performances, because They can succeed for some contexts and fail for others. Possibilistic modeling is a powerful paradigm being able to handle data imperfection or redundancy and is not affected by data variability. Therefore, in this paper, we propose a new feature selection strategy for possibilitic modeling. The proposed approach is based on two issues in order to extract relevant features: the measure of feature importance as well as the possibility distribution uncertainty degree. The importance of one feature can be considered under two aspects: The first one is related to the scattering within one class and the second one reflects the feature power for class discrimination. Therefore, we apply, here, Shapley index paradigm which selects features who minimize the intra-class distance and who maximize the inter-class distance. The previous process is refined using possibility distribution uncertainty degree in order to resolve some conflict problems between feature׳s importance values. [ABSTRACT FROM AUTHOR]
ISSN:	00313203
DOI:	10.1016/j.patcog.2015.03.015