/*
* RapidMiner
*
* Copyright (C) 2001-2008 by Rapid-I and the contributors
*
* Complete list of developers available at our web site:
*
* http://rapid-i.com
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see http://www.gnu.org/licenses/.
*/
package com.rapidminer.operator.similarity.attributebased;
/**
* An euclidean distance.
*
* @author Michael Wurst
* @version $Id: EuclideanDistance.java,v 1.5 2008/09/12 10:30:50 tobiasmalbrecht Exp $
*/
public class EuclideanDistance extends AbstractRealValueBasedSimilarity {
private static final long serialVersionUID = -8688112978579558373L;
public double similarity(double[] e1, double[] e2) {
double sum = 0.0;
int counter = 0;
for (int i = 0; i < e1.length; i++) {
if ((!Double.isNaN(e1[i])) && (!Double.isNaN(e2[i]))) {
sum = sum + (e1[i] - e2[i]) * (e1[i] - e2[i]);
counter++;
}
}
double d = Math.sqrt(sum);
if (counter > 0)
return d;
else
return Double.NaN;
}
public boolean isDistance() {
return true;
}
}