{'fraction_non_alphanumeric': 0.024886877828054297, 'fraction_numerical': 0.004524886877828055, 'mean_word_length': 4.746753246753247, '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}}
Discovering authorities and hubs in different topological Web graph structures

The research looks at a Web page as a graph structure or a Web graph and tries to classify different Web graphs in the new coordinate space: Out-Degree, In-Degree. The Out-degree coordinate is defined as the number of outgoing Web pages from a given Web page. The In-degree coordinate is the number of Web pages that point to a given Web page. J. Kleinberg's (1988) Web algorithm on discovering "hub Web pages" and "authorities Web pages" is applied in this new coordinate space. Some very uncommon phenomena have been discovered and new interesting results interpreted. The author believes that understanding the underlying Web page as a graph will help design better Web algorithms, enhance retrieval and Web performance, and recommends using graphs as part of a visual aid for search engine designers.