CN111177497B - Hierarchical data association relationship visualization processing method, server and storage medium - Google Patents

Hierarchical data association relationship visualization processing method, server and storage medium Download PDF

Info

Publication number
CN111177497B
CN111177497B CN201911287989.8A CN201911287989A CN111177497B CN 111177497 B CN111177497 B CN 111177497B CN 201911287989 A CN201911287989 A CN 201911287989A CN 111177497 B CN111177497 B CN 111177497B
Authority
CN
China
Prior art keywords
data
node
chord
level
arc
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201911287989.8A
Other languages
Chinese (zh)
Other versions
CN111177497A (en
Inventor
朱敏
彭第
韦东鑫
田伟
李亚男
任宇堃
林晓健
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sichuan University
Tencent Technology Shenzhen Co Ltd
Original Assignee
Sichuan University
Tencent Technology Shenzhen Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Sichuan University, Tencent Technology Shenzhen Co Ltd filed Critical Sichuan University
Priority to CN201911287989.8A priority Critical patent/CN111177497B/en
Publication of CN111177497A publication Critical patent/CN111177497A/en
Application granted granted Critical
Publication of CN111177497B publication Critical patent/CN111177497B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/904—Browsing; Visualisation therefor

Abstract

The embodiment of the application discloses a method for visualizing association relation of hierarchical data, a server and a storage medium, wherein the method comprises the following steps: and generating a first level chord graph based on the target data set, if a level switching instruction for the first level chord graph is received, determining sub-data nodes of the target data nodes according to the level information of the target data nodes, and generating a second level chord graph for the sub-data nodes of the target data nodes, wherein the association relation and the level structure among all the data nodes in the target data set can be visually displayed in the form of the level chord graph, so that the method is beneficial to assisting a user to quickly find the target information from the target data set.

Description

Hierarchical data association relationship visualization processing method, server and storage medium
Technical Field
The present application relates to the field of computer technologies, and in particular, to a hierarchical data association relationship visualization processing method, a server, and a storage medium.
Background
In recent years, more and more data visualization researchers have begun to attempt to design and implement suitable visualization methods to simultaneously represent composite data that includes both hierarchical data and network data. The hierarchical data refers to a type of data having a tree-type hierarchical structure, and the network data refers to a type of data having an association relationship. The data widely existing in daily life of people such as targeted Internet advertisement, commodity orders for online shopping and the like all show the composite data structure. Taking the internet advertisement which is put in a targeted manner as an example, in the process of putting in the targeted advertisement, a father-son relationship and a co-occurrence relationship (namely an association relationship) exist between the targeting of one advertisement, and a large amount of valuable information is contained in the data, but the data which are generated day by day and are not counted have great trouble to data analysts. Therefore, how to better process and display the association relationship in the hierarchical data becomes a problem to be solved in the field of information visualization.
Disclosure of Invention
The embodiment of the application provides a hierarchical data association relation visualization processing method, a server and a storage medium, which can perform visualization processing on association relations and hierarchical structures among all data nodes in a target data set in a hierarchical chord graph mode.
In one aspect, an embodiment of the present application provides a method for visualizing an association relationship of hierarchical data, including:
generating a first-level chord graph based on a target data set, wherein node information of a plurality of data nodes and association relations among all the data nodes are displayed on the first-level chord graph;
if a level switching instruction for the first level chord graph is received, determining sub-data nodes of target data nodes according to the level information of the target data nodes, wherein the target data nodes are data nodes determined in the first level chord graph based on the indication of the level switching instruction;
generating a second-level chord graph for the child data nodes of the target data node;
and the second-level chord graph shows node information of the sub-data nodes, node information of each associated node in the associated node set associated with the sub-data nodes, and association relations between the sub-data nodes and each associated node.
On the other hand, the embodiment of the application provides a visual processing device for the association relation of hierarchical data, which comprises the following steps:
the processing module is used for generating a first-level chord graph based on the target data set, wherein node information of a plurality of data nodes and association relations among the data nodes are displayed on the first-level chord graph;
the detection module is used for receiving a level switching instruction of the first level chord graph;
the processing module is further configured to determine a child data node of a target data node according to the level information of the target data node if it is detected that the detection module receives a level switching instruction for the first level chord graph, and generate a second level chord graph for the child data node of the target data node, where the target data node is a data node determined in the first level chord graph based on an indication of the level switching instruction; and the second-level chord graph shows node information of the sub-data nodes, node information of each associated node in the associated node set associated with the sub-data nodes, and association relations between the sub-data nodes and each associated node.
Correspondingly, the embodiment of the application also provides a server, which comprises: a processor, a storage device, and a communication interface; the storage device is used for storing program instructions; the processor invokes the program instructions to perform: generating a first-level chord graph based on a target data set, wherein node information of a plurality of data nodes and association relations among all the data nodes are displayed on the first-level chord graph; if a hierarchy switching instruction for the first hierarchy chord graph is received through a communication interface, determining a child data node of a target data node according to hierarchy information of the target data node, and generating a second hierarchy chord graph for the child data node of the target data node, wherein the target data node is a data node determined in the first hierarchy chord graph based on the instruction of the hierarchy switching instruction; and the second-level chord graph shows node information of the sub-data nodes, node information of each associated node in the associated node set associated with the sub-data nodes, and association relations between the sub-data nodes and each associated node.
Accordingly, the embodiment of the application also provides a computer storage medium, wherein the computer storage medium stores program instructions, and the program instructions are used for realizing the methods when being executed.
In the embodiment of the application, the first-level chord graph can be generated based on the target data set, if the level switching instruction for the first-level chord graph is received, the sub-data nodes of the target data node are determined according to the level information of the target data node, and the second-level chord graph is generated for the sub-data nodes of the target data node, so that the visualization processing of the level data such as advertisement delivery data is realized, and a user can conveniently view different levels of chord graphs such as the first-level chord graph or the second-level chord graph generated after the visualization processing according to the requirement. The association relation and the hierarchical structure among all data nodes in the target data set are visually displayed in the form of the first-level chord chart and the second-level chord chart, so that a user can intuitively know related information of hierarchical data such as advertisement delivery related data, and when a certain direction is interested in the related information, sub-directions of the selected direction can be further highlighted, other associated advertisement information under the selected advertisement direction is displayed in a finer manner, the requirements of automation, intellectualization and intuitiveness of data presentation are greatly met, and the processing efficiency of works such as advertisement delivery is improved. .
Drawings
In order to more clearly illustrate the embodiments of the application or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1a is a schematic flow chart of generating a first level chord chart according to an embodiment of the application;
FIG. 1b is a schematic diagram of an interaction flow of a hierarchical data association visualization processing method according to an embodiment of the present application;
FIG. 2a is a schematic of a hierarchical chord chart according to an embodiment of the application;
FIG. 2b is a schematic diagram of another hierarchical chord chart according to an embodiment of the application;
FIG. 2c is a schematic diagram of yet another hierarchical chord chart according to an embodiment of the application;
FIG. 2d is a schematic diagram of yet another hierarchical chord chart according to an embodiment of the application;
FIG. 3 is a flow chart of a method for visualizing association of hierarchical data according to an embodiment of the present application;
FIG. 4 is a flow chart of another method for visualizing the association of hierarchical data according to an embodiment of the present application;
Fig. 5 is a schematic structural diagram of a hierarchical data association relationship visualization processing device according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a server according to an embodiment of the present application.
Detailed Description
In recent years, more and more data visualization researchers have begun to attempt to design and implement suitable visualization methods to simultaneously represent composite data that includes both hierarchical data (also referred to as hierarchical data) and network data. The hierarchical data refers to a type of data having a tree-type hierarchical structure, and the network data refers to a type of data having an association relationship. The visualized view created for such composite data may be referred to as an association visualization method in hierarchical data.
Wherein, hierarchical data visualization is one of the long-term research directions in the field of information visualization. How to effectively draw the hierarchical relationship in the data is a topic of great concern in this direction. Hierarchical data visualization is visually encoded based on channels of position, color, shape, area and the like, and mainly comprises two types of methods of node-link and space filling. The former method usually uses an orthogonal or radial tree-like layout to depict the views, while the latter method usually appears as a tree or a sunburst. Apart from the two basic methods, the visualization of the mixed design combining the two methods is also an important component of the visualization of hierarchical data.
Network data visualization is also one of the long-term research directions in the field of information visualization. Network data does not have a top-down or bottom-up hierarchical structure, but rather has a free and complex network structure (i.e., association). Similar to hierarchical data visualization, node-link methods, neighbor matrices, and mixed expressions are its common layout methods. Representing objects by nodes and relationships by edges is an extremely natural layout expression that can be easily understood by people. Among these, node-link graphs formed by force-directed layout and arc-length link graphs employing one-dimensional layout are most common. Neighbor matrix layouts are often used to discover direct relationships between nodes, but are less functional in the transitive expression of the relationships.
It can be seen that in the field of information visualization at present, a method for visual display of hierarchical data and network data is proposed, but how to better perform visual display of composite data containing both the hierarchical data and the network data is still a problem to be solved.
In order to solve the above problems, an embodiment of the present application provides a hierarchical data association visualization processing method, which may generate a first hierarchical chord chart based on a target data set, where node information of each data node in the target data set and an association relationship between each data node are displayed on the first hierarchical chord chart. Further, if a level switching instruction for the first level chord graph is received, determining a child data node of the target data node according to the level information of the target data node corresponding to the level switching instruction, and generating a second level chord graph for the child data node of the target data node. On the one hand, the association relation and the hierarchical structure among all the data nodes in the target data set are visually displayed in the form of a first hierarchical chord chart and a second hierarchical chord chart, so that the method is beneficial to assisting a user in quickly searching the target information with value from the target data set; on the other hand, the first-level chord graph can only show the node information of each data node and the association relation between each data node in the same level, when the level switching instruction for the target data node is detected, a second-level chord graph is generated and used for showing the node information of the sub data node of the target data node, the node information of each associated node associated with the sub data node and the association relation between the sub data node and each associated node, so that the space utilization rate of the level chord graph can be effectively improved.
The association relation visualization processing method of the hierarchical data provided by the embodiment of the application can be applied to various application fields capable of generating composite data containing the hierarchical data and the network data simultaneously, such as the advertising field, the e-commerce field and the like. Each of the data nodes corresponds to a category to which each of the data nodes belongs, the plurality of data nodes may correspond to a same category or different categories, each of the data nodes may represent a specific targeting, taking the advertisement delivery field as an example, each of the categories to which each of the data nodes 1 and 2 belongs is an age, each of the data nodes 1 and 2 may represent an advertisement targeting, for example, each of the data nodes 1 may represent an age group (for example, 10-20 years old) or an age (for example, 25 years old), and each of the data nodes 2 may represent another age group (for example, 20-30 years old) or an age (for example, 30 years old).
Fig. 1a is a schematic flow chart for generating a first-level chord chart according to an embodiment of the present application, including:
step S101: and carrying out data analysis and processing on the target data set. In one embodiment, the target data set includes hierarchical data and network data for each data node. In this case, the target data set may be parsed, each data node may be determined from the target data set, and network data corresponding to each data node and hierarchical data representing a hierarchical structure relationship between each data node may be extracted, the network data including node usage data of each data node and association relationship data between each data node, node information of the data node and parent-child relationships between the corresponding data nodes may be recorded in the hierarchical data, the node information including one or more of node identification, category, and hierarchy of the corresponding data node.
Wherein the processing includes adding one or more of the same hierarchical identification, tree structure conversion to hierarchical data, and matrix conversion to network data to the same data node in the hierarchical data and the network data.
In one implementation, after extracting the network data and the hierarchical data corresponding to each data node from the target data set, it may be detected whether the hierarchical data is represented in a tree structure, and whether the association relationship data in the network data is represented in a class matrix form, and if it is detected that the hierarchical data is represented in the tree structure and the association relationship data in the network data is represented in the class matrix form, the same hierarchical identifier may be directly added to the same data node in the hierarchical data and the network data. Or if the hierarchical data is detected not to be represented by the tree structure, constructing a tree structure for the hierarchical data through a spanning tree algorithm, and executing the step of adding the hierarchical identifier by adopting the hierarchical data of the tree structure; or if it is detected that the association relationship data in the network data is not represented in the form of a class matrix, the association relationship data in the network data may be converted into the class matrix form, and the step of adding the hierarchy identification may be performed by using the converted network data.
In one embodiment, when adding the hierarchical identifier to each data node, each data node in the same class may be numbered according to a hierarchical numbering rule, so as to obtain the hierarchical identifier (e.g. id) of each data node in the same class. Illustratively, for hierarchical data of the tree structure, a class node id of the root node down may be defined as 1, a first child node id under the class node is defined as 101, and then an id of the first child node of the node with the id of 101 may be defined as 10101. In this manner, parent and child nodes of a data node may be determined by identifying the hierarchical identity of the respective data node, e.g., for data node 10101, the data node may be quickly determined to be the first child node of data node 101 (i.e., the parent node of data node 10101) by identifying that 10101.
Illustratively, assume that there are n data nodes, id i And id n The association relationship between the n data nodes can be expressed as idRelin, and the class matrix conversion is carried out on the association relationship data of the n data nodes, so that a matrix with the following form can be obtained:
for n data nodes, the symmetric matrix has the following relationship:
idRel ij ＝idRel ji 1.ltoreq.i.ltoreq.n, 1.ltoreq.j.ltoreq.n, where i, j and n are integers greater than 0.
Step S102: visual mapping and visual coding. In one embodiment, the chord graph of the first hierarchy to be generated includes a plurality of arc elements and a plurality of chord elements connected with the arc elements, the arc elements are used for representing data nodes, the chord elements are used for representing association relations among the data nodes, and node information (such as node names) of the corresponding data nodes is recorded at corresponding positions of each arc element. The arc element may be an arc, or may include an outer arc or an inner arc.
Wherein the visual mapping includes color mapping for each arc element, in one embodiment, after the processed hierarchical data and network data are obtained, color mapping may be performed on each class of data nodes, that is, each class of data nodes is assigned an independent color, for example, red is assigned to an age class of data nodes, and then the display color of the age class of data nodes corresponding to the arc elements in the first hierarchical chord chart to be generated is red; assigning green for the data nodes in the Guangdong province category, wherein the display color of the corresponding arc elements of the data nodes in the Guangdong province category in the first-level chord chart to be generated is green; yellow is allocated to the data node of the family, and then the display color of the corresponding arc element of the data node of the family in the first-level chord chart to be generated is yellow.
In one embodiment, the color mapping of the data nodes of each class may be implemented by a mapping function that assigns a separate color scheme to the nodes of each class. Wherein, the mapping function adopts discrete input and discrete output. Illustratively, the mapping function may be as shown in equation 1.1:
color (i) = colorScheme (i), i ε [1, m ] formula 1.1
The color scheme is an RGB color array, and assuming that the mapping function is input into one class id (i) of m different classes in total, the output is one color of the RGB color array color scheme corresponding to the class id (i), and the colors corresponding to the class ids in the RGB color array can be customized.
In one embodiment, taking the advertisement delivery field as an example, the usage data includes a usage frequency, the association relationship data includes a co-occurrence relationship parameter, the usage frequency is the counted advertisement number delivered to the corresponding data node, and the association relationship data includes the co-occurrence relationship parameter. In this case, the visual coding includes: encoding each data node as one arc element of a first-level chord graph to be generated, encoding node information (e.g., node names) of each data node at an outer edge center of the corresponding arc element, encoding a frequency of use of each data node as an arc width of the corresponding arc element, encoding a sum of co-occurrence relationship parameters of each data node as an arc length of the corresponding arc element, encoding one data node with another The association parameter between one data node is encoded into the width (i.e. chord width w) of the chord element connecting the corresponding arc element of the one data node with the corresponding arc element of the other data node 0 )。
The distances from the arc elements of different levels to the circle center of the chord chart of the first level to be generated are different, and the distance from each arc element to the circle center is equal to the radius length of the arc element. The radius length of the arc element can be used for representing the level of the corresponding data node, if the respective levels of the data nodes of different categories are the same, the radius length of the corresponding arc element is the same, and the longer the radius of the arc element is, the lower the level of the data node corresponding to the arc element is. The radius length of the arc elements of different levels (namely the distance between the arc elements and the circle center) can be preset by a developer, and the specific set values can represent layering of the arc elements of different levels.
In one embodiment, assuming that the arc element includes an outer arc and an inner arc, the coding manner for the arc width in the first level chord chart to be generated may further be: at the calculated arc width w 0 Above, the user-specified numerical value num and width range [0,w ] are scaled by a linear scale ]Mapping is performed between the two, so that the additional arc widths w with different values are added to the additional arc 1 Wherein num ε [0, j]J and w are any positive integers, j is the maximum value of the frequency of use in all data nodes, and the extra arc width w 1 The calculation formula of (2) is shown as formula 1.2, wherein k and b are constants.
w 1 (num) =k.num+b formula 1.2
In this case, the arc width in the first-level chord chart may be finally encoded as: w (w) 0 +w 1 。
Step S103: the layout is visualized. In one embodiment, assuming that the arc element includes an outer arc and an inner arc, the level data obtained by the processing may be calculated by calling a sunglass layout algorithm, and determining arc element coordinate parameters of each arc element in the chord chart of the first level to be generated, where the arc element coordinate parameters include an inner arc start coordinate (θ 0 ,r 0 ) With the outer arc starting seatLabel (theta) 0 ,r 1 ) Wherein r is 0 The radius of the inner circle of the node can be set by a user according to the level of the node, r 0 Larger means lower the level of nodes, r 1 And r 0 The difference between the two is the basic arc width of the corresponding arc element (i.e. w is as above 0 ) Base arc width w 0 And extra arc width w 1 The addition is the actual arc width of the corresponding arc element.
In one embodiment, the chord graph layout algorithm may be further invoked to calculate the association data obtained after the processing, and determine an arc element angle parameter of each arc element in the chord graph of the first level to be generated, and a chord element angle parameter of each chord element, where the arc element angle parameter includes a start angle and an end angle of a corresponding arc element, and the chord element angle parameter includes a start angle and an end angle of a corresponding chord element.
Further, the first-level chord chart may be generated based on the arc width, color, arc length, arc element coordinate parameters, arc element angle parameters, and chord width and chord element angle parameters of the chord elements.
In one embodiment, a notch can be further arranged between each arc element and each arc element in the chord chart of the first level to be generated, and the notch can effectively separate each arc element and enable a user to quickly identify different arc elements. The radian corresponding to each arc element can be obtained from association relationship data among each data node, and the association relationship data comprises co-occurrence relationship parameters. Illustratively, the radian calculation may be as shown in equation 1.3:
wherein i is [1, n ]]Representing the ith data node, n is the total number of data nodes presented, and paddingAngle represents the gap angle between arc elements, which can be set by the user himself. Relay(s) i And Relation total Respectively representing the sum of co-occurrence relation parameters of the ith data nodeTotal value of sum of all data node co-occurrence relation parameters.
Further, determining radian radius of arc element corresponding to the ith data node i Then, the initial angle starAngle of the arc element corresponding to the ith data node can be calculated according to the formulas 1.4 and 1.5 i With end angle endAngle i endAngle when i is 0 i-1 And likewise 0.
starAngle i ＝(i-1)*paddingAngle+endAngle i-1 1.4
endAngle i ＝startAngle i +radian i 1.5
For example, as shown in fig. 2a, the generated first-level chord graph may be that "orientation 1.1", "orientation 1.2", and the like are node names of corresponding data nodes, one data node corresponds to one arc element in fig. 2a, for example, data node "orientation 1.4" corresponds to arc element 1.4 in the graph, data node "orientation 4.1" corresponds to arc element 4.1, arc element 1.4 and arc element 4.1 are connected, chord width of chord element 1 may be determined by co-occurrence relation parameters between data node "orientation 1.4" and data node "orientation 4.1", and may represent an association relation between data node "orientation 1.4" and data node "orientation 4.1", and the two may be matching arc elements of each other due to the same element connection between arc element 1.4 and arc element 4.1. In addition, the first-level chord chart may identify a class in which each data node is located, as can be seen from fig. 2a, the classes in which the data nodes "orient 1.1", "orient 1.2", "orient 1.3", "orient 1.4", and "orient 1.5" are located are class 1, the classes in which the data nodes "orient 2.2" and "orient 2.2" are located are class 2, the classes in which the data nodes "orient 3.1" and "orient 3.2" are located are class 3, the classes in which the data nodes "orient 4.1", "orient 4.2", and "orient 4.3" are located are class 4, and the classes in which the data nodes "orient 5.1", "orient 5.2", and "orient 5.3" are located are class 5.
For example, taking an application to the field of advertisement delivery as an example, an interactive flowchart of a method for visualizing an association relationship of hierarchical data is provided in the embodiment of the present application, please refer to fig. 1b, the advertisement delivery server may generate and store a target data set based on advertisement delivery data in step S201, where the advertisement delivery data includes orientation information (such as an orientation name and a category of the advertisement) of all advertisement orientations of advertisement delivery, hierarchical data between each advertisement orientation (i.e. the data nodes) of all advertisement orientations, the number of advertisements delivered to each advertisement orientation (i.e. the frequency of use), and the number of advertisements simultaneously delivered to any two different advertisement orientations (i.e. co-occurrence relationship parameters).
In one embodiment, during the process of advertisement delivery, the advertisement delivery server may record advertisement orientations of each advertisement delivery during the process of advertisement delivery, and at the end of advertisement delivery, count all advertisement orientations of advertisement delivery, hierarchical data between each advertisement orientation of all advertisement orientations, the number of advertisements delivered to each advertisement orientation, and the number of advertisements simultaneously delivered to any two different advertisement orientations, and store the counted all advertisement orientations of advertisement delivery, hierarchical data between each advertisement orientation, the number of advertisements delivered to each advertisement orientation, and the number of advertisements simultaneously delivered to any two different advertisement orientations as a target data set in the database. Wherein the advertisement targeting may be, for example, any one of targeting 1.1 to targeting 5.3 in fig. 2a, each advertisement targeting refers to an attribute of a target object of advertisement delivery, including age, gender, region, etc., for example, targeting 1.1 in fig. 2a may refer to age group "10 to 20 years" and targeting 1.2 may refer to age group "20 to 25 years". With respect to the aforementioned data, if the user's experience in analyzing the data is insufficient or not specialized, the necessary information, particularly the information of the association relationship between the data, cannot be intuitively understood from the cluttered raw data. Therefore, the embodiment of the present application continues to execute the following steps.
Further, the association relationship processing server may acquire the target data set from the advertisement delivery server in step S202, generate the first-level chord chart based on the target data set in step S203, and send the first-level chord chart to the terminal device, where the terminal device may display the first-level chord chart in step S204, and the user may view the first-level chord chart through the terminal device, so as to quickly learn some valuable target information about the user, thereby improving the efficiency of acquiring the target information from the target data set by the user. For example, assuming that the first level chord chart is shown in fig. 2a, since the width of the arc element corresponding to each advertisement orientation characterizes the number of advertisements delivered to the advertisement orientation, the user can see from fig. 2a that the arc element width corresponding to orientation 1.1 is significantly larger than other orientations, i.e. can determine that the number of advertisements delivered to orientation 1.1 is the largest. For another example, because the width of each chord element characterizes the co-occurrence relationship parameter between the corresponding advertisement orientations of the two arc elements connected by the chord element (i.e., the number of advertisements simultaneously placed in the two advertisement orientations), the user can determine the association relationship between the advertisement orientations according to the width of each chord element in fig. 2 a.
After the user views the first level chord graph, if the user wants to view the child data nodes of the next level of targeted advertisement targeting, a level switching operation can be input in the first level chord graph for targeted advertisement targeting. The terminal device may generate a hierarchical switch instruction based on a hierarchical switch operation for targeting the target advertisement in the first hierarchical chord chart by the user, and send the hierarchical switch instruction for targeting the target advertisement to the association processing server in step S205. After receiving the hierarchical switching instruction, the association relation processing server may determine, in step S206, a sub-targeting of the target advertisement targeting according to the hierarchical information of the target advertisement targeting, and generate a second hierarchical chord graph for the sub-targeting of the target advertisement targeting, and send the second hierarchical chord graph to the terminal device in step S207. After the terminal device receives the second-level chord chart, the second-level chord chart may be displayed in step S208, and the user may determine, by looking at the second-level chord chart, an association relationship between the sub-orientation of the target advertisement orientation and the sub-orientation, and an association relationship between the sub-orientation of the target advertisement orientation and other advertisement orientations except the target advertisement orientation, so as to quickly find target information having value on the user' S own based on the association relationship.
Illustratively, assuming that the first-level chord chart is shown in fig. 2a, the targeted advertisement is targeted to be targeted at 1.4, the sub-targeting of the next level of the targeted 1.4 includes the targeting from 1.4.1 to 1.4.4, and the second-level chord chart generated by the association processing server for each sub-targeting may be shown in fig. 2 b. It can be seen that the second level chord chart in fig. 2b shows the association between each sub-orientation (i.e. orientation 1.4.1 to orientation 1.4.4) and each sub-orientation with other advertisement orientations. Because the arc length of each advertisement orientation corresponding arc element characterizes the sum of co-occurrence relation parameters of each advertisement orientation, a user can see that the arc length of the corresponding arc element of the sub-orientation 'orientation 1.4.4' is obviously larger than that of other sub-orientations corresponding arc elements through fig. 2b, that is, the sub-orientation 'orientation 1.4.4' can be determined compared with other sub-orientations, when advertisements are put in other advertisement orientations, the number of advertisements simultaneously put in the orientation 1.4.4 is the largest, and the association relation between the orientation 1.4.4 and other orientations is the closest.
In one embodiment, the generating, by the association relation processing server, the first-level chord chart based on the target data set may include: the association relation processing server analyzes the data of the target data set, and obtains all the advertisement orientations of the advertisement, hierarchical data among each advertisement orientation, the advertisement quantity of each advertisement orientation and the advertisement quantity of any two different advertisement orientations at the same time from the target data set. Wherein the number of advertisements targeted to each advertisement and the number of advertisements targeted to any two different advertisements simultaneously can be understood as corresponding network data of each advertisement.
Further, the association processing server may encode each advertisement orientation as one arc element of the first-level chord chart to be generated, encode an orientation name of each advertisement orientation at a respective position (e.g., at an outer edge center) of the corresponding arc element, encode the number of advertisements of each advertisement orientation as an arc width of the corresponding arc element, encode a sum of co-occurrence relationship parameters of each advertisement orientation as an arc length of the corresponding arc element, and encode a co-occurrence relationship parameter between one advertisement orientation and another advertisement orientation as a width (i.e., chord width w 0) of a chord element connecting the one advertisement orientation corresponding arc element with the other advertisement orientation corresponding arc element. Illustratively, taking fig. 2a as an example, assuming that the number of advertisements simultaneously served to the orientation 1.4 and the orientation 4.1 is 1000 (i.e., the co-occurrence relationship parameter between the orientation 1.4 and the orientation 4.1 is 1000), then the co-occurrence relationship parameter "1000" may be encoded as the width of the chord element 1 connecting the arc element 1.4 corresponding to the orientation 1.4 and the arc element 4.1 corresponding to the orientation 4.1.
Further, the association relation processing server can perform color mapping for each arc element, the colors of the arc elements corresponding to the advertisement orientations of the same category are the same, and the colors of the arc elements corresponding to the advertisement orientations of different categories are different. For example, taking fig. 2a as an example, assuming that the category 1 is age, the orientation 1.1 is age range "10-20 years", the orientation 1.2 is age range "20-25 years", and both the orientation 1.1 and the orientation 1.2 belong to "age" category, then the arc element corresponding to the orientation 1.1 and the arc element corresponding to the orientation 1.2 may be determined to be the same color. Further, based on the hierarchical data and the network data of each advertisement orientation (i.e., the counted advertisement quantity put into each advertisement orientation and the counted advertisement quantity put into any two different advertisement orientations at the same time), each arc element position parameter and each chord element angle parameter in the first-level chord chart to be generated can be determined, and further, based on the arc width, color, arc length, arc element coordinate parameter and arc element angle parameter of the corresponding arc element of each advertisement orientation, and the chord width and chord element angle parameter of the corresponding chord element, the first-level chord chart is generated.
Through the description, the management user or the advertiser and other users can intuitively know the advertisement putting information, and when interested in a certain advertisement orientation, the sub-orientation of the selected advertisement orientation can be further highlighted, and other related advertisement information under the selected advertisement orientation is displayed in a finer manner, so that the requirements of automation, intellectualization and visualization of data presentation are greatly met, and the advertisement putting efficiency is improved.
Please refer to fig. 3, which is a flowchart illustrating a method for visualizing association of hierarchical data according to an embodiment of the present application, where the method according to an embodiment of the present application may be executed by a server (for example, the above-mentioned association processing server) or may be executed by a terminal device with a relatively high computing capability (for example, a personal computer). The method of the embodiment of the application comprises the following steps.
S301: and generating a first-level chord graph based on the target data set, wherein the first-level chord graph shows node information of a plurality of data nodes and association relations among the data nodes.
The target data set comprises hierarchical data and network data of each data node, wherein the hierarchical data can represent father-son relations among the data nodes, and the network data can represent association relations among different data nodes. For example, the class of the data node is an age, and the first child data node under the class "age" may include: the data node is 5-20 years old, the data node is 20-30 years old, and the child data node under the data node is 5-20 years old can comprise: child data nodes "5-10 years old" and child data nodes "10-20 years old", in which case, data nodes "5-20 years old" may be understood as parent nodes of child data nodes "5-10 years old" and child data nodes "10-20 years old"; child data nodes under the age of "20-30" of a data node may include: child data nodes "20-25 years old" and child data nodes "25-30 years old", in which case data nodes "20-30 years old" may be understood as parent nodes of child data nodes "20-25 years old" and child data nodes "25-30 years old".
In one embodiment, the server may parse the target data set, and determine each data node and network data corresponding to each data node from the target data set, where the network data includes node usage data of each data node and association relationship data between each data node. Further, hierarchical data for representing hierarchical relationships between respective data nodes may be acquired, wherein node information of the data nodes and parent-child relationships between the respective data nodes are recorded in the respective hierarchical data. Further, the server may generate the first-level chord graph according to node usage data and association relationship data included in the network data corresponding to each data node, and node information and parent-child relationships of the hierarchical data record. The specific description of how to generate the first-level chord chart based on the target data set may also refer to the related description of fig. 1a in the above embodiment, which is not repeated herein.
S302: and if the hierarchy switching instruction for the first hierarchy chord graph is received, determining child data nodes of the target data node according to the hierarchy information of the target data node, wherein the target data node is the data node determined in the first hierarchy chord graph based on the instruction of the hierarchy switching instruction.
S303: a second level chord graph is generated for the child data nodes of the target data node.
The second-level chord graph shows node information of the sub-data nodes, node information of each associated node in the associated node set associated with the sub-data nodes, and association relations between the sub-data nodes and each associated node.
In one embodiment, the chord graph of the first hierarchy includes a plurality of arc elements and a plurality of chord elements connected to each arc element, each arc element is used for representing each data node belonging to the same hierarchy, each chord element is used for representing an association relationship between each data node belonging to the same hierarchy, and node information (for example, node names) of the corresponding data nodes is recorded at a corresponding position of each arc element. The corresponding positions of the node information of each data node in the first-level chord chart may be preset by a developer, for example, may be the outer edge center of the arc element, which is not particularly limited in the embodiment of the present application.
In one embodiment, after the server generates the first-level chord graph based on the target data set, the first-level chord graph may be transmitted to the terminal device, and the first-level chord graph is displayed by the terminal device. Further, after the terminal device displays the first level chord chart, if the user wants to view the child data node of the next level of the target data node, a level switching operation may be input in the first level chord chart for the arc element or the node name corresponding to the target data node, and when the terminal device detects the level switching operation, a level switching instruction may be generated and sent to the server. The server may determine the target data node from the first level chord graph based on the indication of the level switch instruction, determine a child data node of a next level of the target data node according to the level information of the target data node, generate a second level chord graph for the child data node of the target data node, send the second level chord graph to the terminal device, and display the second level chord graph to the user by the terminal device. The operation of switching the arc element or node name input hierarchy corresponding to the target data node may be, for example, touch operation (such as clicking, pressing, etc.) for the arc element or node name, sliding operation, voice operation, or the like.
In one embodiment, the hierarchy information includes a hierarchy identifier of the target data node, and the determining, by the server, a specific implementation manner of the child data node of the target data node according to the hierarchy information of the target data node may be: and determining the next level identification of the level identification according to the level identification of the target data node, and searching the child data node according to the next level identification.
The hierarchical identification of each data node belonging to the category of the target data node is obtained by numbering according to a hierarchical numbering rule. Illustratively, it is assumed that the target data node is a data node "oriented 4.2", the data nodes "oriented 4.2", "oriented 4.2.1" and "oriented 4.2.2" all belong to the same category "age", the category "age" corresponds to the category node having a hierarchical identification number of 1, the data node "oriented 4.2" is a first child node of the category node corresponding to the category "age", and the data nodes "oriented 4.2.1" and "oriented 4.2.2" are first child nodes of the data node "oriented 4.2". In this case, the server numbers each data node under the category "age" according to the hierarchy numbering rule, and the specific implementation manner of obtaining the hierarchy identifier of each data node is as follows: since the data node "oriented 4.2" is the first child node of the class node corresponding to the class "age", the hierarchy identification number of the data node "oriented 4.2" can be 101 according to the hierarchy numbering rule, and since the data nodes "oriented 4.2.1" and "oriented 4.2.2" are the first child nodes of the data node "oriented 4.2", the hierarchy identification numbers of the data nodes "oriented 4.2.1" and "oriented 4.2.2" can be 10101 according to the hierarchy numbering rule.
Further, in the case that the server determines that the level identifier of the target data node is 101, it may determine that the next level identifier of the level identifier 101 is 10101 based on the level number rule, and then find the child data node of the target data node according to the next level identifier 10101.
Illustratively, assuming that the first-level chord graph is shown in fig. 2a, the target data node is the data node "orientation 1.4", and the server may generate the second-level chord graph shown in fig. 2b from the sub data nodes "orientation 1.4.1" to "orientation 1.4.4" of the data node "orientation 1.4", where the second-level chord graph shows node information (e.g., node name "orientation 1.4.1", etc.) of each sub data node, node information of each associated node in the associated node set associated with the sub data node, and association relationship between the sub data node and each associated node.
In one embodiment, after the server generates the second-level chord graph for the child data node of the target data node, a display mode of a second arc element corresponding to the child data node, a second chord element connected with the second arc element and a third arc element corresponding to each associated node can be adjusted in the generated second-level chord graph according to the first display characteristic; and adjusting the display modes of the arc elements except the second arc element and the third arc element and the display modes of the chord elements except the second chord element in the second-level chord graph according to the second display characteristics. Further, the server may send the second-level chord graph with the adjusted display mode to the terminal device, and the terminal device displays the second-level chord graph with the adjusted display mode to the user. By adopting the method, the related information of the sub-data nodes and the associated nodes possibly concerned by the user can be highlighted, which is beneficial to reducing the visual confusion degree of the second-level chord graph and assisting the user to quickly inquire valuable information from the second-level chord graph.
The first display feature and the second display feature may each include one or more of a display brightness feature, a display transparency feature and a display size feature, where the display brightness feature, the display transparency feature and the display size feature may refer to a display brightness feature, a display transparency feature and a display size feature of each arc element or a chord element in the second-level chord chart, and may also refer to a display brightness feature, a display transparency feature and a display size feature of a node name font corresponding to the arc element.
In one embodiment, the first display feature and the second display feature may each include a display luminance feature, the first display feature corresponding to a first luminance value, the second display feature corresponding to a second luminance value, the first luminance value being substantially greater than the second luminance value, the first luminance value corresponding to a highlighted luminance value, the second luminance value corresponding to a gray scale display luminance value. In this case, the server may adjust, in the generated second-level chord graph, the display luminance of the second arc element corresponding to the child data node, the second chord element connecting the second arc element, and the third arc element corresponding to each associated node to the first luminance value corresponding to the first display feature, and adjust, in the second-level chord graph, the display luminance of the arc element other than the second arc element and the third arc element, and the display luminance of the chord element other than the second chord element to the second luminance corresponding to the second display feature. Further, the second chord chart after the display brightness adjustment may be sent to the terminal device, and the terminal device displays the second chord chart after the display brightness adjustment. By adopting the method, the related information of the sub-data nodes and the associated nodes possibly concerned by the user can be highlighted, which is beneficial to reducing the visual confusion degree of the second-level chord graph and assisting the user to quickly inquire valuable information from the second-level chord graph.
In one embodiment, after the server sends the second-level chord chart to the terminal device, the terminal device displays the second-level chord chart to the user, and if the terminal device receives a backtracking operation of the user for any one of the sub-data nodes, a backtracking instruction for indicating to perform directional contraction on each of the sub-data nodes may be generated and sent to the server. The server may perform directional contraction on each child data node based on the indication of the backtracking instruction, and fall back to the last level of each child data node. The backtracking operation may be operations such as clicking, sliding, pressing, etc. of the pointer to the arc or node name input corresponding to the any child data node.
For example, assuming that the second level chord chart displayed by the terminal device is shown in fig. 2b, the user inputs a backtracking operation for the node name "orientation 1.4.4", in this case, the server may shrink all the data child nodes "orientation 1.4.1" to "orientation 1.4.3" associated with "orientation 1.4.4", back to the level above the data child nodes "orientation 1.4.1" to "orientation 1.4.4", that is, the destination data node "orientation 1.4", and the level chord chart after the backtracking is shown in fig. 2 a.
In the embodiment of the application, a first level chord graph can be generated based on a target data set, if a level switching instruction for the first level chord graph is received, determining a sub-data node of the target data node according to the level information of the target data node, and generating a second level chord graph for the sub-data node of the target data node, wherein the second level chord graph shows the node information of the sub-data node, the node information of each associated node in an associated node set associated with the sub-data node, and the association relation between the sub-data node and each associated node. The association relation and the hierarchical structure among all the data nodes in the target data set can be visually displayed in the form of the hierarchical chord graph, and the method is beneficial to assisting a user in quickly searching target information from the target data set.
Referring to fig. 4 again, a flowchart of another method for visualizing association of hierarchical data according to an embodiment of the present application may be implemented by a server (e.g., the above-mentioned association processing server), or may be implemented by a terminal device with relatively high computing capability (e.g., a personal computer). The method of the embodiment of the application comprises the following steps.
S401: analyzing the target data set, and determining each data node and network data corresponding to each data node from the target data set, wherein the network data comprises node use data of each data node and association relation data between each data node.
S402: hierarchical data for representing hierarchical structure relations among all data nodes is obtained, wherein node information of the data nodes and parent-child relations among corresponding data nodes are recorded in all the hierarchical data.
S403: and generating a first-level chord graph according to node usage data and association relation data included in the network data corresponding to each data node, and node information and father-son relation recorded by the level data. The chord elements are used for representing the association relation among the data nodes, and node information of the corresponding data nodes is recorded at the corresponding position of each arc element.
In one embodiment, according to node usage data and association relationship data included in network data corresponding to each data node, and node information and parent-child relationships recorded by hierarchical data, a specific implementation manner of generating the first-level chord graph is as follows: and determining each arc element layout parameter and chord element layout parameter in the chord chart of the first level to be generated according to the node use data and the association relation data included in the network data corresponding to each data node, and the node information and the father-son relation recorded by the level data. Further, a first level chord chart is generated based on the arc element layout parameters and the chord element layout parameters. The arc element layout parameters comprise arc element attribute parameters and arc element position parameters, the arc element attribute parameters comprise any one or more of arc length, arc width and color parameters, and the chord element layout parameters comprise chord element angle parameters and chord element width parameters.
In one embodiment, taking the advertising field as an example, the node usage data includes a usage frequency, the association relationship data includes a co-occurrence relationship parameter, in the generated first-level chord chart, the arc width of the target arc element is determined according to the usage frequency, the chord width of the chord element connected with the target arc element is determined according to the co-occurrence relationship parameter, and the target arc element is any one arc element in each arc element. The frequency of use refers to the counted number of advertisements which are put into the data nodes corresponding to the target arc elements, and the co-occurrence relation parameter refers to the counted number of advertisements which are put into the data nodes corresponding to the target arc elements and the data nodes corresponding to the matching arc elements associated with the target arc elements.
It can be seen that in the advertisement putting field, since the arc width of the target arc element is determined according to the usage frequency, the more the counted advertisement quantity is put into the data node corresponding to the target arc element, the wider the target arc element is in the first-level chord chart, and conversely, the narrower is. Because the chord width of the chord element connected with the target arc element is determined according to the co-occurrence relation parameter, the more the advertisement quantity which is obtained by statistics and is simultaneously put into the data node corresponding to the target arc element and the data node corresponding to the matching arc element associated with the target arc element, the wider the chord width of the chord element connected between the target arc element and the matching arc element, and conversely, the narrower the chord width.
In an embodiment, the arc element position parameter includes an arc element coordinate parameter and an arc element angle parameter, and the server determines, according to node usage data and association relationship data included in network data corresponding to each data node, and node information and parent-child relationships recorded by hierarchical data, that each arc element layout parameter and chord element layout parameter in the first-level chord chart to be generated are as follows: and calling a sunchart layout algorithm to calculate level data, and determining arc element coordinate parameters of each arc element in the first level chord chart to be generated, wherein the arc element coordinate parameters comprise inner arc coordinates and outer arc coordinates. And calling a chord graph layout algorithm to calculate association relation data, and determining arc element angle parameters of each arc element and chord element angle parameters of each chord element in the chord graph of the first level to be generated. The arc element angle parameters include a start angle and an end angle of the corresponding arc element, and the chord element angle parameters include a start angle and an end angle of the corresponding chord element.
In one embodiment, each data node corresponds to a category (e.g., age, gender, etc.) that may correspond to one or more data nodes, and the arc elements corresponding to the data nodes of the same category may be arranged in close proximity when generating the first level chord chart.
S404: and if the hierarchy switching instruction for the first hierarchy chord graph is received, determining child data nodes of the target data nodes according to the hierarchy information of the target data nodes, wherein the target data nodes are the data nodes determined by the hierarchy switching instruction in the first hierarchy chord graph.
S405: a second level chord graph is generated for the child data nodes of the target data node. The specific implementation of step S404 may be referred to the description of step S302 to step S303 in the above embodiment, and will not be repeated here.
In one embodiment, after the server generates the first level chord graph, the first level chord graph may be sent to a terminal device, which presents the first level chord graph to the user. When the terminal device detects a node view operation for a first data node in the first-level chord chart, a node view instruction for the first data node can be generated, and the node view instruction can be sent to a server. When the server detects the node checking instruction aiming at the first data node in the first hierarchy chord chart, outputting the hierarchy information of the first data node, the use frequency corresponding to the first data node and the sum of the co-occurrence relation parameters between the first data node and each second associated node in the second associated node set to the terminal equipment, and displaying the hierarchy information of the first data node, the use frequency corresponding to the first data node and the sum of the co-occurrence relation parameters between the first data node and each second associated node in the second associated node set by the terminal equipment. The first data node is a data node determined in the first hierarchical chord graph based on the indication of the node viewing instruction, and the second association node is a node associated with the first data node.
For example, taking the advertisement delivery field as shown in fig. 2c, assuming that the number of advertisements delivered to the data node "4.1" is 186480 (i.e. the frequency of use is 186480), the number of advertisements simultaneously delivered to the data node "4.1" and the data node "1.4" is 25000 (i.e. the co-occurrence relation parameter between the data node "4.1" and the data node "1.4" is 25000), and the number of advertisements delivered to the data node "4.1" and the data node "3.2" is 24000 (i.e. the co-occurrence relation parameter between the data node "4.1" and the data node "3.2" is 24000), and the number of advertisements simultaneously delivered to the data node "4.1" and the data node "5.1" is 25592 (i.e. the co-occurrence relation parameter between the data node "4.1" and the data node "5.1" is 25592). In this case, when a node view instruction for the data node "orientation 4.1" in the chord chart of the first hierarchy is detected, the hierarchy information and the frequency of use of the data node "orientation 4.1" can be obtained, the co-occurrence relation parameters between the data node "orientation 4.1" and all the associated nodes (including the data node "orientation 1.4", "orientation 3.2" and "orientation 5.1") are summed to obtain a sum of the co-occurrence relation parameters as 74592, and further, a prompt box 20 and a breadcrumb navigation 21 with the hierarchy information are output through the terminal device, wherein the prompt box 20 is used for displaying the sum of the frequency of use and the co-occurrence relation parameters corresponding to the data node "orientation 4.1", and the breadcrumb navigation 21 is used for displaying the hierarchy and the category where the data node "orientation 4.1" is located.
In one embodiment, when the server detects a node view instruction for a first data node in the first-level chord graph, the display mode of the arc element corresponding to the first data node, the first chord elements connected with the arc element corresponding to the first data node and the first arc elements corresponding to the second associated nodes in the first-level chord graph can be adjusted according to the first display feature, and the display feature of the chord elements except the first chord elements and the display feature of the arc elements except the first arc elements in the first-level chord graph can be adjusted according to the second display feature. In this way, chord elements and arc elements related to the arc elements corresponding to the first data node can be highlighted, which is beneficial to reducing the visual confusion degree of the first-level chord graph and assisting a user to quickly inquire valuable information from the first-level chord graph.
The first display feature and the second display feature may each include one or more of a display brightness feature, a display transparency feature and a display size feature, where the display brightness feature, the display transparency feature and the display size feature may refer to a display brightness feature, a display transparency feature and a display size feature of each arc element or a chord element in the first-level chord chart, and may also refer to a display brightness feature, a display transparency feature and a display size feature of a node name font corresponding to the arc element.
Illustratively, assuming that the first display characteristic is a first display luminance, the second display characteristic is a second display luminance, the first-level chord graph is as shown in fig. 2d, the first data node is a data node "orientation 4.1", the first data node corresponds to the arc element being an arc element 4.1, and the plurality of first chord elements connecting the arc element 4.1 includes: chord element 1, chord element 2 and chord element 3, the first arc element corresponding to each second association node associated with the first data node comprises: the arc elements corresponding to the data node orientation 1.4 (hereinafter referred to as arc element 1.4), the arc elements corresponding to the data node orientation 5.1 (hereinafter referred to as arc element 5.1) and the arc elements corresponding to the data node orientation 3.2 (hereinafter referred to as arc element 3.2), wherein chord element connection exists among the arc elements 1.4, 5.1 and 3.2 and the arc element 4.1, and therefore, the arc elements 1.4, 5.1 and 3.2 can be referred to as matching arc elements of the arc element 4.1. In this case, the server may adjust the display luminance of the arc element 1.4, the arc element 5.1, the arc element 3.2, and the chord element 1, the chord element 2, and the chord element 3 to the first display luminance and adjust the display luminance of the other arc elements and chord elements to the second display luminance in the first-level chord graph.
In one embodiment, after the server displays the first-level chord chart through the terminal device, if the terminal device detects a chord viewing operation of the user for the second chord element, a chord viewing instruction for the second chord element may be generated, and the chord viewing instruction is sent to the server. When the server receives a chord viewing instruction for the second chord element, the server may output, to the terminal device, a percentage of the second chord element corresponding co-occurrence relation parameter to a sum of co-occurrence relation parameters between two arc elements connected with the second chord element, where the terminal device displays, to a user, the percentage of the second chord element corresponding co-occurrence relation parameter to the sum of co-occurrence relation parameters between two arc elements connected with the second chord element, where the second chord element is a chord element selected based on an instruction of the chord viewing instruction.
In one embodiment, after displaying the arc elements corresponding to the first data node, the plurality of first chord elements connected to the arc elements corresponding to the first data node, and the first arc elements corresponding to the second associated nodes in the first-level chord chart with the first display feature, and displaying the chord elements except for the first chord elements and the arc elements except for the first arc elements in the first-level chord chart with the second display feature, the terminal device locks the display states of the arc elements corresponding to the first data node, the first chord elements and the first arc elements when the locking operation for the first data node is detected, and removes the arc elements corresponding to the first data node when the unlocking operation for the first data node is detected, and returns the display states of the first chord elements and the first arc elements to the normal display state.
The node viewing operation of the first data node may be a virtual cursor suspension operation for a corresponding arc element or node name of the first data node in the first level chord chart, for example, a user suspends a mouse on the corresponding arc element or node name of the first data node; the first data node may also be a sliding operation, a pressing operation, or the like, corresponding to the arc element or the node name. The locking operation for the first data node may be other operations different from the node viewing operation, for example, a virtual cursor clicking operation for a corresponding arc element or node name of the first data node, and so on. The unlocking operation may be the same as or different from the locking operation, and the present application is not particularly limited thereto.
For example, assuming that the first display feature is highlighted, the second display feature is transparent 90%, the node viewing operation is performed in a manner that a mouse is suspended on the corresponding arc element or node name of the first data node, the locking operation is performed in a manner that the corresponding arc element or node name of the first data node is clicked, and the unlocking operation is performed in a manner that the corresponding arc element or node name of the first data node is clicked. First level chord as shown in fig. 2d, the first data node is the data node "orientation 4.1", in which case when the user hovers the mouse over the arc element corresponding to the data node "orientation 4.1" (i.e., arc element 4.1), the terminal device may highlight the arc element 1.4, the chord element 1, the chord element 2, the chord element 3, and the arc element 1.4, the chord element 5.1, and the arc element 3.2, which are related to the data node "orientation 4.1", the displayed transparency is adjusted to 90% for other chord elements and arc elements unrelated thereto. Further, when a click operation (i.e., a lock operation) is received by the user for the data node "Direction 4.1" corresponding to the arc element or node name input, then the highlighting of the chord element and the arc element described above in relation to the data node "Direction 4.1" and the transparent display of other unrelated arc elements and chord elements may be locked. In this case, when the user moves the mouse, highlighting of other arc elements or chord elements is not triggered either.
Further, when the user inputs the clicking operation (i.e., unlocking operation) again for the corresponding arc element or node name of the data node "orientation 4.1", the terminal device may remove the highlighting of the chord element and arc element related to the data node "orientation 4.1" and the transparent display of other unrelated arc elements and chord elements, and restore the normal display state.
In one embodiment, after the server presents the first-level chord chart through the terminal device, the server may control the enlarged display, the reduced display, or the full-screen display of the first-level chord chart when the view control instruction for the specified area is detected. For example, the designated area may be any blank space of the first-level chord chart, when the terminal device detects a double-click operation of the user on any blank space, a view control instruction for indicating to zoom in or display the first-level chord chart in a full screen may be sent to the server, and the server may control to zoom in or display the first-level chord chart in a direct full screen based on the indication of the view control instruction, so that the user can view detailed information better. For another example, the designated area of the first-level chord chart includes an enlarged display identifier, a reduced display identifier, and a full-screen display identifier, and if the view control identifier input for the enlarged display identifier is detected, the enlarged display of the first-level chord chart may be controlled; if the view control identifier input for the reduced display identifier is detected, the reduced display of the first-level chord chart can be controlled; if the view control identifier input for the full-screen display identifier is detected, full-screen display of the first-level chord chart can be controlled.
The embodiment of the present application also provides a computer storage medium having stored therein program instructions for implementing the corresponding method described in the above embodiment when executed.
Referring to fig. 5 again, a schematic structural diagram of a hierarchical data association relationship visualization processing device according to an embodiment of the present application is shown, where the hierarchical data association relationship visualization processing device according to the embodiment of the present application may be disposed in a server.
In one implementation manner of the device according to the embodiment of the application, the device comprises the following structure.
A processing module 50, configured to generate a first-level chord chart based on the target data set, where node information of a plurality of data nodes and association relations between each of the plurality of data nodes are shown on the first-level chord chart;
a detection module 51, configured to receive a level switching instruction for the first level chord chart;
the processing module 50 is further configured to determine, if it is detected that the detection module 51 receives a level switch instruction for the first level chord graph, a child data node of a target data node according to level information of the target data node, and generate a second level chord graph for the child data node of the target data node, where the target data node is a data node determined in the first level chord graph based on an indication of the level switch instruction; and the second-level chord graph shows node information of the sub-data nodes, node information of each associated node in the associated node set associated with the sub-data nodes, and association relations between the sub-data nodes and each associated node.
In one embodiment, the processing module 50 is specifically configured to parse the target data set, determine the data nodes and network data corresponding to the data nodes from the target data set, where the network data includes: the node usage data of each data node and the association relationship data between each data node; acquiring hierarchical data used for representing hierarchical structure relations among all the data nodes, wherein node information of the data nodes and father-son relations among corresponding data nodes are recorded in all the hierarchical data; and generating a first-level chord graph according to the node use data and the association relation data included in the network data corresponding to each data node and the node information and the father-son relation of the hierarchical data record.
In one embodiment, the first-level chord chart includes a plurality of arc elements and a plurality of chord elements connected with the arc elements, the arc elements are used for representing data nodes, the chord elements are used for representing association relations among the data nodes, and node information of corresponding data nodes is recorded at corresponding positions of each arc element.
In one embodiment, the processing module 50 is further specifically configured to determine, according to the node usage data and the association relationship data included in the network data corresponding to each data node, and the node information and the parent-child relationship of the hierarchical data record, each arc element layout parameter and each chord element layout parameter in the first-level chord chart to be generated; generating a first-level chord graph based on the arc element layout parameters and the chord element layout parameters; wherein the arc element layout parameters include: arc element attribute parameters and arc element position parameters, the arc element attribute parameters comprising: any one or more of arc length, arc width, and color parameters; the chord element layout parameters include: chord element angle parameters and chord element width parameters.
In one embodiment, the node usage data includes a usage frequency, the association relationship data includes a co-occurrence relationship parameter, in the generated first-level chord chart, an arc width of a target arc element is determined according to the usage frequency, and a chord width of a chord element connected with the target arc element is determined according to the co-occurrence relationship parameter, where the target arc element is any one of the arc elements;
Wherein, the frequency of use refers to: counting the obtained advertisement quantity put on the data node corresponding to the target arc element; the co-occurrence relation parameter refers to: and counting the obtained advertisement quantity which is simultaneously put into the data node corresponding to the target arc element and the data node corresponding to the matching arc element associated with the target arc element.
In one embodiment, the arc element position parameters include arc element coordinate parameters and arc element angle parameters, and the processing module 50 is further specifically configured to invoke a sunglass layout algorithm to calculate the level data, and determine arc element coordinate parameters of each arc element in the first level chord chart to be generated, where the arc element coordinate parameters include inner arc coordinates and outer arc coordinates; and invoking a chord graph layout algorithm to calculate the association relation data, and determining arc element angle parameters of each arc element and chord element angle parameters of each chord element in the chord graph of the first hierarchy to be generated, wherein the arc element angle parameters comprise a starting angle and an ending angle of the corresponding arc element, and the chord element angle parameters comprise a starting angle and an ending angle of the corresponding chord element.
In one embodiment, the processing module 50 is further specifically configured to determine, according to the level identifier of the target data node, a level identifier next to the level identifier; searching sub-data nodes according to the next-level identification;
The hierarchical identification of each data node belonging to the category of the target data node is obtained by numbering according to a hierarchical numbering rule.
In one embodiment, the apparatus further comprises: the output module 52 is further configured to detect a node view operation for a first data node in the first-level chord graph, where the detection module 51 is further configured to output, when the detection module 51 detects the node view operation for the first data node in the first-level chord graph, level information of the first data node, a frequency of use corresponding to the first data node, and a sum of co-occurrence relationship parameters between the first data node and each second associated node in the second associated node set, where the first data node is a data node determined in the first-level chord graph based on an indication of the node view instruction, and the second associated node is a node associated with the first data node.
In one embodiment, the detecting module 51 is further configured to detect a node view instruction for a first data node in the first level chord chart; the processing module 50 is further configured to, when the detecting module 51 detects the node view instruction for the first data node in the first-level chord graph, adjust, in the first-level chord graph, a display manner of an arc element corresponding to the first data node, a plurality of first chord elements connecting the arc element corresponding to the first data node, and a first arc element corresponding to each second associated node with a first display feature, and adjust, in the first-level chord graph, a display manner of a chord element other than the first chord element and an arc element other than the first arc element with a second display feature.
In one embodiment, the processing module 50 is further configured to adjust, in the generated second-level chord graph, a display manner of a second arc element corresponding to the child data node, a second chord element connecting the second arc element, and a third arc element corresponding to each associated node with a first display feature; and adjusting the display modes of the arc elements except the second arc element and the third arc element in the second-level chord chart and the display modes of the chord elements except the second chord element according to a second display characteristic.
In one embodiment, the detection module 51 is further configured to receive a chord viewing instruction for a second chord element, and the output module 52 is further configured to output, when the detection module 51 receives the chord viewing instruction for the second chord element, a percentage of the second chord element corresponding co-occurrence relation parameter to a sum of co-occurrence relation parameters between two arc elements connected with the second chord element, where the second chord element is a chord element selected by the chord viewing instruction.
In the embodiment of the present application, the specific implementation of each module may refer to the description of the related content in the embodiment corresponding to fig. 1a, fig. 3 or fig. 4.
Referring to fig. 6 again, a schematic structural diagram of a server according to an embodiment of the present application includes a power supply module and other structures, and includes a processor 601, a storage device 602, and a communication interface 603. The processor 601, the storage device 602 and the communication interface 603 may interact data, and the processor 601 implements a corresponding function of visualizing the association relationship of the hierarchical data.
The storage 602 may include volatile memory (RAM), such as random-access memory (RAM); the storage device 602 may also include a non-volatile memory (non-volatile memory), such as a flash memory (flash memory), a Solid State Drive (SSD), etc.; the storage 602 may also include a combination of the types of memory described above.
The processor 601 may be a central processing unit 601 (central processing unit, CPU). In one embodiment, the processor 601 may also be a graphics processor 601 (Graphics Processing Unit, GPU). The processor 601 may also be a combination of a CPU and a GPU. In the server, a plurality of CPUs and GPUs can be included according to requirements to perform corresponding hierarchical data association relation visualization processing. In one embodiment, the storage 602 is configured to store program instructions. The processor 601 may invoke the program instructions to implement the various methods as referred to above in embodiments of the present application.
In a first possible implementation manner, the processor 601 of the server invokes the program instructions stored in the storage device 602 to generate a first-level chord chart based on the target data set, where the first-level chord chart shows node information of a plurality of data nodes and association relations between data nodes in the plurality of data nodes; if a level switching instruction for the first level chord graph is received through the communication interface 603, determining a child data node of a target data node according to the level information of the target data node, wherein the target data node is a data node determined in the first level chord graph based on the indication of the level switching instruction; generating a second-level chord graph for the child data nodes of the target data node; and the second-level chord graph shows node information of the sub-data nodes, node information of each associated node in the associated node set associated with the sub-data nodes, and association relations between the sub-data nodes and each associated node.
In one embodiment, the processor 601 is specifically configured to parse the target data set, determine the data nodes and network data corresponding to the data nodes from the target data set, where the network data includes: the node usage data of each data node and the association relationship data between each data node; acquiring hierarchical data used for representing hierarchical structure relations among all the data nodes, wherein node information of the data nodes and father-son relations among corresponding data nodes are recorded in all the hierarchical data; and generating a first-level chord graph according to the node use data and the association relation data included in the network data corresponding to each data node and the node information and the father-son relation of the hierarchical data record.
In one embodiment, the first-level chord chart includes a plurality of arc elements and a plurality of chord elements connected with the arc elements, the arc elements are used for representing data nodes, the chord elements are used for representing association relations among the data nodes, and node information of corresponding data nodes is recorded at corresponding positions of each arc element.
In one embodiment, the processor 601 is further specifically configured to determine, according to the node usage data and the association relationship data included in the network data corresponding to each data node, and node information and parent-child relationships of the hierarchical data record, each arc element layout parameter and chord element layout parameter in the first-level chord chart to be generated; generating a first-level chord graph based on the arc element layout parameters and the chord element layout parameters; wherein the arc element layout parameters include: arc element attribute parameters and arc element position parameters, the arc element attribute parameters comprising: any one or more of arc length, arc width, and color parameters; the chord element layout parameters include: chord element angle parameters and chord element width parameters.
In one embodiment, the node usage data includes a usage frequency, the association relationship data includes a co-occurrence relationship parameter, in the generated first-level chord chart, an arc width of a target arc element is determined according to the usage frequency, and a chord width of a chord element connected with the target arc element is determined according to the co-occurrence relationship parameter, where the target arc element is any one of the arc elements;
Wherein, the frequency of use refers to: counting the obtained advertisement quantity put on the data node corresponding to the target arc element; the co-occurrence relation parameter refers to: and counting the obtained advertisement quantity which is simultaneously put into the data node corresponding to the target arc element and the data node corresponding to the matching arc element associated with the target arc element.
In one embodiment, the arc element position parameters include arc element coordinate parameters and arc element angle parameters, and the processor 601 is further specifically configured to invoke a sunglass layout algorithm to calculate the level data, and determine arc element coordinate parameters of each arc element in the first level chord chart to be generated, where the arc element coordinate parameters include inner arc coordinates and outer arc coordinates; and invoking a chord graph layout algorithm to calculate the association relation data, and determining arc element angle parameters of each arc element and chord element angle parameters of each chord element in the chord graph of the first hierarchy to be generated, wherein the arc element angle parameters comprise a starting angle and an ending angle of the corresponding arc element, and the chord element angle parameters comprise a starting angle and an ending angle of the corresponding chord element.
In one embodiment, the processor 601 is further specifically configured to determine, according to the level identifier of the target data node, a level identifier next to the level identifier; searching sub-data nodes according to the next-level identification; the hierarchical identification of each data node belonging to the category of the target data node is obtained by numbering according to a hierarchical numbering rule.
In one embodiment, the processor 601 is further configured to, when detecting, through the communication interface 603, a node view instruction for a first data node in the first-level chord graph, output, through the communication interface 603, a sum of level information of the first data node, a frequency of use corresponding to the first data node, and co-occurrence relationship parameters between the first data node and each second associated node in a second associated node set, where the first data node is a data node determined in the first-level chord graph based on an indication of the node view instruction, and the second associated node is a node associated with the first data node.
In one embodiment, the processor 601 is further configured to, when detecting, through the communication interface 603, the node view instruction for the first data node in the first-level chord graph, adjust, in the first-level chord graph, a display manner of an arc element corresponding to the first data node, a plurality of first chord elements connecting the arc element corresponding to the first data node, and a first arc element corresponding to each second associated node, and adjust, in the second display feature, a display manner of a chord element other than the first chord element and an arc element other than the first arc element in the first-level chord graph.
In one embodiment, the processor 601 is further configured to adjust, in the generated second-level chord graph, a display manner of a second arc element corresponding to the child data node, a second chord element connecting the second arc element, and a third arc element corresponding to each associated node with a first display feature; and adjusting the display modes of the arc elements except the second arc element and the third arc element in the second-level chord chart and the display modes of the chord elements except the second chord element according to a second display characteristic.
In one embodiment, the processor 601 is further configured to, when receiving, via the communication interface 603, a chord viewing instruction for a second chord element, output, via the communication interface 603, a percentage of a co-occurrence relationship parameter corresponding to the second chord element to a sum of co-occurrence relationship parameters between two arc elements connected by the second chord element, where the second chord element is a chord element selected by the chord viewing instruction.
In an embodiment of the present application, the specific implementation of the processor 601 may refer to the descriptions of the related content in the embodiments corresponding to fig. 1a, fig. 3 or fig. 4.
Those skilled in the art will appreciate that implementing all or part of the above-described methods in accordance with the embodiments may be accomplished by way of a computer program stored on a computer readable storage medium, which when executed may comprise the steps of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), or the like.
The above disclosure is only a few examples of the present invention, and it is not intended to limit the scope of the present invention, but it is understood by those skilled in the art that all or a part of the above embodiments may be implemented and equivalents thereof may be modified according to the scope of the present invention.

