CN110543528A

CN110543528A - Information display method and device, electronic equipment and storage medium

Info

Publication number: CN110543528A
Application number: CN201910695742.3A
Authority: CN
Inventors: 刘臣
Original assignee: Shenzhen Zhongyi Weirong Technology Co Ltd
Current assignee: Jianlian Technology Guangdong Co ltd
Priority date: 2019-07-30
Filing date: 2019-07-30
Publication date: 2019-12-06

Abstract

the embodiment of the disclosure discloses an information display method and device, electronic equipment and a storage medium. Wherein, the method comprises the following steps: establishing a first attribute graph taking a target user as a central node according to a relationship network of the target user; marking entities in the first attribute graph, which are matched with preset node labels, node attributes, edge types or edge attributes; the first property map is shown with unlabeled entities omitted.

Description

Information display method and device, electronic equipment and storage medium

Technical Field

the present disclosure relates to the field of computer technologies, and in particular, to an information display method and apparatus, an electronic device, and a storage medium.

background

in the field of financial wind control, a Graph Database (Graph Database) is used to record relationships between users. When a credit auditor audits an incoming piece, the relationship structure of the user to which the incoming piece belongs is displayed through a graphical display tool of the graph database. Specifically, a subgraph with the user to which the element belongs as the center node is obtained according to the required Degree of Relationship (Degree of Relationship), and then the subgraph is graphically displayed. However, sometimes, because the entities (node and edge both belong to entity) in the subgraph are numerous and complex, it is difficult to read the relationship between the central node and other entities.

disclosure of Invention

in view of the above technical problems in the prior art, embodiments of the present disclosure provide an information display method, an information display apparatus, an electronic device, and a computer-readable storage medium, so as to solve the problem that readability of image data is not high.

A first aspect of the embodiments of the present disclosure provides an information display method, including:

establishing a first attribute graph taking a target user as a central node according to a relationship network of the target user;

marking entities in the first attribute graph, which are matched with preset node labels, node attributes, edge types or edge attributes;

The first property map is shown with unlabeled entities omitted.

In some embodiments, the establishing a first attribute graph with a target user as a central node according to a relationship network of the target user includes:

Acquiring a second attribute graph established according to a relationship network among a plurality of users;

Acquiring the relationship network of the target user from the second attribute graph according to the required relationship degree;

And establishing a subgraph of the second attribute graph according to the relationship network of the target user, and taking the subgraph as the first attribute graph.

In some embodiments, the marking an entity in the first attribute map, which matches a preset node label, node attribute, edge type, or edge attribute, includes:

traversing all the entities in the first attribute graph by taking the central node as a starting point, and marking the entities matched with preset node labels, node attributes, edge types or edge attributes.

in some embodiments, said presenting said first property map after omitting unmarked entities comprises:

obtaining all paths from the central node to any of the marked entities;

Presenting the first property graph in a manner that does not present the entities that are not on any of the paths.

obtaining all paths from the central node to any of the marked entities;

Acquiring path segments of unmarked entities from marked entities to the central node or between marked entities in the path;

the first attribute map is presented in a manner that the path segment is presented as a preset image and/or symbol.

in some embodiments, the preset image and/or symbol is a dashed line.

In some embodiments, the method further comprises:

Receiving a viewing request for the displayed preset images and/or symbols;

And displaying the entity on the path section corresponding to the preset image and/or symbol.

in some embodiments, the displaying the entity on the path segment corresponding to the preset image and/or symbol includes:

Directly displaying at least one entity on the path segment corresponding to the preset image and/or symbol;

And gradually displaying the entities on the path segment corresponding to the preset images and/or symbols according to a preset sequence.

A second aspect of the embodiments of the present disclosure provides an information presentation apparatus, including:

The system comprises an establishing module, a first attribute graph and a second attribute graph, wherein the establishing module is configured to establish a first attribute graph with a target user as a central node according to a relationship network of the target user;

A marking module configured to mark an entity in the first attribute graph, which matches a preset node label, node attribute, edge type, or edge attribute;

a first presentation module configured to present the first property graph after omitting unmarked entities.

In some embodiments, the establishing module comprises:

A first obtaining sub-module configured to obtain a second attribute map established according to a relationship network between a plurality of users;

