Fast Resampling Weighted v-Statistics

In this paper, a novel and computationally fast algorithm for computing weighted v-statistics in resampling both univariate and multivariate data is proposed. To avoid any real resampling, we have linked this problem with finite group action and converted it into a problem of orbit enumeration. For further computational cost reduction, an efficient method is developed to list all orbits by their symmetry orders and calculate all index function orbit sums and data function orbit sums recursively. The computational complexity analysis shows reduction in the computational cost from n! or nn level to low-order polynomial level.

[1]  Han Liu,et al.  Blockwise coordinate descent procedures for the multi-task lasso, with applications to neural semantic basis discovery , 2009, ICML '09.

[2]  Bernhard Schölkopf,et al.  A Kernel Method for the Two-Sample-Problem , 2006, NIPS.

[3]  J. Hopcroft,et al.  Efficient algorithms for graph manipulation , 1971 .

[4]  Tony Jebara,et al.  Multi-object tracking with representations of the symmetric group , 2007, AISTATS.

[5]  John Shawe-Taylor,et al.  A PAC-Bayes Bound for Tailored Density Estimation , 2010, ALT.

[6]  Richard S. Sutton,et al.  Introduction to Reinforcement Learning , 1998 .

[7]  Huixia Judy Wang,et al.  Efficient Moments-based Permutation Tests , 2009, NIPS.

[8]  Adalbert Kerber,et al.  Applied finite group actions , 1999 .

[9]  Leonidas J. Guibas,et al.  Efficient Inference for Distributions on Permutations , 2007, NIPS.

[10]  Shin Ta Liu,et al.  Permutation Methods: A Distance Function Approach , 2002, Technometrics.

[11]  László Babai,et al.  Computational complexity and the classification of finite simple groups , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[12]  Jennifer Neville,et al.  Relational Active Learning for Joint Collective Classification Models , 2011, ICML.

[13]  Taeho Jo,et al.  A Multiple Resampling Method for Learning from Imbalanced Data Sets , 2004, Comput. Intell..

[14]  M. Goresky,et al.  An Introduction to Abstract Algebra , 2005 .

[15]  Michel Verleysen,et al.  Resampling methods for parameter-free and robust feature selection with mutual information , 2007, Neurocomputing.

[16]  P. Good.  Permutation, Parametric, and Bootstrap Tests of Hypotheses , 2005 .

[17]  Brendan D. McKay,et al.  Practical graph isomorphism, II , 2013, J. Symb. Comput..

[18]  William F. Punch,et al.  A Comparison of Resampling Methods for Clustering Ensembles , 2004, IC-AI.

[19]  Andrew G. Barto,et al.  Reinforcement learning , 1998 .

[20]  P. Good.  Permutation, Parametric, and Bootstrap Tests of Hypotheses (Springer Series in Statistics) , 1994 .

[21]  Shengbo Guo,et al.  Bayesian recommender systems : models and algorithms , 2011 .

[22]  K. Fukumizu,et al.  Learning via Hilbert Space Embedding of Distributions , 2007 .

[23]  Ing Rj Ser.  Approximation Theorems of Mathematical Statistics , 1980 .

[24]  J. Hopcroft,et al.  Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.