Claims (14)

1. The method for visualizing the association relation of the hierarchical data is characterized by comprising the following steps:
generating a first-level chord graph based on a target data set, wherein the target data set comprises hierarchical data and network data of each data node, the network data comprises node use data of each data node and association relation data among each data node, the node use data comprises use frequency, the association relation data comprises co-occurrence relation parameters, and node information of a plurality of data nodes and association relation among each data node in the plurality of data nodes are displayed on the first-level chord graph; the first-level chord graph is generated based on arc element layout parameters and chord element layout parameters, wherein arc widths included in the arc element attribute parameters in the arc element layout parameters are used for representing use frequency, and chord element width parameters included in the chord element layout parameters are used for representing co-occurrence relation parameters between two data nodes connected with chord elements; the number indicated by the frequency and the arc width positive correlation of the arc element and the chord width positive correlation indicated by the chord element width parameter are used;
If a level switching instruction for the first level chord graph is received, determining sub-data nodes of target data nodes according to the level information of the target data nodes, wherein the target data nodes are data nodes determined in the first level chord graph based on the indication of the level switching instruction;
generating a second-level chord graph for the child data nodes of the target data node, wherein the second-level chord graph shows the association relation between each child data node of the target data node and other related data nodes of the level where the target data node is located;
and the second-level chord graph shows node information of the sub-data nodes, node information of each associated node in the associated node set associated with the sub-data nodes, and association relations between the sub-data nodes and each associated node.
2. The method of claim 1, wherein the generating a first level chord graph based on the target data set comprises:
analyzing the target data set, and determining the data nodes and network data corresponding to the data nodes from the target data set, wherein the network data comprises: the node usage data of each data node and the association relationship data between each data node;
Acquiring hierarchical data used for representing hierarchical structure relations among all the data nodes, wherein node information of the data nodes and father-son relations among corresponding data nodes are recorded in all the hierarchical data;
and generating a first-level chord graph according to the node use data and the association relation data included in the network data corresponding to each data node and the node information and the father-son relation of the hierarchical data record.
3. The method of claim 2, wherein the first level chord graph includes a plurality of arc elements and a plurality of chord elements connected with each arc element, the arc elements are used for representing data nodes, the chord elements are used for representing association relations between each data node, and node information of the corresponding data node is recorded at a corresponding position of each arc element.
4. The method of claim 3, wherein the generating a first level chord graph according to the node usage data and the association relationship data included in the network data corresponding to the data nodes, and the node information and the parent-child relationship of the level data record includes:
Determining each arc element layout parameter and chord element layout parameter in a first-level chord chart to be generated according to the node use data and the association relationship data included in the network data corresponding to each data node and the node information and the father-son relationship recorded by the level data;
generating a first-level chord graph based on the arc element layout parameters and the chord element layout parameters;
wherein the arc element layout parameters include: arc element attribute parameters and arc element position parameters, the arc element attribute parameters comprising: any one or more of arc length, arc width, and color parameters; the chord element layout parameters include: chord element angle parameters and chord element width parameters.
5. The method of claim 4, wherein the node usage data includes a frequency of usage, the association relationship data includes a co-occurrence relationship parameter, in the generated first-level chord graph, an arc width of a target arc element is determined according to the frequency of usage, and a chord width of a chord element connecting the target arc element is determined according to the co-occurrence relationship parameter, the target arc element being any one of the arc elements;
Wherein, the frequency of use refers to: counting the obtained advertisement quantity put on the data node corresponding to the target arc element; the co-occurrence relation parameter refers to: and counting the obtained advertisement quantity which is simultaneously put into the data node corresponding to the target arc element and the data node corresponding to the matching arc element associated with the target arc element.
6. The method of claim 4, wherein the arc element position parameters include arc element coordinate parameters and arc element angle parameters, and the determining the chord element layout parameters of the first-level chord chart to be generated according to the node usage data and the association relationship data included in the network data corresponding to the data nodes and the node information and the parent-child relationship of the hierarchical data record includes:
invoking a Xueri chart layout algorithm to calculate the level data, and determining arc element coordinate parameters of each arc element in the first level chord chart to be generated, wherein the arc element coordinate parameters comprise inner arc coordinates and outer arc coordinates;
and invoking a chord graph layout algorithm to calculate the association relation data, and determining arc element angle parameters of each arc element and chord element angle parameters of each chord element in the chord graph of the first hierarchy to be generated, wherein the arc element angle parameters comprise a starting angle and an ending angle of the corresponding arc element, and the chord element angle parameters comprise a starting angle and an ending angle of the corresponding chord element.
7. The method of claim 1, wherein the determining the child data node of the target data node based on the hierarchical information of the target data node comprises:
determining a next level identification of the level identification according to the level identification of the target data node;
searching sub-data nodes according to the next-level identification;
the hierarchical identification of each data node belonging to the category of the target data node is obtained by numbering according to a hierarchical numbering rule.
8. The method of claim 5, wherein after the generating the first level chord graph, the method further comprises:
and when a node checking instruction for a first data node in the first-level chord graph is detected, outputting the level information of the first data node, the use frequency corresponding to the first data node and the sum of co-occurrence relation parameters between the first data node and each second associated node in a second associated node set, wherein the first data node is a data node determined in the first-level chord graph based on the indication of the node checking instruction, and the second associated node is a node associated with the first data node.
9. The method of claim 8, wherein the method further comprises:
when the node view instruction for the first data node in the first-level chord graph is detected, adjusting display modes of an arc element corresponding to the first data node, a plurality of first chord elements connecting the arc element corresponding to the first data node and the first arc elements corresponding to the second associated nodes in the first-level chord graph by using a first display feature, and adjusting display modes of chord elements except the first chord element and arc elements except the first arc element in the first-level chord graph by using a second display feature.
10. The method of claim 5, wherein after the generating the first level chord graph, the method further comprises:
and when a chord viewing instruction aiming at a second chord element is received, outputting the percentage of the co-occurrence relation parameter corresponding to the second chord element to the sum of the co-occurrence relation parameters between two arc elements connected with the second chord element, wherein the second chord element is the chord element selected based on the indication of the chord viewing instruction.
11. The method of claim 1, wherein after the generating the second level chord graph for the child data nodes of the target data node, the method further comprises:
Adjusting display modes of a second arc element corresponding to the child data node, a second chord element connected with the second arc element and a third arc element corresponding to each associated node in the generated second-level chord graph according to a first display characteristic;
and adjusting the display modes of the arc elements except the second arc element and the third arc element in the second-level chord chart and the display modes of the chord elements except the second chord element according to a second display characteristic.
12. An association relation visualization processing device for hierarchical data, characterized in that the device comprises:
the processing module is used for generating a first-level chord graph based on a target data set, wherein the target data set comprises hierarchical data and network data of each data node, the network data comprises node use data of each data node and association relation data among each data node, the node use data comprises use frequency, the association relation data comprises co-occurrence relation parameters, and node information of a plurality of data nodes and association relation among each data node in the plurality of data nodes are displayed on the first-level chord graph; the first-level chord graph is generated based on arc element layout parameters and chord element layout parameters, wherein arc widths included in the arc element attribute parameters in the arc element layout parameters are used for representing use frequency, and chord element width parameters included in the chord element layout parameters are used for representing co-occurrence relation parameters between two data nodes connected with chord elements; the number indicated by the frequency and the arc width positive correlation of the arc element and the chord width positive correlation indicated by the chord element width parameter are used;
The detection module is used for receiving a level switching instruction of the first level chord graph;
the processing module is further configured to determine, according to the level information of the target data node, a child data node of the target data node and generate a second level chord graph for the child data node of the target data node if it is detected that the detection module receives the level switching instruction for the first level chord graph, where an association relationship between each child data node of the target data node and other related data nodes of a level where the target data node is located is displayed in the second level chord graph, and the target data node is a data node determined in the first level chord graph based on the indication of the level switching instruction; and the second-level chord graph shows node information of the sub-data nodes, node information of each associated node in the associated node set associated with the sub-data nodes, and association relations between the sub-data nodes and each associated node.
13. A server comprising a processor and a storage device, the processor and the storage device being interconnected, wherein the storage device is adapted to store a computer program, the computer program comprising program instructions, the processor being configured to invoke the program instructions to perform the method of any of claims 1-11.
14. A computer storage medium having stored therein program instructions which, when executed, are adapted to carry out the method of any one of claims 1-11.
CN201911287989.8A 2019-12-15 2019-12-15 Hierarchical data association relationship visualization processing method, server and storage medium Active CN111177497B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911287989.8A CN111177497B (en) 2019-12-15 2019-12-15 Hierarchical data association relationship visualization processing method, server and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911287989.8A CN111177497B (en) 2019-12-15 2019-12-15 Hierarchical data association relationship visualization processing method, server and storage medium

