Joint Feature Transformation and Selection Based on Dempster-Shafer Theory

In statistical pattern recognition, feature transformation attempts to change original feature space to a low-dimensional subspace, in which new created features are discriminative and non-redundant, thus improving the predictive power and generalization ability of subsequent classification models. Traditional transformation methods are not designed specifically for tackling data containing unreliable and noisy input features. To deal with these inputs, a new approach based on Dempster-Shafer Theory is proposed in this paper. A specific loss function is constructed to learn the transformation matrix, in which a sparsity term is included to realize joint feature selection during transformation, so as to limit the influence of unreliable input features on the output low-dimensional subspace. The proposed method has been evaluated by several synthetic and real datasets, showing good performance.

[1]  Thierry Denoeux,et al.  An evidence-theoretic k-NN rule with parameter optimization , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[2]  Kilian Q. Weinberger,et al.  Distance Metric Learning for Large Margin Nearest Neighbor Classification , 2005, NIPS.

[3]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[4]  Stéphane Perrin,et al.  Combination of Sugeno fuzzy system and evidence theory for NAO robot in colors recognition , 2015, 2015 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE).

[5]  Thierry Denoeux,et al.  EK-NNclus: A clustering procedure based on the evidential K-nearest neighbor rule , 2015, Knowl. Based Syst..

[6]  Quan Pan,et al.  A New Incomplete Pattern Classification Method Based on Evidential Reasoning , 2015, IEEE Transactions on Cybernetics.

[7]  Alessandro Saffiotti,et al.  The Transferable Belief Model , 1991, ECSQARU.

[8]  Quan Pan,et al.  Median evidential c-means algorithm and its application to community detection , 2015, Knowl. Based Syst..

[9]  Thierry Denoeux,et al.  ECM: An evidential version of the fuzzy c , 2008, Pattern Recognit..

[10]  Thierry Denoeux,et al.  An evidential classifier based on feature selection and two-step classification strategy , 2015, Pattern Recognit..

[11]  Thierry Denoeux,et al.  Fusion of multi-tracer PET images for dose painting , 2014, Medical Image Anal..

[12]  Thierry Denoeux,et al.  Dempster-Shafer Theory Based Feature Selection with Sparse Constraint for Outcome Prediction in Cancer Therapy , 2015, MICCAI.

[13]  Yong Wang,et al.  Online active learning of decision trees with evidential data , 2016, Pattern Recognit..

[14]  Olivier Colot,et al.  Introducing spatial neighbourhood in Evidential C-Means for segmentation of multi-source images: Application to prostate multi-parametric MRI , 2014, Inf. Fusion.

[15]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[16]  Fan Wang,et al.  Post-aggregation stereo matching method using Dempster-Shafer theory , 2014, 2014 IEEE International Conference on Image Processing (ICIP).

[17]  Quan Pan,et al.  Belief rule-based classification system: Extension of FRBCS in belief functions framework , 2015, Inf. Sci..

[18]  Bernhard Schölkopf,et al.  Use of the Zero-Norm with Linear Models and Kernel Methods , 2003, J. Mach. Learn. Res..

[19]  Philippe Smets,et al.  Classification Using Belief Functions: Relationship Between Case-Based and Model-Based Approaches , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[20]  Thierry Denoeux A k -Nearest Neighbor Classification Rule Based on Dempster-Shafer Theory , 2008, Classic Works of the Dempster-Shafer Theory of Belief Functions.

[21]  Geoffrey E. Hinton,et al.  Neighbourhood Components Analysis , 2004, NIPS.