A
Page Rank:
A + A_f
Hub - Authority : |
HITS algorithm - Incoming -> Authority , Outgoing -> Hub
Hub Authority + Unknown L class if pointed by Hubs the more the L it is and if A pointed by L the more the Authority it is (Or maybe having too many Hubs makes L strong). You can define anything.
The question is for a real world scoring could we find a optimum score graph given a large data ? Since no true score value exist for arbitrary model there is no criteria for evaluation yet.
No comments:
Post a Comment