Hi all,
I read the paper http://www2003.org/cdrom/papers/refereed/p007/p7-
abiteboul.html and try to understand the implementation of this paper
(opic-scoring plugin).
I looked at the code of the OpicScoringFilter. I understand the
method distributeScoreToOutlink. The current page distribute his
score (or his cash) to his outlinks.
But i can not find the algorithm from method updateDbScore in this
paper. I think this method sets the history of a page? In this case:
In the paper is written: the history of a page is: oldHistory
+scoreOfCurrentPage
But in the code: the score (or history ?) of a page is set to:
oldScore + sumOfScoreOfAllInlinks.
ok this method sounds logical. A score of a page is the sum of all
the scores of his inlinks. But i can not found this algorithm in the
paper.
A second point is the indexerScore method. This method returns pow
(scoreOfPage, scorePower). But in the paper is the relevance of a
page: historyOfPage+scoreOfPage/( historyOfAllPages + 1)
Is the implementation (opic-scoring plugin) an other version of the
OPIC Algorithm or overlook i something? I think i must read the paper
again ;-) .
Thanks for every clarification.
Marko
