| | 1 | = Similarity Measure: Similarity Flooding = |
| | 2 | Developer: [mailto:kiesel@dfki.uni-kl.de Malte Kiesel] [mailto:endres@dfki.uni-kl.de Björn Endres] [mailto:Lizhen.Qu@dfki.de Lizhen Qu] |
| | 3 | |
| | 4 | == Description == |
| | 5 | This is based on the algorithmus similarity flooding from Sergey Melnik,Hector Garcia-Molina and Erhard Rahm. The detailed description of the algorithmus can be found at [http://www-db.stanford.edu/~melnik/mm/sfa/]. Besides a implementation of the original algorithmus, [mailto:Lizhen.Qu@dfki.de Lizhen Qu] provides a optimized version to make it more efficient under huge onologies. |
| | 6 | |
| | 7 | |
| | 8 | == Specification == |
| | 9 | The 2 versions of similarity flooding are provided by |
| | 10 | === original === |
| | 11 | === optimized === |
| | 12 | The optimization is achieved by dividing the whole graph into several subgraphs. |
| | 13 | |
| | 14 | |
| | 15 | |
| | 16 | |
| | 17 | === Dependencies === |
