17. The EPG generating apparatus according to claim 16 , wherein the processor compares the optimum keyword groups with the program description to generate some keywords of the optimum keyword group in a plurality of occurrence frequencies of the program description, the processor divides the occurrence frequencies by the keyword counts of the optimum keyword groups respectively to generate a plurality of values, and calculates an average value of the values to generate the match score.
17. The EPG generating apparatus according to claim 16 , wherein the processor compares the optimum keyword groups with the program description to generate some keywords of the optimum keyword group in a plurality of occurrence frequencies of the program description, the processor divides the occurrence frequencies by the keyword counts of the optimum keyword groups respectively to generate a plurality of values, and calculates an average value of the values to generate the match score. 18. The EPG generating apparatus according to claim 17 , wherein the processor constructs a relation matrix of the undirected graph, constructs at least one sub-relation matrix according to the relation matrix, the dimension of the sub-relation matrix is less than the dimension of the relation matrix, calculates a sum of matrix elements of the sub-relation matrix, and determines whether the sum of matrix elements is equal the square of the dimension of the sub-relation matrix, and the sub-relation matrix is one of the maximum cliques when the sum of matrix elements is equal to the square of the dimension of the sub-relation matrix.