2014 · 36 citations · 21 references
This paper presents a parallel feature selection method for classification that scales up to very high dimensions and large data sizes. Our original method is inspired by group testing theory, under which the feature selection procedure consists of a collection of randomized tests to be performed in parallel. Each test corresponds to a subset of features, for which a scoring function may be applied to measure the relevance of the features in a classification task. We develop a general the-ory providing sufficient conditions under which true features are guaranteed to be correctly identified. Superior performance of our method is demonstrated on a challenging relation extraction task from a very large data set that have both redundant features and sample size in the order of millions. We present compre-hensive comparisons with state-of-the-art feature selection methods on a range of data sets, for which our method exhibits competitive performance in terms of run-ning time and accuracy. Moreover, it also yields substantial speedup when used as a pre-processing step for most other existing methods. 1
21
Wrappers for feature subset selection
Ron Kohavi, George H. John · Artificial Intelligence · 1997 · 8.8K citations
Applied Physics Letters · 2000 · 3.6K citations · Full text
Distant supervision for relation extraction without labeled data
Mike D. Mintz, Steven Bills, Rion Snow et al. · 2009 · 2.9K citations · Full text