{'fraction_non_alphanumeric': 0.022243713733075435, 'fraction_numerical': 0.0019342359767891683, 'mean_word_length': 4.814606741573034, '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}}
Context graphs for many-valued contexts

A context graph of a one-valued context is a graph which has formal objects as its vertices, and whose edges connect the objects in such a way that concept extents form connected subgraphs of this graph. This allows to retrieve objects similar to a given object by a recursive traversal of that objects neighborhood. The approach has been introduced in [1] and is considered as a potential model for information retrieval. In this paper, context graphs for many-valued contexts are introduced. The definition bases on descriptions, which were introduced in [2], and basically allows to construct context graphs without transforming the many-valued context into a one-valued context. It is examined how the structure of the context graph, which is based on similarity of objects, can be used to find objects in the graph based on a particular description. Finally, scale graphs are proposed as a method to incorporate knowledge about an attribute domain into the structure of the context graph.