the second obtaining submodule is configured to obtain the relationship network of the target user from the second attribute graph according to the required relationship degree;

And the establishing sub-module is configured to establish a sub-graph of the second attribute graph as the first attribute graph according to the relationship network of the target user.

in some embodiments, the tagging module comprises:

And the marking sub-module is configured to traverse all the entities in the first attribute graph by taking the central node as a starting point, and mark the entities matched with preset node labels, node attributes, edge types or edge attributes.

In some embodiments, the first display module comprises:

A third obtaining submodule configured to obtain all paths from the central node to any of the marked entities;

a first presentation submodule configured to present the first property graph in a manner that does not present the entity that is not on any of the paths.

In some embodiments, the first display module comprises:

a fourth obtaining submodule configured to obtain all paths from the central node to any of the marked entities;

A fifth obtaining sub-module, configured to obtain a path segment of an unmarked entity from a marked entity to the central node or between marked entities in the path;

A second presentation submodule configured to present the first attribute map in such a manner that the path segment is presented as a preset image and/or symbol.

in some embodiments, the preset image and/or symbol is a dashed line.

in some embodiments, the apparatus further comprises:

A receiving module configured to receive a viewing request for the presented preset image and/or symbol;

And the second display module is configured to display the entity on the path segment corresponding to the preset image and/or symbol.

In some embodiments, the second display module comprises:

a third display sub-module configured to directly display at least one entity on the path segment corresponding to the preset image and/or symbol;

And the fourth display sub-module is configured to gradually display the entities on the path segments corresponding to the preset images and/or symbols according to a preset sequence.

A third aspect of the embodiments of the present disclosure provides an electronic device, including:

a memory and one or more processors;

wherein the memory is communicatively coupled to the one or more processors, and the memory stores instructions executable by the one or more processors, and when the instructions are executed by the one or more processors, the electronic device is configured to implement the method according to the foregoing embodiments.

a fourth aspect of the embodiments of the present disclosure provides a computer-readable storage medium having stored thereon computer-executable instructions, which, when executed by a computing device, may be used to implement the method according to the foregoing embodiments.

a fifth aspect of embodiments of the present disclosure provides a computer program product comprising a computer program stored on a computer readable storage medium, the computer program comprising program instructions which, when executed by a computer, are operable to implement a method as in the preceding embodiments.

In the embodiment of the disclosure, the marked entities are entities concerned by the creditor, and in essence, the creditor is concerned with the relationship between the central node and the marked entities, and by omitting entities that are not related to the relationship between the central node and the marked entities, namely, unmarked entities, in the displayed graph, the displayed graph is simplified, and the readability of the relationship between the central node and the marked entities is improved.

drawings

The features and advantages of the present disclosure will be more clearly understood by reference to the accompanying drawings, which are illustrative and not to be construed as limiting the disclosure in any way, and in which:

FIG. 1 is a schematic flow chart diagram illustrating a method of presenting information in accordance with some embodiments of the present disclosure;

FIG. 2 is a schematic flow chart of step S101 according to the embodiment shown in FIG. 1;

FIG. 3 is a schematic flow chart of step S103 according to the embodiment shown in FIG. 1;

FIG. 4 is a schematic view of another flowchart according to step S103 in the embodiment shown in FIG. 1;

FIG. 5 is a block diagram of an information presentation device, shown in accordance with some embodiments of the present disclosure.

FIG. 6 is a schematic structural diagram of an electronic device suitable for implementing an information presentation method according to an embodiment of the present disclosure

Detailed Description

In the following detailed description, numerous specific details of the disclosure are set forth by way of examples in order to provide a thorough understanding of the relevant disclosure. However, it will be apparent to one of ordinary skill in the art that the present disclosure may be practiced without these specific details. It should be understood that the use of the terms "system," "apparatus," "unit" and/or "module" in this disclosure is a method for distinguishing between different components, elements, portions or assemblies at different levels of sequence. However, these terms may be replaced by other expressions if they can achieve the same purpose.

It will be understood that when a device, unit or module is referred to as being "on" … … "," connected to "or" coupled to "another device, unit or module, it can be directly on, connected or coupled to or in communication with the other device, unit or module, or intervening devices, units or modules may be present, unless the context clearly dictates otherwise. For example, as used in this disclosure, the term "and/or" includes any and all combinations of one or more of the associated listed items.

