Resolution:
## Figure 9.
Procedure of recursive re-ranking. A recursive re-ranking algorithm is called for the phase of re-ranking in the section
of the factor analysis based algorithm. The recursive division divides the passages
into the base cases, according to the sorted term association, which is very similar
to a binary tree. For example, the factor analysis based model gives a ranking list
of terms as {T_{1}, T_{2}, T_{3}} for re-ranking. The baseline results are then first re-ranking by T_{1}, where are results containing T_{1 }and are results not containing T_{1}. Second, and are recursively re-ranked by T_{2}. are the results containing T_{2 }and T_{1}, while are those not containing T_{2 }but containing T_{1}. are the results containing T_{2 }but not containing T_{1}, while are those not containing T_{2 }and T_{1}. Similarly, (i = {1, 2, 3, 4} are re-ranked by T_{3 }at the third step.
Hu |