Maximum relevancy maximum complementary feature selection for multi-sensor activity recognition

Article English OPEN
Chernbumroong, S. ; Cang, Shuang ; Yu, Hongnian (2015)

In the multi-sensor activity recognition domain, the input space is often large and contains irrelevant and overlapped features. It is important to perform feature selection in order to select the smallest number of features which can describe the outputs. This paper proposes a new feature selection algorithms using the maximal relevance and maximal complementary (MRMC) based on neural networks. Unlike other feature selection algorithms that are based on relevance and redundancy measurements, the idea of how a feature complements to the already selected features is utilized. The proposed algorithm is evaluated on two well-defined problems and five real world data sets. The data sets cover different types of data i.e. real, integer and category and sizes i.e. small to large set of features. The experimental results show that the MRMC can select a smaller number of features while achieving good results. The proposed algorithm can be applied to any type of data, and demonstrate great potential for the data set with a large number of features.
  • References (11)
    11 references, page 1 of 2

    [10] M. M. Kabir, M. M. Islam, K. Murase, A new wrapper feature selection approach using neural network, Neurocomputing 73 (2010) 3273 - 3283.

    [11] Y. Saeys, I. Inza, P. Larraaga, A review of feature selection techniques in bioinformatics, Bioinformatics 23 (2007) 2507-2517.

    [12] P. Estevez, M. Tesmer, C. Perez, J. Zurada, Normalized mutual information feature selection, Neural Networks, IEEE Transactions on 20 (2009) 189-201.

    [13] J.-X. Peng, S. Ferguson, K. Rafferty, P. D. Kelly, An efficient feature selection method for mobile devices with application to activity recognition, Neurocomputing 74 (2011) 3543 - 3552.

    [14] A. Dalton, G. Olaighin, Comparing supervised learning techniques on the task of physical activity recognition, Biomedical and Health Informatics, IEEE Journal of 17 (2013) 46-52.

    multi-class support vector machines, Optimization Methods and Software 22 (2007) 225-236.

    [26] A. Antos, B. KĀ“egl, T. Linder, G. Lugosi, Data-dependent margin-based generalization bounds for classification, J. Mach. Learn. Res. 3 (2003) 73-98.

    [27] K. P. Bennett, O. L. Mangasarian, Robust linear programming discrimination of two linearly inseparable sets, 1992.

    [28] D. Ayres-de campos, J. Bernardes, A. Garrido, J. Marques-de s, L. Pereira-leite, Sisporto 2.0: A program for automated analysis of cardiotocograms, Journal of Maternal-Fetal and Neonatal Medicine 9 (2000) 311-318.

    [29] B. Kijsirikul, S. Sinthupinyo, K. Chongkasemwongse, Approximate match of rules using backpropagation neural networks, Machine Learning 44 (2001) 273-299.

  • Metrics
    views in OpenAIRE
    views in local repository
    downloads in local repository

    The information is available from the following content providers:

    From Number Of Views Number Of Downloads
    Bournemouth University Research Online - IRUS-UK 0 236
Share - Bookmark