Disclosure of Invention
In view of the above technical problem, the present disclosure provides a method for visualizing a hierarchical data set based on a tree topology, including the steps of: s1, inputting the hierarchical data set through a plurality of data input modes; s2, initializing the input hierarchical data set; s3, determining visualization option parameters; s4, according to the determined visualization option parameter, performing visualization processing on the input hierarchical data set; and S5, outputting the visualization result of the hierarchical data set after visualization processing in a mode of a graphic file.
In a preferred embodiment, the hierarchical data set is converted into a relationship corresponding to a trunk and multiple levels of branches of the tree topology, and then a visualization graph is generated and labeled according to the visualization option parameters, wherein each level in the hierarchical data set corresponds to each level in the tree topology.
In a preferred embodiment, the visualization method can be implemented by one of the following information processing techniques: independent application software, online service, SDK, cloud computing service.
In a preferred embodiment, the visualization results are presented in a tree topology, the visualization presentation of the tree topology's trunk and multi-level branches corresponding to the numerical values of the data attributes of the different levels of the hierarchical data set.
In a preferred embodiment, the visualization result has multiple formats, the presentation mode, the name and the size of the visualization result are changed according to scenes, and the trunk and the branches of the tree topology can be presented in multiple graphs or in a wire frame and a color block.
In a preferred embodiment, the visual representation of the tree topology's trunks and branches corresponding to the values of the data attributes includes at least one of: area, color, length, width.
In a preferred embodiment, the visualization result is configured by the visualization option parameter by inputting and calling the hierarchical data set manually or by an API.
In a preferred embodiment, the tree topology is presented with trunks and branches deployed from bottom to top and in a level-by-level fashion.
In a preferred embodiment, the trunks and branches of the tree topology are labeled with values of data attributes of the hierarchical data set and attribute names.
In one aspect of the present disclosure, there is provided a visualization device of a hierarchical data set based on a tree topology, comprising a processor and a memory, wherein the memory has stored thereon computer program instructions which, when executed by the processor, implement the method of any of the above.
Compared with the prior art, the beneficial effects of the disclosure are: in the data processing and displaying process related to the information system, the hierarchical data sets are subjected to graphic visualization processing according to a tree topology structure, and one or more static or dynamic pictures capable of representing data description characteristics are generated for each hierarchical data set, so that the complex hierarchical data sets are presented more intuitively, and the analysis and use efficiency of the data is improved.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art. Nothing in the following detailed description is intended to indicate that any particular component, feature, or step is essential to the invention. Those skilled in the art will appreciate that various features or steps may be substituted for or combined with one another without departing from the scope of the present disclosure.
Fig. 1 shows a flowchart of a visualization method of a hierarchical tree topology based data set according to an exemplary embodiment of the present disclosure. The present disclosure provides a visualization method of hierarchical data set based on tree topology, comprising the steps of: s1, inputting the hierarchical data set through a plurality of data input modes, wherein the data input modes such as manual input, file import, API call and the like are supported; s2, initializing the input hierarchical data set; s3, determining a visualization option parameter, for example, by inputting and calling the hierarchical data set manually or by API, the visualization result being configured by the visualization option parameter; s4, performing visualization processing on the input hierarchical data set according to the determined visualization option parameters, wherein the hierarchical data set is converted into a relationship corresponding to a trunk and multiple levels of branches of the tree-shaped topological structure, and then generating a visualization graph and labeling according to the visualization option parameters, wherein each level in the hierarchical data set corresponds to each level in the tree-shaped topological structure; and S5, outputting the visualization result of the hierarchical data set after visualization processing in a graphic file mode, wherein the visualization result is presented in a tree topology mode, and the visualization presentation form of the tree topology structure trunk and the multi-level branches corresponds to the numerical values of the data attributes of different levels of the hierarchical data set. In addition, the output mode also supports the generation of mainstream picture and video format content by the API. In a preferred embodiment, the hierarchical data set comprises one or more levels of data, each level comprising one or more dimensions, each dimension comprising values of one or more data attributes, wherein the number of data attributes is unlimited for the number of levels, the number of dimensions, and the number of data attributes. In a preferred embodiment, the visualization method can be implemented by one of the following information processing techniques: independent application software, online service, SDK, cloud computing service.
FIG. 2 illustrates an example of a hierarchical data set in accordance with an exemplary embodiment of the present disclosure. Specifically, the hierarchy of the hierarchical data set may include one level, two levels, and three levels to N levels, each level may define different dimensions, each level of the dimensions may include different data attributes or lower-level dimensions, the dimensions defined by each level should be completely accommodated by the corresponding upper-level dimension, the value of each data attribute is usually a numerical value, and the measurement units of the data attributes of the entire data set may be the same or different. For example, the subject object of the data set in FIG. 2 is ABC, and the data set includes 3 levels of dimensions, 10 types of data attributes, as follows:
first-order dimensionality: ABC whole body (100)
And (3) secondary dimension: branch A (30), B (50), C (20)
Three-level dimensionality: branches a1(10), a2(15), a3(5), b1(20), b2(20), b3(10), c1(5), c2(5), c3(5), c4(5)
Fig. 3 shows a schematic diagram of a tree topology according to an exemplary embodiment of the present disclosure. And converting the hierarchical data set into a relation corresponding to a trunk and multilevel branches of the tree-shaped topological structure, generating a visual graph according to the visual option parameters, and labeling, wherein each level in the hierarchical data set corresponds to each level in the tree-shaped topological structure. For example, the generated data visualization graph includes a main trunk/trunk, which is generally a summary of the subject area data described by the data set, with the first dimension as a first branch, the second dimension as a second branch, the third dimension as a third branch, and so on. The visual graphic elements of the main trunk and each level of branches represent corresponding different data values in the modes of color difference, length, width, area and the like, and the visual display of the description content and the structure of the whole hierarchical data set is realized. In a preferred embodiment, the visualization result has multiple formats, the presentation mode, the name and the size of the visualization result are changed according to a scene, and the trunk and the branches of the tree topology can be presented in multiple graphs or in a wire frame and a color block. In a preferred embodiment, the visual representation of the tree topology's trunks and branches corresponding to the values of the data attributes includes at least one of: area, color, length, width. For example, the area sizes of b1 and b2 are the same (both values are 20), the area sizes of c1 to c4 and a3 are the same (both values are 5), and the area sizes of b3 and a1 are the same (both values are 10). In a preferred embodiment, the tree topology is presented with trunks and branches deployed from bottom to top and in a level-by-level fashion. In addition, the tree topology may also be distributed from top to bottom, left to right, right to left, inside to outside in a ring, or in other directions. In addition, the tree topology structure can be expanded step by step, or the first N-stage expansion is selected, or different display levels are set according to branches. In a preferred embodiment, the tree topology trunks and branches are labeled with values of data attributes of the hierarchical data set and attribute names. For example, the labels of the graphs may or may not include attributes, and values, percentages, units, and the like of the stems and branches.
By adopting the method and the equipment, the hierarchical data sets can be subjected to graphic visualization processing according to a tree topology structure in the data processing and displaying process related to an information system, one or more static or dynamic pictures capable of representing data description characteristics are generated for each hierarchical data set, and the complex hierarchical data sets are more visually presented, so that the visualization results of the hierarchical data sets are clear in hierarchy, rich in connotation, convenient to recognize and capable of improving the analysis and use efficiency of the data. The technical scheme of the invention can also support the input of the hierarchical data set in various data storage modes, can realize a software or hardware information processing module (realized by independent application software, online service, SDK, cloud computing service and other technical modes) of the data visualization method described by the invention, can configure data visualization parameter options in the input process, and generates and outputs data visualization graphic information presented according to tree topology through data initialization and visualization processing processes.
Fig. 4 illustrates a visualization device for a hierarchical data set based on a tree topology according to an exemplary embodiment of the present disclosure. Referring to thedevice 400 of fig. 4, the computing device comprises aprocessor 401 and amemory 402, wherein thememory 402 has stored thereoncomputer program instructions 403, thecomputer program instructions 403, when executed by the processor, implementing a method of visualization of a hierarchical data set based on a tree topology as described above.
In yet another aspect of the present disclosure, there is also provided a machine-readable storage medium having stored thereon computer program instructions, wherein the computer program instructions, when executed by a processor, implement the intelligent search method as described above. In some implementations, the machine-readable storage medium is a tangible component of a digital processing device. In other embodiments, the machine-readable storage medium is optionally removable from the digital processing apparatus. In some embodiments, the machine-readable storage medium may include, by way of non-limiting example, a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a flash Memory, a programmable Read-Only Memory (PROM), an erasable programmable Read-Only Memory (EPROM), a solid-state Memory, a magnetic disk, an optical disk, a cloud computing system or service, and so forth.
It should be understood that the various steps recited in the method embodiments of the present disclosure may be performed in a different order, and/or performed in parallel. Moreover, method embodiments may include additional steps and/or omit performing the illustrated steps. The scope of the invention is not limited in this respect.
In the description provided herein, numerous specific details are set forth. However, it is understood that embodiments of the disclosure may be practiced without these specific details. In some embodiments, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
While exemplary embodiments of the present invention have been shown and described herein, it will be readily understood by those skilled in the art that such embodiments are provided by way of example only. Numerous modifications, changes, and substitutions will now occur to those skilled in the art without departing from the invention. It should be understood that various alternatives to the embodiments of the invention described herein may be employed in practicing the invention. It is intended that the following claims define the scope of the invention and that methods and structures within the scope of these claims and their equivalents be covered thereby.