7. The EPG generating method according to claim 6 , wherein the step of generating the match score comprises: comparing the optimum keyword groups with the program description to generate a plurality of occurrence frequencies of keywords of the optimum keyword group in the program description by the processor; dividing the occurrence frequencies by the keyword counts of the optimum keyword groups respectively to generate a plurality of values by the processor; and calculating an average value of the values to generate the match score by the processor.
8. The EPG generating method according to claim 7 , wherein the step of finding the maximum clique comprises: constructing a relation matrix of the undirected graph by the processor; constructing at least one sub-relation matrix according to the relation matrix by the processor, wherein the dimension of the sub-relation matrix is less than or equal to the dimension of the relation matrix; calculating a sum of matrix elements of the sub-relation matrix by the processor; determining whether the sum of matrix elements is equal to the square of the dimension of the sub-relation matrix by the processor; and the sub-relation matrix is one of the maximum cliques when the sum of matrix elements is equal the square of the dimension of to the sub-relation matrix.