Publications (2)

Publication Number Publication Date
CN111177497A CN111177497A (en) 2020-05-19
CN111177497B true CN111177497B (en) 2023-11-24

Family

ID=70653903

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911287989.8A Active CN111177497B (en) 2019-12-15 2019-12-15 Hierarchical data association relationship visualization processing method, server and storage medium

Country Status (1)

Country Link
CN (1) CN111177497B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112084378A (en) * 2020-09-27 2020-12-15 中国建设银行股份有限公司 Single graph display method and device for data
CN113010590B (en) * 2021-02-24 2023-07-07 光大兴陇信托有限责任公司 Unified supervision reporting method and system
CN114138984A (en) * 2021-12-08 2022-03-04 安天科技集团股份有限公司 Relationship map updating method and device, computing equipment and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106886510A (en) * 2015-12-16 2017-06-23 北京国双科技有限公司 The method and device that a kind of chart shows
EP3304816A1 (en) * 2015-06-05 2018-04-11 Cisco Technology, Inc. Interactive hierarchical network chord diagram for application dependency mapping
CN109643458A (en) * 2016-06-06 2019-04-16 珀金埃尔默健康科学有限公司 The system and method that sinogram for automation is completed, combines and completed by combination

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6771732B2 (en) * 2002-02-28 2004-08-03 The Board Of Trustees Of The University Of Illinois Methods and apparatus for fast divergent beam tomography

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3304816A1 (en) * 2015-06-05 2018-04-11 Cisco Technology, Inc. Interactive hierarchical network chord diagram for application dependency mapping
CN106886510A (en) * 2015-12-16 2017-06-23 北京国双科技有限公司 The method and device that a kind of chart shows
CN109643458A (en) * 2016-06-06 2019-04-16 珀金埃尔默健康科学有限公司 The system and method that sinogram for automation is completed, combines and completed by combination

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"HTC-CHORD: AN IMPROVED CHORD MODEL BASED ON TOPIC-CLUSTER AND HIERARCHIC LAYER";Zhao Jingling等;《 2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology》;第1-4页 *
"基于弦图的CT图像环形伪影校正";余晓锷等;《第四军医大学学报》;第207-209页 *

