{'fraction_non_alphanumeric': 0.00985663082437276, 'fraction_numerical': 0.0, 'mean_word_length': 5.205555555555556, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Finding related documents via communities in the citation graph

A body of scientific literature can be represented by a directed graph, which is commonly referred to as the citation graph. This paper describes an implementation of the random walk graph clustering algorithm to identify the communities within the citation graph. Based only on the link structure of the citation graph, the random walk graph clustering algorithm is able to efficiently identity highly topically related communities. The ability to identify community structure in the citation graph clearly has practical application. Communities in the citation graph represent related papers on a single topic. This approach is used as a method for finding related papers to a paper of interest by treating member papers in the same community of papers of interest as related papers. The performance of the random walk graph clustering algorithm was evaluated compared to the method for finding related papers used by ResearchIndex, CCIDF. The experimental results show that the random walk graph clustering algorithm performs better than the CCIDF.