| 摘要 |
<P>PROBLEM TO BE SOLVED: To provide a method, apparatus and computer program for efficiently calculating keyword appearance frequency ranking in distributed processing with a plurality of computers. <P>SOLUTION: Keywords which do not overlap each other are assigned to n computers, where n is a natural number. From the keywords assigned to each computer, keywords of the highest frequency ranks are acquired. From all the acquired keywords, k keywords of the highest overall frequency ranks are selected, where k is a natural number. In doing this, probability P(n, k, t) that the keywords of the highest frequency ranks in each computer are selected as the k highest overall frequency ranks is calculated, where t is a natural number satisfying t<k and represents the number of keywords acquired from each computer as the keywords of the highest frequency ranks. Then, t is estimated on the basis of the calculated probability P(n, k, t), t keywords of the highest frequency ranks are acquired from each computer, and k keywords of the highest overall frequency ranks are selected from all the acquired keywords. <P>COPYRIGHT: (C)2013,JPO&INPIT |
