Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,192,732 papers from all fields of science
Search
Sign In
Create Free Account
Freedman–Diaconis rule
Known as:
Sturges' rule
, Diaconis
, Sturges rule
Expand
In statistics, the Freedman–Diaconis rule, named after David A. Freedman and Persi Diaconis, can be used to select the size of the bins to be used in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Coupling Random Orthonormal Projection with Gaussian Generative Model for Non-Interactive Private Data Release
Thee Chanyaswad
,
Changchang Liu
,
Prateek Mittal
2017
Corpus ID: 208108619
A key challenge facing the design of differential privacy in the non-interactive setting is to maintain the utility of the…
Expand
Review
2011
Review
2011
A Horseshoe for Multidimensional Scaling
J. Leeuw
2011
Corpus ID: 73704127
Horseshoes (quadratic curves) routinely show up in multidimensional scaling and correspondence analysis solutions. We review some…
Expand
2010
2010
Stein's method and the multivariate CLT for traces of powers on the classical compact groups
C. Dobler
,
M. Stolz
2010
Corpus ID: 54772497
Let $M_n$ be a random element of the unitary, special orthogonal, or unitary symplectic groups, distributed according to Haar…
Expand
2009
2009
The Gibbs Cloner for Combinatorial Optimization, Counting and Sampling
R. Rubinstein
2009
Corpus ID: 14375547
We present a randomized algorithm, called the cloning algorithm, for approximating the solutions of quite general NP-hard…
Expand
Highly Cited
2005
Highly Cited
2005
Preserving the Confidentiality of Categorical Statistical Data Bases When Releasing Information for Association Rules*
S. Fienberg
,
A. Slavkovic
Data mining and knowledge discovery
2005
Corpus ID: 1360575
In the statistical literature, there has been considerable development of methods of data releases for multivariate categorical…
Expand
1999
1999
Random walk with memory
R. Rudnicki
,
M. Wolf
1999
Corpus ID: 28679991
A reinforced random walk on the d-dimensional lattice is considered. It is shown that this walk is equivalent to an iterated…
Expand
1999
1999
On The Graph Of Generating Sets Of A Simple Group
I. Pak
1999
Corpus ID: 15082143
We prove that the product replacement graph on generating k-tuples of a simple group contains a large connected component if k…
Expand
1995
1995
Recurrence and Transience for a Card Shuffling Model
G. Lawler
Combinatorics, probability & computing
1995
Corpus ID: 7500084
A rule for shuffling an infinite deck of cards is considered where at each time step the first and jth card are interchanged with…
Expand
1989
1989
Randomization time for the overhand shuffle
Robin Pemantle
1989
Corpus ID: 17079056
This paper analyzes repeated shuffling of a deck ofN cards. The measure studied is a model for the popularoverhand shuffle…
Expand
1985
1985
On the preservation of determinacy under convolution
C. Berg
1985
Corpus ID: 120581813
In 1959 Devinatz remarked that if ,u * v is a determinate measure on the real line, then so are ,t and v. It is shown here how…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE