Neighborhood Component Feature Selection for High-Dimensional Data

Citations Over Time

Abstract

Feature selection is of considerable importance in data mining and machine learning, especially for high dimensional data. In this paper, we propose a novel nearest neighbor-based feature weighting algorithm, which learns a feature weighting vector by maximizing the expected leave-one-out classification accuracy with a regularization term. The algorithm makes no parametric assumptions about the distribution of the data and scales naturally to multiclass problems. Experiments conducted on artificial and real data sets demonstrate that the proposed algorithm is largely insensitive to the increase in the number of irrelevant features and performs better than the state-of-the-art methods in most cases.

Related Papers

• → Driver Reaction Acceptance and Evaluation to Abnormal Driving Situations(2018)6 cited
• Component Description Model in the Internet Environment(2006)
• An Analysis of General Component, Proper Component and Across-Genre Component in Genre(2005)
• Combine Component Based on Dynamic Component(2005)
• Research on Intelligent Agent Technology of Component Assembling Based on Active Services(2009)