CompleteLinkage.java

/*
 * Copyright (C) Justo Montiel, David Torres, Sergio Gomez, Alberto Fernandez
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public License
 * as published by the Free Software Foundation; either version 2.1 of
 * the License, or (at your option) any later version.
 *
 * This library 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
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, see
 * <http://www.gnu.org/licenses/>
 */

package methods;

import inicial.Language;
import utils.PrecDouble;
import definicions.Cluster;
import definicions.MatriuDistancies;

/**
 * <p>
 * <b>MultiDendrograms</b>
 * </p>
 *
 * Complete Linkage clustering algorithm
 *
 * @author Justo Montiel, David Torres, Sergio Gómez, Alberto Fernández
 *
 * @since JDK 6.0
 */
public class CompleteLinkage extends Method {

	public CompleteLinkage(final Cluster ci, final Cluster cj,
			final MatriuDistancies md) {
		super(ci, cj, md);
	}

	@Override
	protected double getAlfa_ij(final Cluster i, final Cluster j) {
		double res;
		final PrecDouble pr = new PrecDouble("1.0");
		int a, b;

		a = cI.isNado() ? cI.getCardinalitat() : 1;
		b = cJ.isNado() ? cJ.getCardinalitat() : 1;
		res = (a * b);
		pr.Division(res);

		return pr.parserToDouble();
	}

	@Override
	protected double getBeta_ii(final Cluster i, final Cluster ii) {
		return 0;
	}

	@Override
	protected double getBeta_jj(final Cluster j, final Cluster jj) {
		return 0;
	}

	@Override
	protected double getGamma_ij(final Cluster i, final Cluster j) {
		return this.getAlfa_ij(i, j);
	}

	@Override
	protected double CalculLinkage() throws Exception {
		PrecDouble res, gamma, max, tmp;
		res = new PrecDouble("0.0");

		if (mdAct.isTipusDistancies()) {
			max = new PrecDouble(this.getDistanciaMax(cJ, cI));
		} else {
			max = new PrecDouble(this.getDistanciaMin(cJ, cI));
		}

		if (cI.isNado() && cJ.isNado()) {
			for (int i = 0; i < cI.getCardinalitat(); i++) {
				for (int j = 0; j < cJ.getCardinalitat(); j++) {
					gamma = new PrecDouble(this.getGamma_ij(cI.getFill(i),
							cJ.getFill(j)));
					tmp = max.clone();
					tmp.Resta(mdAct.getDistancia(cI.getFill(i), cJ.getFill(j)));

					tmp.Producto(gamma);
					res.Suma(tmp);
				}
			}
		} else if (cI.isNado() || cJ.isNado()) {
			if (cI.isNado()) {
				for (int i = 0; i < cI.getCardinalitat(); i++) {
					gamma = new PrecDouble(this.getGamma_ij(cI.getFill(i), cJ));

					tmp = max.clone();
					tmp.Resta(mdAct.getDistancia(cI.getFill(i), cJ));
					tmp.Producto(gamma);
					res.Suma(tmp);
				}
			} else {
				for (int j = 0; j < cJ.getCardinalitat(); j++) {
					gamma = new PrecDouble(this.getGamma_ij(cJ.getFill(j), cI));

					tmp = max.clone();
					tmp.Resta(mdAct.getDistancia(cJ.getFill(j), cI));
					tmp.Producto(gamma);
					res.Suma(tmp);
				}
			}
		} else {
			throw new Exception(Language.getLabel(69));
		}
		return res.parserToDouble();
	}
}