The terminology used in the present disclosure is for the purpose of describing particular embodiments only and is not intended to limit the scope of the present disclosure. As used in the specification and claims of this disclosure, the terms "a," "an," "the," and/or "the" are not intended to be inclusive in the singular, but rather are inclusive in the plural, unless the context clearly dictates otherwise. In general, the terms "comprises" and "comprising" are intended to cover only the explicitly identified features, integers, steps, operations, elements, and/or components, but not to constitute an exclusive list of such features, integers, steps, operations, elements, and/or components.

These and other features and characteristics of the present disclosure, as well as the methods of operation and functions of the related elements of structure and the combination of parts and economies of manufacture, will be better understood by reference to the following description and drawings, which form a part of this specification. It is to be expressly understood, however, that the drawings are for the purpose of illustration and description only and are not intended as a definition of the limits of the disclosure. It will be understood that the figures are not drawn to scale.

various block diagrams are used in this disclosure to illustrate various variations of embodiments according to the disclosure. It should be understood that the foregoing and following structures are not intended to limit the present disclosure. The protection scope of the present disclosure is subject to the claims.

Fig. 1 is a schematic diagram of an information presentation method according to some embodiments of the present disclosure. In some embodiments, the information presentation method is performed by a client device. As shown in fig. 1, the information presentation method includes the following steps:

step S101: and establishing a first Property Graph (Property Graph) taking the target user as a central node according to the relationship network of the target user.

in the credit auditing scene, the target user is the user to which the current to-be-audited incoming piece belongs. The information to be reviewed by the credit reviewer includes, in addition to personal information of the target user, such as an identification card, a mobile phone number, a bank card, borrowing information, an equipment number, and the like, based on the rationale of "nearly-vermilion and nearly-inkier black", a relationship network of the target user with another person, for example, a user associated with the target user by being identical to the target user in the first 6 digits of an identification number.

in this embodiment, the relationship network between the target user and the other people is described by an attribute map (i.e. the first attribute map). The Property Graph (Property Graph) is a directed Graph composed of vertices (Vertex), which are also called nodes, and edges (Edge), which are also called relationships (Relationship); each node is provided with a node Label (Label) and a node attribute, an edge is provided with an edge type (namely a relationship type) and an edge attribute (Property), the node and the edge are entities on the attribute graph, all nodes exist independently, and the Label is set for the node, so that the nodes with the same Label belong to a group and a set; edges are grouped by edge type, with edges of the same type belonging to the same set. Edges are directional, the two ends of the edge are a starting node and an ending node, the directions are identified by directional arrows, and the bidirectional relationship between the nodes is identified by two edges with opposite directions. Nodes may have zero, one, or more labels, but edges must set an edge type, and only one edge type can be set.

in the first attribute graph, "taking the target user as a central node" does not mean that the node corresponding to the target user is necessarily located at the center of the first attribute graph, "the central node" is not necessarily located at the center, and the core node concerned by the creditor is the central node.

step S102: and marking entities which are matched with preset node labels, node attributes, edge types or edge attributes in the first attribute graph.

The entities in the first attribute graph are not equally important, and what the creditor focuses on is only a specific part of the entities, such as "black list" node labels, "credit score" node attributes, "shared" edge types, or "time period" edge attributes, and the like, and the entities that the creditor focuses on are the "preset node labels, node attributes, edge types, or edge attributes" described above.

In order to identify, highlight, record these specific entities in the first property graph, the present embodiment handles these specific entities in a marked manner. "Mark" does not necessarily mean that the graph data will be modified, although modifying the graph data is an option, and in one embodiment, since entities in the graph data will be assigned unique numbers by the system, the numbers of these particular entities and their node labels, node attributes, edge types, or edge attributes that match the preset node labels, node attributes, edge types, or edge attributes may be stored by additional table data.

Step S103: the first property map is shown with unlabeled entities omitted.

in the prior art, when graph data is visualized as a graph, all entities are displayed, and when the number of the entities is large and the relationship is complex, the generated graph is not easy to read by an auditor.

However, only the relationship between the central node and the marked entity is necessary for the auditor, so in this embodiment, by omitting the entity that is not related to the relationship between the central node and the marked entity, i.e. the unmarked entity, in the presented first attribute map, the presented map is simplified, and the readability of the relationship between the central node and the marked entity is improved.

