@Override
    public double getInclusionProbability(Instance instance) {
        //trivial cluster
        if(N == 1){
            double distance = 0.0;
            for (int i = 0; i < LS.length; i++) {
                double d = LS[i] - instance.value(i);
                distance += d * d;
            }
            distance = Math.sqrt(distance);
            if( distance < EPSILON )
                return 1.0;
            return 0.0;
        }
        else{
            double dist = calcNormalizedDistance(instance.toDoubleArray());
            if(dist <= getRadius()){
                return 1;
            }
            else{
                return 0;
            }
//            double res = AuxiliaryFunctions.distanceProbabilty(dist, LS.length);
//            return res;
        }
    }
@ Override public double getInclusionProbability ( Instance instance ) { if ( N == 1 ) { double distance = 0.0 ; for ( int i = 0 ; i < LS . length ; i ++ ) { double d = LS [ i ] - instance . value ( i ) ; distance += d * d ; } distance = Math . sqrt ( distance ) ; if ( distance < EPSILON ) return 1.0 ; return 0.0 ; } else { double dist = calcNormalizedDistance ( instance . toDoubleArray ( ) ) ; if ( dist <= getRadius ( ) ) { return 1 ; } else { return 0 ; } } }
See interface <code>Cluster</code>
@param point
@return