Sciweavers

1473 search results - page 7 / 295
» Permutation Tests for Classification
Sort
View
75
Voted
ICML
2006
IEEE
15 years 10 months ago
Permutation invariant SVMs
We extend Support Vector Machines to input spaces that are sets by ensuring that the classifier is invariant to permutations of subelements within each input. Such permutations in...
Pannagadatta K. Shivaswamy, Tony Jebara
COMBINATORICS
2000
129views more  COMBINATORICS 2000»
14 years 9 months ago
Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
We define type-B analogues of combinatorial statistics previously studied on noncrossing partitions and show that analogous equidistribution and symmetry properties hold in the ca...
Rodica Simion
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
14 years 9 months ago
Restricted Permutations, Continued Fractions, and Chebyshev Polynomials
Let fr n(k) be the number of 132-avoiding permutations on n letters that contain exactly r occurrences of 12 . . . k, and let Fr(x; k) and F (x, y; k) be the generating functions d...
Toufik Mansour, Alek Vainshtein
78
Voted
COMBINATORICS
2002
73views more  COMBINATORICS 2002»
14 years 9 months ago
Prefix Exchanging and Pattern Avoidance by Involutions
Let In() denote the number of involutions in the symmetric group Sn which avoid the permutation . We say that two permutations , Sj may be exchanged if for every n, k, and order...
Aaron D. Jaggard
CIKM
2007
Springer
15 years 1 months ago
A comparison of statistical significance tests for information retrieval evaluation
Information retrieval (IR) researchers commonly use three tests of statistical significance: the Student's paired t-test, the Wilcoxon signed rank test, and the sign test. Ot...
Mark D. Smucker, James Allan, Ben Carterette