for( int i = 0; i < sample.numInstances(); i++ ) {
extraIndices.add( i );
}
}
Collections.shuffle( extraIndices, rand );
extraIndices = extraIndices.subList( 0, extraIndicesCount );
Set extraIndexSet = new HashSet( extraIndices );
// the main loop to handle computing nearest neighbors and generating SMOTE
// examples from each instance in the original minority class data
Instance[] nnArray = new Instance[nearestNeighbors];