Permutation Methods: A Distance Function Approach
By Paul W. Mielke Jr., Kenneth J. Berry. 2007
407 citations recorded by the source corpus.
Subfields: Artificial Intelligence
View Paper: https://www.semanticscholar.org/paper/e0d17100220e508db7d8d3eb1725a83fad2c70c8
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Gary King
- Kenji Matsuura
- Luigi Salmaso
- Richard A. Nielsen
- Fortunato Pesarin
- James B. Hittner
- Scott M. Robeson
- Cort J. Willmott
Citations in the corpus
- The permutation testing approach: a review (2010, methodology): “Several books have recently been dedicated to these methods (Basso et al. 2009; Edgington and Onghena, 2007; Good, 2005; Mielke and Berry, 2007; Pesarin and Salmaso, 2010).”
- Matching for Causal Inference Without Balance Checking (2008, unknown): “Methods violating this principle lead to less robust inferences with suboptimal and highly counterintuitive properties (Mielke and Berry, 2007).”
- Why Propensity Scores Should Not Be Used for Matching (2019, methodology): “Statistical methods which violate this principle are known to generate nonrobust and counterintutive properties (Mielke and Berry, 2007).”
- Testing the significance of a correlation with nonnormal data: comparison of Pearson, Spearman, transformation, and resampling approaches. (2012, methodology): “The near absence of recommendations for resampling in general quantitative methods texts is surprising given that many statistical methodologists advocate their use when parametric assumptions, such as marginal normality, are not met (e.g., Good, 2005; Manly, 1997; Mielke & Berry, 2007).”