9 | | This concept is represented by the class [http://phaselibs.opendfki.de/repos/trunk/PhaseLibs/doc/JavaDoc/de/dfki/km/phaselib/model/evidence/SimilarityMeasure.html de.dfki.km.phaselib.model.evidence.SimilarityMeasure]. |
| 9 | |
| 10 | = Extended Concepts = |
| 11 | |
| 12 | In order to allow for more specific information to be gathered from the algorithms, several extensions of this SimilarityMeasure concept exist. |
| 13 | |
| 14 | == asymmetric SimilarityMeasure == |
| 15 | |
| 16 | There is the concept of the asymmetric SimilarityMeasure, which allows the values of similarity(entityA, entityB) and similartiy(entityB, entityA) to be different. It is represented by the interface [http://phaselibs.opendfki.de/repos/trunk/PhaseLibs/doc/JavaDoc/de/dfki/km/phaselib/model/evidence/AsymmetricSimilarityMeasure.html de.dfki.km.phaselib.model.evidence.AsymmetricSimilarityMeasure]. This interface extends the [http://phaselibs.opendfki.de/repos/trunk/PhaseLibs/doc/JavaDoc/de/dfki/km/phaselib/model/evidence/SimilarityMeasure.html SimilarityMeasure] by methods to query this directed similarity, leaving the old methods to some sort of joint similrity, to be calculated from the two directed ones. A common approach to this calculations would be the minimum of the two similarities. |
| 17 | |
| 18 | |
| 19 | == extended SimilarityMeasure == |
| 20 | |
| 21 | Furthermore, there are algorithms (like [wiki:similarity_SimFlood SimilarityFlooding]) that additionally provide information about a dissimilarity of entities. To allow for such information, the interface [http://phaselibs.opendfki.de/repos/trunk/PhaseLibs/doc/JavaDoc/de/dfki/km/phaselib/model/evidence/ExtendedSimilarityMeasure.html de.dfki.km.phaselib.model.evidence.ExtendedSimilarityMeasure] requires methods for dissimilarity querying. |