Skip to search formSkip to main contentSkip to account menu

Freedman–Diaconis rule

Known as: Sturges' rule, Diaconis, Sturges rule 
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… 
Wikipedia (opens in a new tab)

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
A key challenge facing the design of differential privacy in the non-interactive setting is to maintain the utility of the… 
Review
2011
Review
2011
A Horseshoe for Multidimensional Scaling
Horseshoes (quadratic curves) routinely show up in multidimensional scaling and correspondence analysis solutions. We review some… 
2010
2010
Stein's method and the multivariate CLT for traces of powers on the classical compact groups
Let $M_n$ be a random element of the unitary, special orthogonal, or unitary symplectic groups, distributed according to Haar… 
2009
2009
The Gibbs Cloner for Combinatorial Optimization, Counting and Sampling
We present a randomized algorithm, called the cloning algorithm, for approximating the solutions of quite general NP-hard… 
Highly Cited
2005
Highly Cited
2005
Preserving the Confidentiality of Categorical Statistical Data Bases When Releasing Information for Association Rules*
In the statistical literature, there has been considerable development of methods of data releases for multivariate categorical… 
1999
1999
Random walk with memory
A reinforced random walk on the d-dimensional lattice is considered. It is shown that this walk is equivalent to an iterated… 
1999
1999
On The Graph Of Generating Sets Of A Simple Group
We prove that the product replacement graph on generating k-tuples of a simple group contains a large connected component if k… 
1995
1995
Recurrence and Transience for a Card Shuffling Model
A rule for shuffling an infinite deck of cards is considered where at each time step the first and jth card are interchanged with… 
1989
1989
Randomization time for the overhand shuffle
This paper analyzes repeated shuffling of a deck ofN cards. The measure studied is a model for the popularoverhand shuffle… 
1985
1985
On the preservation of determinacy under convolution
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… 
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)