private int [ ] [ ] computeMeans ( List < CLIQUESubspace > denseSubspaces ) { int n = denseSubspaces . size ( ) - 1 ; int [ ] mi = new int [ n + 1 ] , mp = new int [ n + 1 ] ; double resultMI = 0 , resultMP = 0 ; for ( int i = 0 ; i < denseSubspaces . size ( ) ; i ++ ) { resultMI += denseSubspaces . get ( i ) . getCoverage ( ) ; resultMP += denseSubspaces . get ( n - i ) . getCoverage ( ) ; mi [ i ] = ( int ) FastMath . ceil ( resultMI / ( i + 1 ) ) ; if ( i != n ) { mp [ n - 1 - i ] = ( int ) FastMath . ceil ( resultMP / ( i + 1 ) ) ; } } return new int [ ] [ ] { mi , mp } ; }
The specified sorted list of dense subspaces is divided into the selected set I and the pruned set P . For each set the mean of the cover fractions is computed .