In some optional embodiments, as shown in fig. 2, step S101, that is, the step of establishing the first attribute map with the target user as a central node according to the relationship network of the target user, may include:

step S201: and acquiring a second attribute map established according to the relationship network among the plurality of users.

traditionally, the relational network between multiple users is described by a relational database, but such a database is far less efficient to query than a graph-based database due to JOIN operations and the like. Currently, there are some financial institutions that store a user's relationship network through a graph database (e.g., Neo 4J). In this embodiment, the second attribute graph is such graph data describing the user relationship network. But unlike the first property diagram, the second property diagram may describe relationships between all users and thus may be much larger than the first property diagram.

Step S202: and acquiring the relationship network of the target user from the second attribute graph according to the required relationship degree.

Degree of Relationship (Degree of Relationship) refers to the number of entities (only nodes are considered here) involved in a Relationship. For example, the relationship "A-B" of A includes B one entity (node) in addition to A, which is a 1 degree relationship, and the relationship "A-B-C" of A includes two entities (nodes) of B and C in addition to A, which is a 2 degree relationship. If we want to find 3 degree relationships for A, we want to find all "A-X-X-X".

Although the data of the larger relational degree is more complete, the data volume can rise significantly, and the difficulty of data analysis can increase significantly. Only degrees of relationships below 2 degrees are typically considered in credit reviews.

in order to obtain the relationship network of the target user, the second attribute graph may be traversed using the target user as a starting point, and it is needless to traverse all nodes, and it is only necessary to traverse to the required entity according to the required degree of relationship.

Step S203: and establishing a subgraph of the second attribute graph according to the relationship network of the target user, and taking the subgraph as the first attribute graph.

in some optional embodiments, the step 102 may further specifically include:

in this optional implementation, all entities in the first attribute map may be traversed from the central node as a starting point, for example, the first attribute map may be traversed by a depth-first traversal method, where the depth-first traversal method starts from the central node, accesses each adjacent point of the central node after taking the central node as a starting point, selects one of the adjacent points that has not been traversed, continues to access the adjacent point of the new starting node by taking the adjacent point as a new starting node until a leaf node in the first attribute map, then returns to a next adjacent point in a previous layer, and so on until all nodes and edges in the first attribute map are accessed. The accessing process actually reads the node tag, the node attribute, the edge type or the edge attribute of the accessed entity, and then compares the node tag, the node attribute, the edge type or the edge attribute with preset node tags, node attributes, edge types or edge attributes, and if the node tag, the node attribute, the edge type or the edge attribute of the accessed entity is matched with the preset node tag, the node attribute, the edge type or the edge attribute, the entity is marked.

in some optional embodiments, as shown in fig. 3, step S103 may further specifically include:

Step S301: all paths from the central node to any of the marked entities are obtained.

for the creditor, if there is a blacklist user in the relationship network of the target user, it is necessary to know how the target user is associated with the blacklist user, and in terms of the graph, the target user node and the blacklist user node are connected through which paths. In this embodiment, there may be multiple paths from the central node to a marked entity, and these paths may be independent of each other, or may intersect or partially overlap with each other.

step S302: presenting the first property graph in a manner that does not present the entities that are not on any of the paths.

The paths obtained by the last step include all information concerned by the creditor, and entities not on the paths are negligible for the creditor. In this step, these negligible entities are therefore not exposed when the first property graph is exposed. Not exposed does not mean that these negligible entities are removed from the first property diagram, but merely "not exposed".

In some optional embodiments, as shown in fig. 4, step S103 may further specifically include:

Step S401: obtaining all paths from the central node to any of the marked entities;

Step S402: acquiring path segments of unmarked entities from marked entities to the central node or between marked entities in the path;

Step S403: the first attribute map is shown in a manner that the path is shown as a preset image and/or symbol.

