Consistent and Efficient Nonparametric Different-Feature Selection

Two-sample feature selection is a ubiquitous problem in both scientific and engineering studies. We propose a feature selection method to find features that describe a difference in two probability distributions. The proposed method is nonparametric and does not assume any specific parametric models on data distributions. We show that the proposed method is computationally efficient and does not require any extra computation for model selection. Moreover, we prove that the proposed method provides a consistent estimator of features under mild conditions. Our experimental results show that the proposed method outperforms the current method with regard to both accuracy and computation time.

[1]  田口 玄一,et al.  New Trends in Multivariate Diagnosis , 2001 .

[2]  Kenji Yamanishi,et al.  Network anomaly detection based on Eigen equation compression , 2009, KDD.

[3]  Takashi Washio,et al.  Anomaly detection in reconstructed quantum states using a machine-learning technique , 2014, 1401.4785.

[4]  Hongliang Fei,et al.  Anomaly localization for network data streams with graph joint sparse PCA , 2011, KDD.

[5]  Alison L Gibbs,et al.  On Choosing and Bounding Probability Metrics , 2002, math/0209021.

[6]  Honglak Lee,et al.  Efficient L1 Regularized Logistic Regression , 2006, AAAI.

[7]  Tommi S. Jaakkola,et al.  Principal Differences Analysis: Interpretable Characterization of Differences between Distributions , 2015, NIPS.

[8]  Qing Wang,et al.  Divergence Estimation for Multidimensional Densities Via $k$-Nearest-Neighbor Distances , 2009, IEEE Transactions on Information Theory.

[9]  Y. Benjamini,et al.  Controlling the false discovery rate: a practical and powerful approach to multiple testing , 1995 .

[10]  Bernhard Schölkopf,et al.  A Kernel Two-Sample Test , 2012, J. Mach. Learn. Res..

[11]  Taiji Suzuki,et al.  A Consistent Method for Graph Based Anomaly Localization , 2015, AISTATS.

[12]  Marin Bougeret,et al.  Approximating the Sparsest k-Subgraph in Chordal Graphs , 2013, WAOA.

[13]  Davide Anguita,et al.  Machine learning approaches for improving condition-based maintenance of naval propulsion plants , 2016 .

[14]  Spiros Papadimitriou,et al.  Computing Correlation Anomaly Scores Using Stochastic Nearest Neighbors , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

[15]  Naoki Abe,et al.  Proximity-Based Anomaly Detection Using Sparse Structure Learning , 2009, SDM.

[16]  Russell A. Brown,et al.  Building a Balanced k-d Tree in O(kn log n) Time , 2014, ArXiv.