| 摘要 |
PROBLEM TO BE SOLVED: To achieve analysis for finding out a popular writer and a keyword included in the document of the popular writer about each topic.SOLUTION: A matrix processing part 22 generates a matrix X of I×J indicating the number of submitted documents of a user i included in a story j, a matrix Y of N×J indicating the number of times of appearance of a word n in the submitted document included in the story j, and a matrix Y of I×M indicating an index indicating the degree of popularity of the user i on the basis of the data of an analysis object. A matrix decomposition part 23 decomposes the matrixes X, Y and Z into a basis matrix W of I×K indicating that the document to which the popular user i has been applied is included in the story pertinent to a topic k, a basis matrix A of N×K indicating that the word n appears in the submitted document of the popular user included in the story pertinent to the topic k, a coefficient matrix H and a coefficient matrix B. |
