Patent ID: 8364693

Claim:
A computer-implemented method of indicating documents related to categories and persons, the computer-implemented method comprising: identifying the categories to which each document is related; identifying the persons to which each document is related; ranking the categories; ranking the persons; establishing an array comprising a plurality of cells, a first cell indicating the number of documents which are related to both a highest ranked category and a highest ranked person; a second cell indicating the number of documents which are related to both a second highest ranked category and the highest ranked person; a third cell indicating a number of documents which are related to both the highest ranked category and the second highest ranked person; a fourth cell indicating a number of documents which are related to both the second highest ranked category and the second highest ranked person; establishing links from the plurality of cells to the documents; and displaying the array, wherein the array is a two dimensional display, wherein the identified categories and the identified persons of interest are the array's two coordinate axes, wherein the displaying is performed such that the documents are presented in an array display which has at least two areas of correlation and relevant documents are ranked according to their scores in a first area and in a second area, wherein the identifying and ranking of categories and persons and establishment of the array are performed using software running on at least one computer including at least one non-transitory computer storage medium for storing the software for performing the identification and ranking and establishing the array, wherein a rank of a category (X) is determined by the following: Issue ⁢ ⁢ Rank ⁡ ( X ) = k ⁢ ⁢ 1 * NoS x ∑ i = 1 N ⁢ ⁢ NoS i + k ⁢ ⁢ 2 * ∑ i = 1 N ⁢ W ix ∑ i = 1 N ⁢ ∑ j = 1 N ⁢ W ij + k ⁢ ⁢ 3 * ∑ i = 1 N ⁢ W ix * NoS i ∑ j = 1 N ⁢ ∑ i = 1 N ⁢ W ij * NoS i + k ⁢ ⁢ 4 * NoV x + k ⁢ ⁢ 5 * ∑ i = 1 N ⁢ W ix * NoV i ∑ j = 1 N ⁢ ∑ i = 1 N ⁢ W ij * NoV i where: k1 is a coefficient representing a number of searches made regarding the category X; NoSx is the number of searches made regarding the category X; N is a number of category defined; NoSi is the number of searches made for each category I; k2 is a coefficient representing weight of a relationship between the category X and all other categories; Wix is a weighted relationship between the category X and another category I; k3 is a coefficient representing a weighted number of searches made against a related category; k4 is a coefficient representing a number of video clips related to the category X; NoVx is the number of video clips related to the category X; and k5 is a coefficient representing the number of video clips related to the category related to the category X.