org.simmetrics.metrics.OverlapCoefficient Maven / Gradle / Ivy

Go to download
/*
 * #%L
 * Simmetrics Core
 * %%
 * Copyright (C) 2014 - 2015 Simmetrics Authors
 * %%
 * Licensed under the Apache License, Version 2.0 (the "License"); you may not
 * use this file except in compliance with the License. You may obtain a copy of
 * the License at
 * 
 * http://www.apache.org/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
 * License for the specific language governing permissions and limitations under
 * the License.
 * #L%
 */

package org.simmetrics.metrics;

import static com.google.common.collect.Sets.intersection;
import static java.lang.Math.min;

import java.util.Set;

import org.simmetrics.SetMetric;

/**
 * The overlap coefficient measures the overlap between two sets. The similarity
 * is defined as the size of the intersection divided by the smaller of the size
 * of the two sets
 * 
 * 
 * similarity(q,r) = ∣q ∩ r∣ / min{∣q∣, ∣r∣}
 * 
 * 

 * Unlike the generalized overlap coefficient the occurrence (cardinality) of an
 * entry is not taken into account. E.g. {@code [hello, world]} and
 * {@code [hello, world, hello, world]} would be identical when compared with
 * the overlap coefficient but are dissimilar when the generalized version is
 * used.
 * 

 * Similar to the generalized Jaccard similarity which divides the intersection
 * by the union of two multisets.
 * 

 * Similar to the dice coefficient which divides the shared information
 * (intersection) by sum of cardinalities.
 * 
 * This class is immutable and thread-safe.
 * 
 * @param 
 *            type of the token
 * 
 * @see GeneralizedOverlapCoefficient
 * @see Jaccard
 * @see Dice
 * @see Wikipedia -
 *      Overlap Coefficient
 */
public final class OverlapCoefficient implements SetMetric {

	@Override
	public float compare(Set a, Set b) {

		if (a.isEmpty() && b.isEmpty()) {
			return 1.0f;
		}

		if (a.isEmpty() || b.isEmpty()) {
			return 0.0f;
		}
		
		// Smaller set first for performance improvement. 
		// See: note at Sets.intersection
		if(a.size() > b.size()){
			final Set swap = a; a = b; b = swap;
		}
		
		// ∣q ∩ r∣ / min{∣q∣, ∣r∣}
		return intersection(a, b).size() / (float) min(a.size(), b.size());
	}

	@Override
	public String toString() {
		return "OverlapCoefficient";
	}

}