Validation data and scoring criterion
30 views
Skip to first unread message
troos
Feb 27, 2007, 7:45:58 AM2/27/07
to Computer-Assisted Stemmatology Challenge
The correct solution to the validation data (Data-set #2) is now
available:
http://www.cs.helsinki.fi/teemu.roos/casc/example.html .
We have also given details of the scoring criterion at the same place.
The criterion is applicable to all graphs (not only trees). Basically,
the idea is to compare the relative distance from each node A to each
pair of nodes B,C. If the order of distances A-B vs. A-C is the same
in both the correct structure and the proposed solution, one unit is
added to the score. The distance is measured by the length (in edges)
of the shortest path. Any edge-length information is ignored.
available:
http://www.cs.helsinki.fi/teemu.roos/casc/example.html .
We have also given details of the scoring criterion at the same place.
The criterion is applicable to all graphs (not only trees). Basically,
the idea is to compare the relative distance from each node A to each
pair of nodes B,C. If the order of distances A-B vs. A-C is the same
in both the correct structure and the proposed solution, one unit is
added to the score. The distance is measured by the length (in edges)
of the shortest path. Any edge-length information is ignored.
If you have any comments on the scoring criterion, please feel free to
express your thoughts. Nothing is final until the final results have
been made announced.
Teemu
Reply all
Reply to author
Forward
0 new messages