de.citec.tcs.alignment.sets.package-info Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of sets Show documentation

This module provides algorithms to compare sets, that is, order-invariant lists. These algorithms are implementations of the AlignmentAlgorithm interface defined in the algorithms module. In particular, this module contains the StrictSetAlignmentScoreAlgorithm for computing the cost of the optimal unordered alignment of two sets, the StrictSetAlignmentFullAlgorithm which provides the Alignment itself as well, and the GreedySetAlignmentScoreAlgorithm as well as the GreedySetAlignmentFullAlgorithm for computing a potentially sub-optimal but faster alignment of two sets. The optimal alignments rely on the HungarianAlgorithm for solving the assignment problem in bipartite graphs. Here, we rely on the implementation provided by Kevin L. Stern which is provided within this distribution.

The newest version!

/*
 * TCS Alignment Toolbox Version 3
 * 
 * Copyright (C) 2016-2017
 * Benjamin Paaßen
 * AG Machine Learning
 * Center of Excellence Cognitive Interaction Technology (CITEC)
 * University of Bielefeld
 * 
 * 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 .
 */
/**
 * This module provides algorithms to compare sets, that is, order-invariant lists. These
 * algorithms are implementations of the AlignmentAlgorithm interface defined in the
 * algorithms module.
 *
 * In particular, this module contains the StrictSetAlignmentScoreAlgorithm for computing
 * the cost of the optimal unordered alignment of two sets, the
 * StrictSetAlignmentFullAlgorithm which provides the Alignment itself as well, and the
 * GreedySetAlignmentScoreAlgorithm as well as the GreedySetAlignmentFullAlgorithm for
 * computing a potentially sub-optimal but faster alignment of two sets.
 *
 * The optimal alignments rely on the HungarianAlgorithm for solving the assignment
 * problem in bipartite graphs. Here, we rely on the implementation provided by Kevin L. Stern
 * which is provided within this distribution.
 * 
 * @author Benjamin Paassen - bpaassen(at)techfak.uni-bielefeld.de
 */
package de.citec.tcs.alignment.sets;