Also Published As

Publication number Publication date
CN111177497A (en) 2020-05-19

Similar Documents

Publication Publication Date Title
CN111177497B (en) Hierarchical data association relationship visualization processing method, server and storage medium
Burch et al. Parallel edge splatting for scalable dynamic graph visualization
US9836552B2 (en) GUI for viewing and manipulating connected tag clouds
Eick et al. Visual scalability
US7412650B2 (en) Method of representing information on a three-dimensional user interface
US20170323028A1 (en) System and method for large scale information processing using data visualization for multi-scale communities
US20160314126A1 (en) Entity fingerprints
CN107885713B (en) File format conversion method, device, equipment and storage medium
CN104115145A (en) Generating visualizations of display group of tags representing content instances in objects satisfying search criteria
US9384575B2 (en) Space constrained small format visual analytic labeling
JP5225004B2 (en) Content visualization apparatus and content visualization method
WO2018174365A1 (en) Method for visualizing chart of data table
Liao et al. Cluster-based visual abstraction for multivariate scatterplots
CN113360580A (en) Abnormal event detection method, device, equipment and medium based on knowledge graph
CN109885610A (en) A kind of abstracting method of structural data, device, electronic equipment and storage medium
Wei et al. Linear building pattern recognition in topographical maps combining convex polygon decomposition
CN114399784A (en) Automatic identification method and device based on CAD drawing
US20160224741A1 (en) Data input method
US9342577B2 (en) Preference-based data representation framework
JP5096850B2 (en) Search result display method, search result display program, and search result display device
CN116955856A (en) Information display method, device, electronic equipment and storage medium
Ceglar et al. Guiding knowledge discovery through interactive data mining
JP2009252185A (en) Information searching device, information searching method, control program, and recording medium
CN114143109A (en) Visual processing method, interaction method and device for attack data
US20220075803A1 (en) Graph framework (database methods) to analyze trillion cell reservoir and basin simulation results

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant