Changes between Version 2 and Version 3 of ExpertRecommender


Ignore:
Timestamp:
09/04/08 15:44:11 (16 years ago)
Author:
fmittag
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • ExpertRecommender

    v2 v3  
    7878== Suggestion == 
    7979 
     80=== Comparing features === 
     81 
    8082Define a similarity metric that compares two features x and y of the same (direct) type. Until now, the value of a feature is only the applicability value of the feature. 
    8183{{{ 
     
    8890This means, that two features with the same applicability have the distance 0 and thus the similary 1 - 0/2 = 1. Two features with applicability -1 and 1 would have the distance 2 and the similarity 1 - 2/2 = 0. (TODO: prove the properties of a metric) 
    8991 
     92=== Comparing items === 
     93 
     94The similarity of two items is defined through the similarity of their features. The outline of a potential algorithm looks like this: 
     95 
     96 * The similarity of two items is the arithmetic mean of the similarities of all features 
     97 * Features that are not annotated will be ignored 
     98 * If a feature type is only annotated in one item, feature values need to be inferred until they can be compared 
     99 
     100Example: 
     101 
     102Let there be a simple feature-hierarchy as follows: 
     103{{{ 
     104  A 
     105 / \ 
     106B   C 
     107}}} 
     108 
     109Example similarities would be: ("-" means: not annotated) 
     110{{{ 
     111  1      -1 
     112 / \  ;  / \      => similarity = 0 
     113-   -   -   - 
     114}}} 
     115{{{ 
     116   1       1 
     117  / \  ;  / \     => similarity = (1 + 0) / 2 = 0.5 
     118-1   -   1   - 
     119}}} 
     120 
     121Some non-trivial cases: 
     122{{{ 
     123   -      -1                               -       - 
     124  / \  ;  / \     => similarity = ?       / \  ;  / \     => similarity = ? 
     125-1   -   -   -                          +1   -   -  -1 
     126}}} 
     127 
     128Suggestion: Propagate possible values as intervals up or down the hierarchy 
     129 
     130We extend the distance metric on intervals, where x1 and x2 denote the interval bounds of x = [x1;x2] (if x1 = x2, we just write [x1], which is equal to the value x1) 
     131{{{ 
     132dist(x,y) = (|x1-y1| + |x2-y2|) / 2 
     133}}} 
     134 
     135The above example can then be compared: 
     136{{{ 
     137   -      -1        [-1;+1]       -1 
     138  / \  ;  / \   =>   /   \   ;    / \    => similarity = (sim(-1,[-1]) + sim([-1;+1],-1)) / 2 = (1 + 0.5) / 2 = 0.75 
     139-1   -   -   -     -1     -    [-1]  - 
     140}}}