Here you can find the source of euclideanDistance(double instance1[], double instance2[])
| Parameter | Description |
|---|---|
| instance1 | First instance |
| instance2 | Second instance |
protected static double euclideanDistance(double instance1[], double instance2[])
//package com.java2s; /*********************************************************************** //from w w w.j av a2 s .com This file is part of KEEL-software, the Data Mining tool for regression, classification, clustering, pattern mining and so on. Copyright (C) 2004-2010 J. Alcal?-Fdez (jalcala@decsai.ugr.es) A. Fern?ndez (alberto.fernandez@ujaen.es) S. Garc?a (sglopez@ujaen.es) F. Herrera (herrera@decsai.ugr.es) L. S?nchez (luciano@uniovi.es) J. Luengo (julianlm@decsai.ugr.es) This program is free software: you can redistribute it and/or modify it under the terms of the GNU 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 General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/ **********************************************************************/ public class Main { /** * Calculates the Euclidean distance between two instances * * @param instance1 First instance * @param instance2 Second instance * @return The Euclidean distance * */ protected static double euclideanDistance(double instance1[], double instance2[]) { double length = 0.0; for (int i = 0; i < instance1.length; i++) { length += (instance1[i] - instance2[i]) * (instance1[i] - instance2[i]); } length = Math.sqrt(length); return length; } }