A fast algorithm for local feature selection in data classification. Issue 3 (6th March 2019)

• Record Type: Journal Article
• Authors: Hoseininejad, Fereshteh Sadat; Forghani, Yahya; Ehsani, Omid
• Other Names: Rocha Álvaro guestEditor.; Anwar Sajid guestEditor.
• Is Part Of: Expert systems. Volume 36:Issue 3(2019)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2019-03-06
• Subjects: closed‐form solution -- localized feature selection (LFS) -- randomized rounding -- relaxation technique; Expert systems (Computer science); 006.33
• DOI: 10.1111/exsy.12391
• Languages: English
• ISSNs: 0266-4720

Abstract

Abstract: Typical feature selection methods select a global feature subset that is applied over all regions of the sample space. In localized feature selection (LFS), each region of the sample space is associated with its own optimized feature subset. This allows the feature subset to adapt to local variations in the sample space. Feature subsets are selected such that within a localized region, within‐class distances are minimized and between‐class distances are maximized. LFS outperforms global feature selection methods. LFS is solved using a randomized rounding approach when weights of regions are fixed. Randomized rounding is a too time‐consuming algorithm. In this paper, we show that LFS has a closed‐form solution when weights of regions are fixed. Using this closed‐form solution can decrease the runtime of solving LFS substantially. Experimental results on real datasets confirm that the classification error rate of our proposed method and the randomized rounding‐based method are the same; the runtime of our proposed method is much better than that of the randomized rounding‐based method; and the classification error rate of our proposed method and the randomized rounding‐based method outperforms the state‐of‐the‐art feature selection methods.