in the previous embodiment, by presenting the first attribute map in a manner that does not present the entities that are not on any of the paths, the map is simplified and readability is improved. However, as mentioned above, there may be multiple paths from the central node to a marked entity, such as a group of cluttering, from which it is difficult to clearly identify a specific path, and readability is still low. These paths therefore need to be further simplified in order to further improve readability. For the creditor, it is only necessary to know whether the central node is connected with a tagged entity or not, that is, whether a path exists or not, and then it is possible to know how the central node is connected with a tagged entity, that is, the entity on each path, in a path-by-path manner. Therefore, in this embodiment, the details on the path are temporarily omitted in step S402, only the information about whether the tagged entities are connected to the central node or the tagged entities is provided, i.e. whether the path segments exist, and then the path segments are shown in step S403 to indicate that the path segments omit some detailed information. Thereby, readability is further improved.

in some alternative implementations, the preset images and/or symbols may be images or symbols that visually represent the omitted entity, such as may be represented by an ellipsis (… …) or dashed line. It is to be understood that the symbol may also include the number of omitted entities, etc. The specific situation may be determined according to actual situations, and is not limited herein.

in some optional embodiments, the method may further include:

Receiving a viewing request for the displayed preset images and/or symbols;

In this alternative implementation, after the omitted entity in the first property diagram is replaced by a preset image and/or symbol, if the relevant person wishes to view the omitted entity while browsing the first property diagram, a viewing request may be issued by a preset operation manner such as clicking, and after the system receives the viewing request, the omitted entity may be presented on the first property diagram. Since a plurality of entities on any one path segment are replaced by one preset image or symbol, the entity on the path segment corresponding to the requested preset image and/or symbol is shown when any relevant preset image or symbol is used for sending a viewing request.

in some optional embodiments, the step of presenting the entity on the path segment corresponding to the preset image and/or symbol may further include at least one of:

In this optional implementation, after receiving a viewing request for any one preset image and/or symbol from a related person, in some embodiments, all entities on the corresponding path segment may be directly displayed; in other embodiments, all entities on the corresponding path segment may be displayed step by step according to a preset sequence. For example, after the relevant person clicks any one of the preset images and/or symbols, the first entity on the corresponding path segment may be displayed first, after the relevant person performs the click operation again, the second entity may be displayed, and so on, and finally, all the entities on the path segment may be displayed under the click operation of the relevant person.

in addition, as mentioned above, when there are multiple paths connected from the central node to a marked entity, these paths may be independent from each other, or may intersect or partially overlap with each other, which makes it difficult to distinguish each path one by one. Therefore, when multiple paths from a central node to a marked entity or multiple paths from a marked entity to another marked entity are shown, the multiple paths can be shown at the same time or at different times. For example, paths 1, 2 and 3 exist between a and C, only any one path may be shown at a time, or only any two paths may be shown, so that even if some paths are crossed or overlapped, each path can be clearly distinguished, and thus readability is mentioned.

the above is a specific implementation of the information display method provided by the present disclosure.

fig. 5 is a schematic view of an information presentation device according to some embodiments of the present disclosure. As shown in fig. 5, the information presentation apparatus includes:

an establishing module 501, configured to establish a first Property Graph (Property Graph) with a target user as a central node according to a relationship network of the target user;

a marking module 502 configured to mark an entity in the first attribute map that matches a preset node label, node attribute, edge type, or edge attribute;

a first presentation module 503 configured to present the first attribute map after omitting the unmarked entities.

The information display apparatus in this embodiment corresponds to the information display method, that is, the establishing module 501, the marking module 502, and the first display module 503 correspond to step 101, step 102, and step 103 shown in fig. 1, and specific details may refer to the description of the information display method, which is not described herein again.

Wherein the establishing module comprises:

In this embodiment, the first obtaining sub-module, the second obtaining sub-module, and the establishing sub-module included in the establishing module correspond to and are consistent with step 201, step 202, and step 203 included in step 101 shown in fig. 2, and specific details may refer to the description of the contents shown in fig. 2, which is not described herein again.

wherein the marking module comprises:

the marking module in this embodiment corresponds to step 102 in the information displaying method, and specific details may refer to the description of the information displaying method, which is not described herein again.

wherein the first display module comprises:

In this embodiment, the third obtaining sub-module and the first displaying sub-module included in the first displaying module correspond to step 301 and step 302 included in step 103 shown in fig. 3, and specific details may refer to the description of the content shown in fig. 3, and are not described herein again.

Wherein the first display module comprises:

