|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||
A common interface for an algorithm for matching two concept systems. This interface is implemented by Absurdist and PenaltyMinimizer
| Method Summary | |
void |
mapSystem(ConceptSystem systemO,
ConceptSystem systemN)
Finds a correspondence between two concept systems. |
void |
print(boolean toFile)
Prints the two systems being matched (the original and noisy concept systems, the correspondence matrix, and the final mappings. |
| Method Detail |
public void mapSystem(ConceptSystem systemO,
ConceptSystem systemN)
throws java.lang.Exception
systemO - The first concept system to match. In our experiments,
this is the "original" one.systemN - The second system to match. In our experiments,
this system has been obtained from the first one by
adding some "noise".
java.lang.Exception
public void print(boolean toFile)
throws java.lang.Exception
java.lang.Exception
|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||