Results 1  10
of
1,421
Similarity estimation techniques from rounding algorithms
 In Proc. of 34th STOC
, 2002
"... A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh∈F[h(x) = h(y)] = sim(x,y), where sim(x,y) ∈ [0, 1] is some similarity function defined on the collection of objects. Such a scheme leads ..."
Abstract

Cited by 449 (6 self)
 Add to MetaCart
to a compact representation of objects so that similarity of objects can be estimated from their compact sketches, and also leads to efficient algorithms for approximate nearest neighbor search and clustering. Minwise independent permutations provide an elegant construction of such a locality
Statistical methods for identifying differentially expressed genes in replicated cDNA microarray experiments
 STATISTICA SINICA
, 2002
"... DNA microarrays are a new and promising biotechnology whichallows the monitoring of expression levels in cells for thousands of genes simultaneously. The present paper describes statistical methods for the identification of differentially expressed genes in replicated cDNA microarray experiments. A ..."
Abstract

Cited by 438 (12 self)
 Add to MetaCart
into account the dependence structure between the gene expression levels. No specific parametric form is assumed for the distribution of the test statistics and a permutation procedure is used to estimate adjusted pvalues. Several data displays are suggested for the visual identification of differentially
A new method for nonparametric multivariate analysis of variance in ecology.
 Austral Ecology,
, 2001
"... Abstract Hypothesistesting methods for multivariate data are needed to make rigorous probability statements about the effects of factors and their interactions in experiments. Analysis of variance is particularly powerful for the analysis of univariate data. The traditional multivariate analogues, ..."
Abstract

Cited by 368 (4 self)
 Add to MetaCart
symmetric distance or dissimilarity matrix. Pvalues are then obtained using permutations. Some examples of the method are given for tests involving several factors, including factorial and hierarchical (nested) designs and tests of interactions.
Restricted Permutations
"... Restricted permutations are those constrained by having to avoid subsequences ordered in various prescribed ways. They have functioned as a convenient descriptor for several sets of permutations which arise naturally in combinatorics and computer science. We study the partial order on permutations t ..."
Abstract

Cited by 33 (7 self)
 Add to MetaCart
Restricted permutations are those constrained by having to avoid subsequences ordered in various prescribed ways. They have functioned as a convenient descriptor for several sets of permutations which arise naturally in combinatorics and computer science. We study the partial order on permutations
Learning to rank: from pairwise approach to listwise approach
 In Proc. ICML’07
, 2007
"... The paper is concerned with learning to rank, which is to construct a model or a function for ranking objects. Learning to rank is useful for document retrieval, collaborative filtering, and many other applications. Several methods for learning to rank have been proposed, which take object pairs as ..."
Abstract

Cited by 248 (30 self)
 Add to MetaCart
The paper is concerned with learning to rank, which is to construct a model or a function for ranking objects. Learning to rank is useful for document retrieval, collaborative filtering, and many other applications. Several methods for learning to rank have been proposed, which take object pairs
Quasirandom permutations
 J. Comb. Theory Ser. A
"... Chung and Graham [8] define quasirandom subsets of Zn to be those with any one of a large collection of equivalent randomlike properties. We weaken their definition and call a subset of Zn ɛbalanced if its discrepancy on each interval is bounded by ɛn. A quasirandom permutation, then, is one which ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
Chung and Graham [8] define quasirandom subsets of Zn to be those with any one of a large collection of equivalent randomlike properties. We weaken their definition and call a subset of Zn ɛbalanced if its discrepancy on each interval is bounded by ɛn. A quasirandom permutation, then, is one
Permutation codes
"... There are many analogies between subsets and permutations of a set, and in particular between sets of subsets and sets of permutations. The theories share many features, but there are also big differences. This paper is a survey of old and new results about sets (and groups) of permutations, concent ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
, concentrating on the analogies and on the relations to coding theory. Several open problems are described. It is a pleasure to dedicate this paper to Michel Deza, who was a pioneer in the investigation of permutations from this point of view. There are many analogies between sets of subsets of {1,..., n
The Enumeration of Simple Permutations
 J. Integer Seq
, 2003
"... A simple permutation is one which maps no proper nonsingleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results include a straightforward relationship between the ordinary generating function for simple permutations and that for all ..."
Abstract

Cited by 48 (4 self)
 Add to MetaCart
A simple permutation is one which maps no proper nonsingleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results include a straightforward relationship between the ordinary generating function for simple permutations and that for all
Restricted 132avoiding permutations
 Adv. in Appl. Math
"... Abstract. We study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation τ on k letters, or containing τ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second ..."
Abstract

Cited by 44 (23 self)
 Add to MetaCart
Abstract. We study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation τ on k letters, or containing τ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second
UNFAIR PERMUTATIONS
, 2011
"... We study unfair permutations, which are generated by letting n players draw numbers and assuming that player i draws i times from the unit interval and records her largest value. This model is natural in the context of partitions: the score of the ith player corresponds to the multiplicity of the ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We study unfair permutations, which are generated by letting n players draw numbers and assuming that player i draws i times from the unit interval and records her largest value. This model is natural in the context of partitions: the score of the ith player corresponds to the multiplicity
Results 1  10
of
1,421