{'fraction_non_alphanumeric': 0.021071115013169446, 'fraction_numerical': 0.0, 'mean_word_length': 5.096256684491979, '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}}
Efficiently and effectively finding window representatives

Increasingly many applications leverage geographic data, and display this data to the user, e.g., to show sites of interest or friends in the vicinity. Given a window of interest, it is often advantageous to display only a bounded number k of representative points, instead of the entire contents of the window. This is helpful as a summary of the window contents. It is also quite necessary when the screen is small, and the window contains many points, as displaying all points will yield an incomprehensible output. This paper presents an approach to finding k representatives of a window. Unlike previous methods, which were based on fetching and clustering the relevant data, in this paper a method is presented for exploiting an existing indexing structure of the data to provide high quality results in efficient time, without explicitly accessing the data in the window. Experimental results prove that this new method for choosing representatives provides high quality results (i.e., comparable to fully clustering the data) while achieving significantly better runtime.