- Timestamp:
- 02/05/15 17:29:35 (9 years ago)
- Location:
- stable
- Files:
-
- 2 edited
- 1 copied
Legend:
- Unmodified
- Added
- Removed
-
stable
- Property svn:mergeinfo changed
/trunk/sources merged: 11703-11705,11715,11717,11725,11757,11837,11914
- Property svn:mergeinfo changed
-
stable/HeuristicLab.Analysis
- Property svn:mergeinfo changed
/trunk/sources/HeuristicLab.Analysis merged: 11703,11914
- Property svn:mergeinfo changed
-
stable/HeuristicLab.Analysis/3.3/Statistics/BonferroniHolm.cs
r11706 r11919 41 41 pValuesIndizes.Add(i, pValues[i]); 42 42 } 43 var sortedPValues = pValuesIndizes.OrderBy(x => x.Value) ;43 var sortedPValues = pValuesIndizes.OrderBy(x => x.Value).ToArray(); 44 44 45 45 for (int i = 1; i < k + 1; i++) { 46 46 alphaNiveau[i - 1] = globalAlpha / (k - i + 1); 47 int idx = sortedPValues .ElementAt(i - 1).Key;47 int idx = sortedPValues[i - 1].Key; 48 48 49 49 if (i == 1) { 50 50 //true means reject 51 decision[idx] = sortedPValues .ElementAt(i - 1).Value < alphaNiveau[i - 1];52 adjustedPValues[idx] = sortedPValues .ElementAt(i - 1).Value * (k - i + 1);51 decision[idx] = sortedPValues[i - 1].Value < alphaNiveau[i - 1]; 52 adjustedPValues[idx] = sortedPValues[i - 1].Value * (k - i + 1); 53 53 } else { 54 decision[idx] = decision[sortedPValues .ElementAt(i - 2).Key] ? (sortedPValues.ElementAt(i - 1).Value < alphaNiveau[i - 1]) : false;55 adjustedPValues[idx] = Math.Max(adjustedPValues[sortedPValues .ElementAt(i - 2).Key], sortedPValues.ElementAt(i - 1).Value * (k - i + 1));54 decision[idx] = decision[sortedPValues[i - 2].Key] && (sortedPValues[i - 1].Value < alphaNiveau[i - 1]); 55 adjustedPValues[idx] = Math.Max(adjustedPValues[sortedPValues[i - 2].Key], sortedPValues[i - 1].Value * (k - i + 1)); 56 56 } 57 57 if (adjustedPValues[idx] > 1.0) {
Note: See TracChangeset
for help on using the changeset viewer.