{'fraction_non_alphanumeric': 0.019880715705765408, 'fraction_numerical': 0.027833001988071572, 'mean_word_length': 4.6892655367231635, '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}}
Data scattering algorithm for very large multivariable data visualization

Data visualization techniques are very important presently. Techniques such as data scattering, 3D vector glyphs, vector warping, and hedgehogs are used for multivariable data representation. Data represented by these techniques are more reasonable than current techniques such as histogram graph or table, but they take a very long time to plot data. In this paper an algorithm which quickly creates very large data scattering is proposed. Data scattering represents each element of data by a sphere in 3D space. For example, 3 axes of 3D space, and 3 components of a color and the radius of a sphere are used to present data of seven variables. Since meshes or polygons are not required, this algorithm saves time and memory. IBM PC compatible with Pentium Pro Processor 200 MHz, 32 Mbyte RAM and Windows95 is used in our experiments. The numbers of data are from 1,436 to 232357 and computation time is from 0.05 to 5.44 second.