In this embodiment, the fourth obtaining sub-module, the fifth obtaining sub-module, and the second displaying sub-module included in the first displaying module correspond to and are consistent with step 401, step 402, and step 403 included in step 103 shown in fig. 4, and specific details may refer to the description of the contents shown in fig. 4, which is not described herein again.

wherein the preset image and/or symbol is a dotted line.

wherein the apparatus further comprises:

the information display apparatus in this embodiment corresponds to the information display method, and specific details may refer to the description of the information display method, which is not described herein again.

Wherein the second display module comprises:

fig. 6 is a schematic structural diagram of an electronic device suitable for implementing an information presentation method according to an embodiment of the present disclosure.

As shown in fig. 6, the electronic apparatus 600 includes a Central Processing Unit (CPU)601 that can execute various processes in the embodiment shown in fig. 1 described above according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM603, various programs and data necessary for the operation of the electronic apparatus 600 are also stored. The CPU601, ROM602, and RAM603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.

The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 as necessary.

In particular, according to embodiments of the present disclosure, the method described above with reference to fig. 1 may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a medium readable thereby, the computer program comprising program code for performing the method of fig. 1. In such embodiments, the computer program may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowcharts or block diagrams may represent a module, a program segment, or a portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

the units or modules described in the embodiments of the present disclosure may be implemented by software or hardware. The units or modules described may also be provided in a processor, and the names of the units or modules do not in some cases constitute a limitation of the units or modules themselves.

as another aspect, the present disclosure also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus in the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present disclosure.

in summary, the present disclosure provides an information displaying method, an information displaying apparatus, an electronic device and a computer-readable storage medium thereof. In the embodiment of the disclosure, the marked entities are entities concerned by the creditor, and in essence, the creditor is concerned with the relationship between the central node and the marked entities, and by omitting entities that are not related to the relationship between the central node and the marked entities, namely, unmarked entities, in the displayed graph, the displayed graph is simplified, and the readability of the relationship between the central node and the marked entities is improved.

it is to be understood that the above-described specific embodiments of the present disclosure are merely illustrative of or illustrative of the principles of the present disclosure and are not to be construed as limiting the present disclosure. Accordingly, any modification, equivalent replacement, improvement or the like made without departing from the spirit and scope of the present disclosure should be included in the protection scope of the present disclosure. Further, it is intended that the following claims cover all such variations and modifications that fall within the scope and bounds of the appended claims, or equivalents of such scope and bounds.

Claims

1. An information display method, comprising:

the first property map is shown with unlabeled entities omitted.

2. The method according to claim 1, wherein the establishing a first attribute graph with a target user as a central node according to a relationship network of the target user comprises:

3. The method according to claim 1 or 2, wherein the marking entities in the first attribute map that match a preset node label, node attribute, edge type or edge attribute comprises:

4. The method of claim 3, wherein said presenting said first property graph after omitting unmarked entities comprises:

Obtaining all paths from the central node to any of the marked entities;

5. The method of claim 3, wherein said presenting said first property graph after omitting unmarked entities comprises:

Obtaining all paths from the central node to any of the marked entities;

6. Method according to claim 5, characterized in that said preset images and/or symbols are dashed lines.

7. The method according to any one of claims 5-6, further comprising:

receiving a viewing request for the displayed preset images and/or symbols;

8. the method according to claim 7, wherein the displaying the entity on the path segment corresponding to the preset image and/or symbol comprises:

9. An information presentation device, comprising:

10. the apparatus of claim 9, wherein the establishing module comprises:

11. The apparatus of claim 9 or 10, wherein the marking module comprises:

12. The apparatus of claim 11, wherein the first display module comprises:

13. The apparatus of claim 11, wherein the first display module comprises:

14. The apparatus of claim 13, wherein the preset image and/or symbol is a dotted line.

15. the apparatus according to any one of claims 13-14, further comprising:

16. the apparatus of claim 15, wherein the second display module comprises:

17. An electronic device, comprising:

a memory and one or more processors;

wherein the memory is communicatively coupled to the one or more processors and has stored therein instructions executable by the one or more processors, the electronic device being configured to implement the method of any of claims 1-8 when the instructions are executed by the one or more processors.

18. A computer-readable storage medium having stored thereon computer-executable instructions operable, when executed by a computing device, to implement the method of any of claims 1-8.