2. The method of claim 1 , further comprising: populating a hyperlink matrix H of all inlinks; counting inlinks to said document D in at least a submatrix H′ of said hyperlink matrix H and outputting a total number of counted inlinks as a second importance score; multiplying said second importance score by a scaling factor C, where 0<C≦1; adding said first and second score to form said total score.
2. The method of claim 1 , further comprising: populating a hyperlink matrix H of all inlinks; counting inlinks to said document D in at least a submatrix H′ of said hyperlink matrix H and outputting a total number of counted inlinks as a second importance score; multiplying said second importance score by a scaling factor C, where 0<C≦1; adding said first and second score to form said total score. 4. The method of claim 2 , wherein said at least a submatrix S′ of similarity matrix S is an entire amount of said similarity matrix S.