Information processing device, program, and method for displaying knowledge graphs
The information processing device enhances knowledge graph visualization by spacing field nodes and connecting them with edges, improving user comprehension of node relationships.
Patent Information
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2024-09-12
- Publication Date
- 2026-03-25
AI Technical Summary
Existing knowledge graph visualization technologies make it difficult for users to understand the relationships between nodes as the information increases, leading to a complex and hard-to-view graph.
An information processing device that controls the display of a knowledge graph by placing field nodes at spaced-apart positions and connecting them with edges, while positioning other nodes in a non-overlapping manner, using a two- or three-dimensional area diagram to facilitate understanding.
The solution enables users to easily see the relationships between nodes, making the knowledge graph more understandable and accessible.
Smart Images

Figure 2026052944000001_ABST
Abstract
Description
Technical Field
[0001] This disclosure relates to a data visualization technology for graphically displaying data, and particularly to a knowledge graph display technology.
Background Art
[0002] A knowledge graph refers to a network of knowledge that systematically connects various knowledge (= knowledge) and is represented in a graph structure composed of nodes and edges. A knowledge graph is also referred to as a knowledge graph.
[0003] Also, generally, although a knowledge graph can show how information (knowledge) is related and combined, there is a problem that as the information (knowledge) increases, the knowledge graph becomes complex and difficult for people to view.
[0004] For example, Patent Document 1 discloses a technique of displaying a part of a knowledge graph and an overall thumbnail on a display screen, and marking and displaying on the overall thumbnail which position of the overall thumbnail the part corresponds to. According to Patent Document 1, the user can not only easily view the nodes and edges of the knowledge graph displayed on the display screen, but also clearly know the overall position of the currently viewed graph.
Prior Art Documents
Patent Documents
[0005]
Patent Document 1
Summary of the Invention
Problems to be Solved by the Invention
[0006] However, in the technology disclosed in Patent Document 1, the relationships between each node in the knowledge graph displayed on the screen require interpreting the information associated with each node. Therefore, it is desirable to devise a way to make the relationships between each node easier for users viewing the knowledge graph to see.
[0007] In one aspect, this disclosure aims to provide an information processing device, etc., that can display the relationships between each node in an easily understandable way for users viewing a knowledge graph. [Means for solving the problem]
[0008] (1) The information processing device of the present disclosure is an information processing device that controls the display of a knowledge graph composed of a plurality of nodes and edges indicating the relationships between each of the plurality of nodes, wherein the plurality of nodes consist of a plurality of field nodes which are nodes relating to points including location information, and a plurality of other nodes which are of a different type from the plurality of field nodes and are related to at least one of the plurality of field nodes, and is characterized by comprising: a first control unit that controls the display in a manner in which two or more field nodes are placed at spaced-apart positions on an area diagram represented in two or three dimensions indicated by the location information, and at least two adjacent field nodes among the placed two or more field nodes are connected by the edges; and a second control unit that controls the display of the knowledge graph in a manner in which the other nodes related to the placed two or more field nodes are placed at positions that do not overlap with the two or more field nodes, and the two or more field nodes and the other nodes are connected by the edges. • A "three-dimensional area map" is a concept that includes real or virtual spaces, such as a three-dimensional map or a metaverse space.
[0009] (2) In such an information processing device, the other nodes include person nodes which are nodes relating to people, object nodes which are nodes relating to things other than people, and event nodes which are nodes relating to events, and the second control unit may display the knowledge graph in a manner in which at least one of the person nodes, object nodes, and event nodes and the field node are connected by the edge.
[0010] (3) The field node may represent a location related to history or legend, the person node may represent a person related to the history or legend, the object node may represent an object other than a person related to the history or legend, and the event node may represent an event related to the history or legend. A "location node" is a node that represents a point of interest, such as a historical or legendary spot or area. A "thing node" is a node that represents an object related to an episode, such as a historical or legendary cultural artifact or work of art. A "person node" is a node that represents the subject of an episode, such as a person, a monster, an animal, or a legendary being. A "event node" is a node that represents an event related to an episode, such as a historical or legendary event or incident.
[0011] (4) In such an information processing device, the two adjacent field nodes may be related within the historical or legendary episode.
[0012] (5) The knowledge graph is related to the episode of the history or the legend, and the knowledge graph may be connected to other knowledge graphs related to episodes different from the episode of the history or the legend by an edge via at least one of the other nodes.
[0013] (6) The system may include a third control unit that displays, along with the knowledge graph, information indicating that the logical or physical sequence of events in the historical or legendary episode is a mystery, and that the game involves navigating the locations on a map where the multiple field nodes are placed in order to solve the mystery. "Logical or physical history" refers to the concept of indicating either physical or logical history among the four types of relationships between episodes (identical or similar relationships, physical history relationships, logical history relationships, and relationships indicating completely different circumstances).
[0014] (7) The third control unit may display information on at least one of the plurality of field nodes indicating that it is a node for solving a problem based on the relationship between the at least one field node and other field nodes, or for going to the location on the map where the at least one field node is located to solve the problem, and may display information on at least one of the plurality of other nodes indicating that it is a node for solving a problem based on the relationship between the at least one other node and other field nodes, or for going to the location on the map where the at least one other node and field nodes are located to solve the problem.
[0015] (8) The program of the present disclosure is an information processing device that controls the display of a knowledge graph comprising a plurality of nodes and edges indicating the relationships between each of the plurality of nodes, wherein the plurality of nodes consist of a plurality of field nodes which are nodes relating to points including location information, and a plurality of other nodes which are of a different type from the plurality of field nodes and which are related to at least one of the plurality of field nodes, and the first control step of controlling the display of the knowledge graph by arranging two or more field nodes at spaced-apart positions on a two- or three-dimensional area diagram indicated by the location information, and connecting at least two adjacent field nodes among the arranged two or more field nodes with the edges, and causing a computer to execute the following:
[0016] (9) The method for displaying a knowledge graph of the present disclosure is a method for displaying a knowledge graph composed of a plurality of nodes and edges indicating the relevance between each of the plurality of nodes. The plurality of nodes include a plurality of place nodes that are nodes related to locations including position information, and a plurality of other nodes that are different in type from the plurality of place nodes and are related to at least one of the plurality of place nodes. The method includes a first control step of performing control to display in a manner where two or more place nodes are arranged at separated positions on an area diagram represented in two dimensions or three dimensions indicated by the position information, and at least two adjacent place nodes among the arranged two or more place nodes are connected by the edges; and a second control step of performing control to display the knowledge graph in a manner where other nodes related to the arranged two or more place nodes are arranged at positions not overlapping with the two or more place nodes, and the two or more place nodes and the other nodes are connected by the edges.
Advantages of the Invention
[0017] The information processing apparatus and the like of the present disclosure can display the relevance of each node in an easy-to-see manner for a user viewing the knowledge graph.
Brief Description of the Drawings
[0018] [Figure 1] It is a schematic diagram showing the outline of the information processing system of the present disclosure. [Figure 2] It is a functional block diagram of the information processing apparatus of the present disclosure. [Figure 3] It is a conceptual diagram showing an example of the aspect of the knowledge graph displayed on the display unit of the user terminal. [Figure 4] It is a conceptual diagram showing another example of the aspect of the knowledge graph displayed on the display unit of the user terminal. [Figure 5] It is a functional block diagram of the user terminal of the present disclosure. [Figure 6] It is a schematic diagram showing an example of the hardware configuration of the information processing apparatus. [Figure 7] It is a schematic diagram showing an example of the hardware configuration of the user terminal. [Figure 8]It is a schematic flow showing an example of the operation of an information processing apparatus. [Figure 9] It is a conceptual diagram showing an example of a field node arranged on an area diagram. [Figure 10] It is a conceptual diagram showing an example of an edge connecting the field nodes shown in FIG. 9. [Figure 11] It is a conceptual diagram showing an example of other nodes arranged on an area diagram. [Figure 12] It is a functional block diagram of an information processing apparatus according to a modified example. [Figure 13] It is a conceptual diagram showing an example of an interface screen of a game using a knowledge graph. [Figure 14] It is a conceptual diagram showing another example of an interface screen of a game using a knowledge graph. [Figure 15] It is a schematic flow showing an example of the operation of an information processing apparatus according to a modified example. [Figure 16] It is a conceptual diagram showing an example of an area diagram. [Figure 17] It is a conceptual diagram showing an example of a field node, an edge arranged on an area diagram, and a determined course. [Figure 18] It is a conceptual diagram showing an example of a knowledge graph superimposed on an area diagram 211. [Figure 19] It is a conceptual diagram showing an example of a field node determined for a mission node. [Figure 20] It is a conceptual diagram showing an example of other nodes determined for a mission node. [Figure 21] It is a diagram showing an example of a mission problem presented at a mission node. [Figure 22] It is a diagram showing an example of an answer to the mission problem shown in FIG. 21. [Figure 23] It is a diagram showing an example of a general explanation and an episode shown at a node that is not a mission node.
Embodiments for Carrying Out the Invention
[0019] The following describes in detail an information processing device, etc., according to one aspect of this disclosure, with reference to the drawings. The embodiments described below are all specific examples of this disclosure. The numerical values, shapes, components, and their positions shown in the following embodiments are examples only and are not intended to limit this disclosure. Furthermore, among the components in the following embodiments, those not described in the independent claim representing the highest-level concept will be described as arbitrary components. Also, in all embodiments, the contents of each can be combined.
[0020] Furthermore, the following drawings are schematic, and some components may be omitted for illustrative purposes. Also, common parts in one or more embodiments may be denoted by the same reference numeral, and their descriptions may be omitted.
[0021] [1. Overview] (Information Processing System) First, an overview of the information processing system including the information processing device 1 will be described. Figure 1 is a schematic diagram showing an overview of the information processing system of this disclosure. The information processing system shown in Figure 1 comprises the information processing device 1 and a plurality of user terminals 2.
[0022] (Information processing device) The information processing device 1 controls the display of each node and edge in the knowledge graph in an easy-to-see manner, and the relationships between each node are also easy to see.
[0023] For example, the information processing device 1 generates and stores a knowledge graph represented by four types of nodes, including field nodes located in real or virtual space. The information processing device 1 detects an area and, based on the stored knowledge graph, fixes and places multiple field nodes on the area diagram. The information processing device 1 then controls the display so that the other three types of nodes and edges are arranged so that they do not overlap with the field nodes. As a result, the information processing device 1 can arrange and display multiple nodes and edges that constitute a part of the knowledge graph (a partial graph) in a way that is easy for the user to see, according to the area diagram displayed on the display unit 21 of the user terminal 2. In addition, the information processing device 1 can display the relationships between each node of the knowledge graph in an easy-to-see way on the display unit 21 of the user terminal 2.
[0024] (Knowledge graph) As described above, the knowledge graph consists of multiple nodes and edges that show the relationships between each of the multiple nodes. In this disclosure, the multiple nodes consist of multiple field nodes that include location information and multiple other nodes that are of a different type from the multiple field nodes and are related to at least one of the multiple field nodes. The other nodes include person nodes, which are nodes related to people, object nodes, which are nodes related to things other than people, and event nodes, which are nodes related to events. In other words, the knowledge graph in this disclosure is a knowledge graph consisting of four types of nodes: field nodes, person nodes, object nodes, and event nodes, and edges, and may be referred to as a human-object-word graph.
[0025] The information processing device 1 may also generate other subgraphs corresponding to other area diagrams adjacent to the detected area diagram but not displayed on the display unit 21 of the user terminal 2. In this case, the displayed subgraph (knowledge graph) and the other undisplayed subgraph (other knowledge graph) are connected by an edge via at least one other node. For example, if a knowledge graph is related to an episode of history or legend, the knowledge graph and other knowledge graphs related to episodes different from the historical or legendary episode are connected by an edge via at least one other node. Furthermore, the information processing device 1 can also provide an interface screen for gamified content, such as a historical site tour game or a historical mystery quest game, utilizing the knowledge graph described above.
[0026] (User 20) User 20 is a user utilizing User Terminal 2. Users include both children and adults. User 20 reads through episodes associated with field nodes and other nodes adjacent to field nodes in the knowledge graph displayed on the display unit 21 of User Terminal 2, and reads through the relationships between each node. Furthermore, if the Information Processing Device 1 provides a game-like interface screen using the knowledge graph on the display unit 21 of User Terminal 20, User 20 can also engage in game-like activities provided by the Information Processing Device 1 through that interface screen.
[0027] (User terminal 2) User terminal 2 is a terminal used by user 20, and the display unit 21 displays a portion of the knowledge graph (partial graph) superimposed on a predetermined area provided by the information processing device 1. User terminal 2 can also display a game-like interface screen using the knowledge graph provided by the information processing device 1 on the display unit 21.
[0028] (Communication Network 3) The information processing device 1 and the user terminal 2 are connected to communicate via the Internet or an intranet (communication network 3). Communication network 3 is, for example, the Internet. Communication network 3 may also be an intranet, a wired or wireless communication network. Wireless communication may include, for example, Bluetooth®, Wi-Fi®, or LPWA (Low Power Wide Area). As LPWA, LTE® or a frequency band that does not require a license may be used.
[0029] [2. Detailed explanation] Figure 2 is a functional block diagram of the information processing device 1 of this disclosure. Figure 3 is a conceptual diagram showing an example of the configuration of the knowledge graph displayed on the display unit 21 of the user terminal 2. Figure 4 is a conceptual diagram showing another example of the configuration of the knowledge graph displayed on the display unit 21 of the user terminal 2. Figure 5 is a functional block diagram of the user terminal 2 of this disclosure. Details of the information processing device 1 and the user terminal 2 will be described below.
[0030] (Information Processing Device 1) Information processing device 1 is, for example, a server or a personal computer, and controls the display of a knowledge graph (human-object-word graph) composed of multiple nodes and edges that show the relationships between each of the multiple nodes.
[0031] (Human-Thing-Word Graph) As mentioned above, the Human-Object-Word Graph is a knowledge graph composed of four types of nodes: field nodes, which are nodes related to locations including location information; person nodes, which are nodes related to people; object nodes, which are nodes related to things other than people; and event nodes, which are nodes related to events, along with edges connecting the nodes. The Human-Object-Word Graph knowledge graph is generated from multiple episodes contained in a text. The Human-Object-Word Graph knowledge graph may also be generated based on an episode graph. An example of how the Human-Object-Word Graph knowledge graph is displayed is shown in Figures 3 and 4. That is, the Human-Object-Word Graph knowledge graph is displayed superimposed on an area diagram 211, for example, on the display unit 21 of the user terminal 2. The area diagram 211 in this embodiment is a map showing a predetermined district or region, as shown in Figures 3 and 4. The area diagram 211 is not limited to the two-dimensional (planar) case shown in Figures 3 and 4, but may also be three-dimensional (three-dimensional), such as a metaverse space or a three-dimensional map.
[0032] For example, the knowledge graph, which is a human-object-word graph as shown in Figure 3, is composed of field nodes 301-305, person nodes 306-310, object nodes 311 and 312, and event node 313. Field node 301 and field node 302 are connected by edge 401. Field node 302 and field node 303 are connected by edges 402 and 405, field node 303 and field node 304 are connected by edge 403, and field node 304 and field node 305 are connected by edge 404. Furthermore, field node 302 and person node 306 are connected by edge 407, field node 302 and person node 307 are connected by edge 408, person node 307 and person node 308 are connected by edge 409, and field node 303 and person node 308 are connected by edge 410. Field node 304 and object node 312 are connected by edge 411, field node 304 and person node 309 are connected by edge 412, and person node 309 and object node 311 are connected by edge 414. Field node 305 and person node 310 are connected by edge 415, field node 305 and event node 313 are connected by edge 416, event node 313 and field node 303 are connected by edge 417, and event node 313 and person node 307 are connected by edge 418. Edges 401-418 are represented as undirected line segments. Field nodes 301-305, person nodes 306-310, object nodes 311 and 312, and event node 313 are represented in shapes that can be distinguished by a user viewing the knowledge graph, and are located in different positions from each other.
[0033] In the example shown in Figure 3, the locations 1 to 5 indicated in location nodes 301 to 305 represent names related to the locations corresponding to location nodes 301 to 305, such as the names of historical sites. Similarly, the people 1 to 5 indicated in person nodes 306 to 310 represent names related to people corresponding to person nodes 306 to 310, such as the names of people associated with the location nodes, object nodes, and event nodes connected to person nodes 306 to 310. Furthermore, object 1 and object 2 indicated in object nodes 311 and 312 represent names related to objects other than people corresponding to object nodes 311 and 312, such as the names of works of art and crafts associated with the location nodes and person nodes connected to object nodes 311 and 312. Event 1 indicated in event node 313 represents names related to events corresponding to event node 313, such as the names of events associated with location nodes 303 and 305 and person node 307 connected to event node 313.
[0034] Furthermore, the knowledge graph, which is a human-object-word graph as shown in Figure 4, consists of field nodes 351-355, person nodes 356-360, object nodes 361 and 362, and event node 363. Field node 351 and field node 352 are connected by edge 451. Field node 352 and field node 353 are connected by edges 452 and 455, field node 353 and field node 354 are connected by edges 453 and 456, and field node 354 and field node 355 are connected by edge 454. In addition, field node 352 and person node 356 are connected by edge 457, field node 353 and person node 358 are connected by edge 458, person node 357 and person node 358 are connected by edge 459, and field node 354 and object node 362 are connected by edge 460. Field node 354 and person node 359 are connected by edge 461, field node 355 and object node 361 are connected by edge 462, field node 355 and person node 360 are connected by edge 463, field node 355 and event node 363 are connected by edge 464, field node 353 and event node 363 are connected by edge 465, and event node 363 and person node 357 are connected by edge 467.
[0035] Edges 451-467 are represented as undirected line segments, similar to Figure 3. The field nodes 351-355, the person nodes 356-360, the object nodes 361 and 362, and the event node 363 are located in different positions from each other. Furthermore, the field nodes 351-355, the person nodes 356-360, the object nodes 361 and 362, and the event node 363 are represented by icons designed to evoke images of field, person, object, and event, allowing users viewing the knowledge graph to easily distinguish between them. The icon shapes are just examples; any shape is acceptable as long as it allows users viewing the knowledge graph to easily identify the four types of nodes.
[0036] (episode) An episode can be a story that specifically describes an event, or it can be a relatively coherent story, i.e., a short anecdote. The episodes disclosed here are sentences that describe who took what action (or what state occurred), and are not limited to historical events. For example, an episode could be a single step in a cooking recipe, or the content of a statement made by a single person in meeting minutes.
[0037] (Episode graph) The knowledge graph, which is an episode graph, is composed of nodes (episode nodes) that represent each of the multiple episodes contained in the text, and edges (chronology edges) that represent each of the episodes in the text. The chronology edges of the episode graph are represented by directed line segments, although they are not shown in the illustration. The information processing device 1 may also generate an episode graph from each of the multiple episodes contained in the text and generate a human-object-word graph based on the episode graph.
[0038] In this embodiment, the information processing device 1 includes an acquisition unit 11, a reception unit 12, a storage unit 13, and a control unit 14, as shown in Figure 2. However, the information processing device 1 does not necessarily have to include the storage unit 13. The storage unit 13 can be located outside the information processing device 1 and can be accessed by the information processing device 1.
[0039] (Information processing device 1, acquisition unit 11) The acquisition unit 11 acquires a knowledge graph (human-object-word graph) generated from a text containing multiple episodes, either at the instruction of the user of the information processing device 1 or automatically, and stores it in the storage unit 13. For example, the acquisition unit 11 may acquire the knowledge graph (human-object-word graph) by prompting a generation AI via a communication network such as the internet to generate a knowledge graph (human-object-word graph) from a text containing multiple episodes. Alternatively, the acquisition unit 11 may have a generation AI internally and acquire the knowledge graph (human-object-word graph) by instructing the generation AI to generate a knowledge graph (human-object-word graph) from a text containing multiple episodes.
[0040] Note that while texts containing multiple episodes include historical texts, they are not limited to these; any text containing multiple episodes, such as a cooking recipe or the contents of a meeting transcript, is acceptable.
[0041] Furthermore, in this disclosure, if a knowledge graph (people-thing-word graph) generated from a text containing multiple episodes is stored in the memory unit 13 and is available, the acquisition unit 11 is not an essential component.
[0042] (Information processing device 1, reception unit 12) The reception unit 12 can receive instructions from the user of the information processing device 1. The reception unit 12 can also receive instructions from the user 20 transmitted from the user terminal 2. For example, the reception unit 12 can receive instructions from the user of the information processing device 1 to generate or acquire a knowledge graph (human-object-word graph). Furthermore, for example, the reception unit 12 can receive instructions from the user terminal 2 to display the knowledge graph (human-object-word graph) on the display unit 21.
[0043] (Information processing device 1, storage unit 13) The storage unit 13 is composed of an HDD (Hard Disk Drive), an SSD (Solid State Drive), or memory. In this embodiment, for example, the storage unit 13 stores a knowledge graph (people, things, words graph) acquired by the acquisition unit 11.
[0044] (Information processing device 1, control unit 14) As shown in Figure 2, the control unit 14 comprises a first control unit 141 and a second control unit 142.
[0045] The first control unit 141 places two or more field nodes at spaced-apart positions on an area diagram represented in two or three dimensions. The first control unit 141 controls the display of at least two adjacent field nodes from the placed two or more field nodes in a manner in which they are connected by edges.
[0046] For example, the first control unit 141 may select one of the knowledge graphs (human-object-word graphs) stored in the memory unit 13 and detect one or more regions within the selected knowledge graph (human-object-word graph) in which field nodes and other nodes (person nodes, object nodes, event nodes) are complexly connected to the neighboring area. In this case, the first control unit 141 may identify a region from the one or more detected regions that corresponds to the area diagram to be displayed on the display unit 21 of the user terminal 2. The first control unit 141 detects the field nodes included in the area corresponding to the area diagram from among the multiple field nodes included in the identified region and extracts, for example, five field nodes from the detected field nodes. Then, the first control unit 141 places the five extracted field nodes at spaced-out positions on the area diagram according to the position information. Note that the number of extracted field nodes is not limited to five; it is sufficient if the field nodes can be placed at appropriate spacing within the area diagram, do not overlap even when other nodes are placed, and the number is easy for the user to see when the field nodes placed on the area diagram are displayed.
[0047] Furthermore, the first control unit 141 controls the display on the user terminal 2's display unit 21, for example, by connecting at least two adjacent field nodes with edges to five field nodes located at spaced-apart positions on the area diagram. Note that if the first control unit 141 can control the display on the user terminal 2's display unit 21 in this manner, it is not necessary for it to actually display the data on the user terminal 2's display unit 21.
[0048] The second control unit 142 places other nodes that are related to two or more field nodes placed by the first control unit 141 in positions that do not overlap with those two or more field nodes. The second control unit 142 controls the display of the knowledge graph in a manner in which two or more field nodes and other nodes are connected by edges.
[0049] For example, the second control unit 142 extracts other nodes from among the multiple other nodes included in the region identified by the first control unit 141 that are connected by an edge to any of the five field nodes extracted by the first control unit 141. The second control unit 142 then places the extracted other nodes in a position on the area diagram that does not overlap with the five field nodes placed by the first control unit 141.
[0050] Furthermore, the second control unit 142 controls the display of a portion of the knowledge graph (human-object-word graph) in a manner in which a field node and another node, or any two nodes, are connected by an edge on the area diagram. Specifically, the second control unit 142 controls the display of a knowledge graph in which at least one of a person node, object node, or event node is connected to the field node by an edge on the area diagram. As a result, the second control unit 142 can actually display a knowledge graph like the one shown in Figure 3 or Figure 4 on the display unit 21 of the user terminal 2. However, if the second control unit 142 can control the display of such a knowledge graph on the display unit 21 of the user terminal 2, it is not necessary to actually display it on the display unit 21 of the user terminal 2.
[0051] Furthermore, the second control unit 142 may perform control to output, from among the nodes included in the knowledge graph displayed on the display unit 21 of the user terminal 2, the description of the episode associated with the specified node and the episode showing the relationship between the specified node and other nodes connected by edges. In other words, when any of the person nodes, object nodes, event nodes, or place nodes that constitute the knowledge graph are specified, the second control unit 142 may perform control to display the description (content) of the episode associated with the specified node and the content of the episode related to the specified node.
[0052] Furthermore, if there are multiple episodes associated with the specified node and those episodes contain time information, the second control unit 142 may perform control to display the multiple episodes in chronological order. Furthermore, the first control unit 141 and the second control unit 142 perform control to display edges as undirected line segments, from the viewpoint of making the knowledge graph easier to read. The first control unit 141 and the second control unit 142 also perform control to hide autoregressive edges (connecting to only one node), from the viewpoint of making the knowledge graph easier to read.
[0053] In this way, the information processing device 1 displays a portion of the knowledge graph (human-object-word graph) in a limited area such as the display unit 21 of the user terminal 2, making it easy for the user viewing the knowledge graph to see each node, each edge, and the relationships between each node. Furthermore, the human-object-word graph is composed of four types of nodes, and by looking at a node, it is possible to understand the content of the episode. Therefore, the user viewing the knowledge graph can easily select a node and easily read through the episode associated with the selected node.
[0054] (User terminal 2) User terminal 2 is a device capable of communicating with information processing device 1, such as a smartphone. Alternatively, a tablet PC, personal computer, or other device may be used as user terminal 2.
[0055] In this embodiment, the user terminal 2, as shown in Figure 5, includes a display unit 21, a terminal acquisition unit 22, and an instruction transmission unit 23.
[0056] (User terminal 2, display unit 21) The display unit 21 displays information acquired by the user terminal 2 from the information processing device 1. The display unit 21 may be an image display device such as a liquid crystal display (LCD), plasma display panel (PDP), or organic electroluminescence (EL).
[0057] In this embodiment, the display unit 21 displays the area diagram 211 acquired by the user terminal 2 from the information processing device 1 and the knowledge graph (people, things, words graph) superimposed on the area diagram 211. The display unit 21 can also display only the area diagram 211 acquired by the user terminal 2 from the information processing device 1. Furthermore, the display unit 21 can display an episode description associated with a node designated by the user 20 among the nodes included in the displayed knowledge graph (people, things, words graph), and an episode showing the relationship between a predetermined node and other nodes connected by edges.
[0058] (User terminal 2, terminal acquisition unit 22) The terminal acquisition unit 22 acquires information transmitted by the information processing device 1. In this embodiment, the terminal acquisition unit 22 acquires an area diagram 211 and a knowledge graph (human-object-word graph) superimposed on the area diagram 211 from the information processing device 1. The terminal acquisition unit 22 can also acquire, from among the nodes included in the knowledge graph (human-object-word graph) displayed on the display unit 21, the description of the episode associated with the node designated by the user 20, and the episode showing the relationship between a predetermined node and other nodes connected by edges.
[0059] (User terminal 2, instruction transmission unit 23) The instruction transmission unit 23 transmits instructions from the user 20 to the information processing device 1. In this embodiment, the instruction transmission unit 23 can transmit to the information processing device 1 that a predetermined node among the nodes included in the knowledge graph (people, things, and words graph) has been selected by the display unit 21.
[0060] [3. Hardware Configuration] Figure 6 is a schematic diagram showing an example of the hardware configuration of the information processing device 1. Figure 7 is a schematic diagram showing an example of the hardware configuration of the user terminal 2.
[0061] Next, the hardware configurations of the information processing device 1 and the user terminal 2 will be explained using Figures 6 and 7.
[0062] (Hardware configuration of information processing device 1) The hardware configuration of the information processing device 1 is described below. As shown in Figure 6, the information processing device 1 of this embodiment uses, for example, a computer. The information processing device 1 is equipped with a CPU 170. The CPU 170 is connected to a memory 171, a connection port 173 for connecting / reading storage devices 172, etc., and a communication circuit 174 for communicating with the outside via a network, all via a bus line 175. The memory 171 stores an information processing device program 1713 for processing the information processing device 1. It may also store a browser program 1712 and an OS 1711 (operating system). Furthermore, it may store a knowledge graph management database (hereinafter referred to as the knowledge graph DB) 1715. Note that the memory 171 may be the storage unit 13, or it may be something different from the storage unit 13. If the memory 171 and the storage unit 13 are different, the knowledge graph DB 1715 is stored in the storage unit 13.
[0063] (Hardware configuration of user terminal 2) The hardware configuration of user terminal 2 is almost the same as that of the information processing device 1 described above, so the same parts are denoted by the same reference numerals, and their explanation is omitted. In this embodiment, user terminal 2 uses, for example, a smartphone.
[0064] The computer's memory 171 stores a user terminal program 1717 for processing user terminal 2. It may also store a browser program 1712 and an OS 1711 (operating system).
[0065] In this embodiment, the information processing device program 1713 and the user terminal program 1717 work together using the functions of the OS 1711 and the browser program 1712, respectively. Alternatively, the information processing device program 1713 and the user terminal program 1717 may operate independently without using the browser program 1712 and the OS 1711, respectively.
[0066] In the hardware configuration of the information processing device 1 and user terminal 2 described above, the functions shown in Figures 2 and 5 are implemented, for example, using the CPU 170, the user terminal program 1717, and the information processing device program 1713. However, some or all of these functions may be sequence-controlled using logic circuits such as a microcontroller or a PLC (programmable logic controller).
[0067] (Knowledge Graph DB1715) Knowledge graph DB1715 stores the knowledge graph (human-object-word graph) acquired by the information processing device 1. The knowledge graph (human-object-word graph) does not need to be in the form of a knowledge graph as shown in Figures 3 and 4, for example; it is sufficient to store elements that constitute a knowledge graph (human-object-word graph), such as multiple nodes of four types, multiple edges, and the connection relationships between those edges.
[0068] [4. Operation of Information Processing Device 1] Figure 8 is a schematic flow showing an example of the operation of the information processing device 1. Figure 9 is a conceptual diagram showing an example of field nodes arranged on the area diagram. Figure 10 is a conceptual diagram showing an example of edges connecting the field nodes shown in Figure 9. Figure 11 is a conceptual diagram showing an example of other nodes arranged on the area diagram. In Figures 9 to 11, the same reference numerals are used for elements similar to those in Figure 4, and detailed explanations are omitted.
[0069] The operation of the information processing device 1 will be explained below using Figures 8 to 11. Figure 8 shows a flowchart illustrating one embodiment of the processing of the information processing device program 1713 used in the information processing device 1. The symbol "S" in Figure 8 represents a step.
[0070] (S11) The CPU 170 of the information processing device 1 places two or more field nodes at spaced-apart positions on an area diagram represented in two or three dimensions. In this embodiment, the information processing device 1 detects one or more regions from the knowledge graph (people, things, words graph) stored in the memory unit 13 in which field nodes and other nodes (people nodes, things, events) are complexly connected to each other. The information processing device 1 extracts, for example, two or more field nodes from among the field nodes included in the region corresponding to the area diagram displayed on the display unit 21 of the user terminal 2. The information processing device 1 places the extracted two or more field nodes at spaced-apart positions on the area diagram according to the position information.
[0071] Furthermore, the information processing device 1 may, for example, display two or more field nodes placed at spaced-apart positions on the area diagram on the display unit 21 of the user terminal 2, as shown in Figure 9. In the example shown in Figure 9, icons representing five field nodes 351 to 355, placed at spaced-apart positions on the area diagram 211, are displayed on the display unit 21.
[0072] (S12) The CPU 170 of the information processing device 1 displays the two or more field nodes placed in step S11 in a manner in which at least two adjacent field nodes are connected by edges.
[0073] For example, as shown in Figure 10, the information processing device 1 may display on the display unit 21 of the user terminal 2 a configuration in which multiple field nodes arranged on the area diagram 211 are connected by edges. In the example shown in Figure 10, edge 451 connecting field node 351 and field node 352, and edges 452 and 455 connecting field node 352 and field node 353 are displayed on the display unit 21. Also in the example shown in Figure 10, edges 453 and 456 connecting field node 353 and field node 354, and edge 454 connecting field node 354 and field node 355 are displayed on the display unit 21.
[0074] (S13) The CPU 170 of the information processing device 1 places other nodes that are related to the two or more field nodes placed in step S11 in positions that do not overlap with the two or more field nodes. In this embodiment, the information processing device 1 extracts other nodes from the knowledge graph (human-object-word graph) stored in the memory unit 13 that are included in the area corresponding to the area diagram and are connected by an edge to any of the two or more field nodes placed in step S11. The information processing device 1 places the extracted other nodes in a position on the area diagram that does not overlap with the two or more field nodes placed in step S11.
[0075] Furthermore, the information processing device 1 may, for example as shown in Figure 11, display on the display unit 21 of the user terminal 2 multiple other nodes that are placed in positions on the area diagram that do not overlap with two or more spaced-apart field nodes on the area diagram. In the example shown in Figure 11, icons representing multiple other nodes placed on the area diagram 211, namely person nodes 356-360, object nodes 361 and 362, and event node 363, are displayed on the display unit 21.
[0076] (S14) The CPU 170 of the information processing device 1 displays a knowledge graph in which two or more field nodes are connected to other nodes by edges. For example, as shown in Figure 4, the information processing device 1 may display a knowledge graph on the display unit 21 of the user terminal 2, in which multiple field nodes arranged on the area diagram 211 are connected to other nodes by edges.
[0077] (modified version) From here, other examples of the information processing device 1 will be described as modifications.
[0078] [5. Detailed explanation of the modified example] (Information Processing Device 1A) Figure 12 is a functional block diagram of the modified information processing device 1A. Figure 13 is a conceptual diagram showing an example of a game interface screen using a knowledge graph. Figure 14 is a conceptual diagram showing another example of a game interface screen using a knowledge graph. Elements similar to those shown in Figures 2 to 4 are denoted by the same reference numerals, and detailed explanations are omitted.
[0079] The information processing device 1A shown in Figure 12 differs from the information processing device 1 shown in Figure 2 in that the configuration of the control unit 14 includes a third control unit 143A, and a generation unit 15A is added.
[0080] Information processing device 1A provides a game interface screen that utilizes a knowledge graph, which clearly displays each node, each edge, and the relationships between nodes. In this modified example, the game using the knowledge graph is described as a historical mystery quest, but it is not limited to this. Any game that utilizes a knowledge graph and has gameplay elements is acceptable.
[0081] (Historical Mystery Quest) Historical Mystery Quest is a game where you visit historical sites while solving mysteries in a game-like manner. In Historical Mystery Quest, you can progress through solving mysteries (that is, solving the mysteries presented) by reading historical episodes related to the spots (places) you visit.
[0082] Specifically, the game "History Mystery Quest" involves starting from a point and aiming for the goal, solving presented missions, and finally deriving the answer to a historical mystery. In this History Mystery Quest, mysteries related to the historical site tour are presented, and for each mission solved, one letter that makes up a keyword is obtained. In this History Mystery Quest, when you enter the answer to a presented mission, a response is displayed indicating whether the answer is correct, an explanation, or a prompt for the next action. In this History Mystery Quest, when all the missions are solved, the keyword is completed, and when the completed keyword is entered, a response (the answer to the mystery and an explanation) appears on the screen, and the game ends.
[0083] In this way, in Historical Mystery Quest, players progress through solving mysteries by reading historical episodes related to a specific location, thus gaining knowledge not only about the location itself but also about the people, events, and objects associated with it. Furthermore, Historical Mystery Quest is generated using a knowledge graph (people, things, and words graph), enabling visual and intuitive understanding and progression. Moreover, playing this game, Historical Mystery Quest, can be expected to have an educational effect, allowing players to learn about living history.
[0084] (Information processing device 1A, modified control unit 14) As shown in Figure 12, the modified control unit 14 comprises a first control unit 141, a second control unit 142, and a third control unit 143A. The modified control unit 14, as shown in Figures 13 and 14, for example, displays a game interface screen for a historical mystery quest that utilizes a knowledge graph composed of four types of nodes on the display unit 21 of the user terminal 2.
[0085] (Graph of knowledge about torture) In this modified example, the knowledge graph is related to a historical or legendary episode. The four types of nodes that make up this knowledge graph are, as mentioned above, location nodes, person nodes, object nodes, and event nodes. Location nodes represent locations such as historical or legendary spots and areas, for example, historical sites. Person nodes represent subjects of the episode, for example, people, spirits, animals, or legendary beings, for example, historical or legendary characters. Object nodes represent objects related to the episode, for example, historical or legendary cultural artifacts or works of art. Event nodes represent events related to the episode, for example, historical or legendary events and incidents, for example, historical events. In addition, at least two adjacent location nodes are related within the historical or legendary episode.
[0086] (Information processing device 1A, first control unit 141, second control unit 142)
[0087] In this modified version, the first control unit 141 extracts, for example, five field nodes from among the field nodes included in the area corresponding to the area diagram, based on the condition that they are accessible on foot, by bus, or by electric train. The first control unit 141 then determines the course that visits the five extracted field nodes as the course for the historical mystery quest. For example, in the example shown in Figure 13, the course around field nodes 301 to 305 is determined as the course for the historical mystery quest, and in the example shown in Figure 14, the course around field nodes 351 to 355 is determined as the course for the historical mystery quest. Note that in Figure 13, the thick lines on edges 401 to 404 indicate the course around field nodes 301 to 305, and the thin lines on edges 405 to 417 indicate the relationships between nodes. In Figure 14, the thick lines on edges 451 to 454 indicate the course around field nodes 351 to 355, and the thin lines on edges 455 to 467 indicate the relationships between nodes.
[0088] Furthermore, in this modified example, the first control unit 141 displays on the display unit 21 of the user terminal 2, after the operation of the third control unit 143 (described later), a configuration in which at least two adjacent field nodes are connected by edges to a plurality of field nodes placed at spaced-apart positions on the area diagram.
[0089] Similarly, the second control unit 142 displays a knowledge graph on the display unit 21 after the operation of the third control unit 143, which will be described later, in which at least one of the person node, object node, and event node is connected to the location node by an edge on the area diagram.
[0090] As the other functions of the first control unit 141 and the second control unit 142 are as described above, we will omit further explanation.
[0091] (Information processing device 1A, third control unit 143A) The third control unit 143A displays information, along with a knowledge graph, indicating that the game involves exploring the locations of multiple field nodes on a map in order to solve a mystery that is either logical or physical in nature.
[0092] (Logical or physical history) The relationships between episodes can be classified into four categories: 1) identical or similar relationships, 2) relationships showing progression over time or through procedures (i.e., physical relationships), 3) relationships showing progression through causal relationships (i.e., logical relationships), and 4) relationships showing complete differences (i.e., relationships showing different relationships). Furthermore, for a given episode, the "why" element can be extracted as the logical relationship, and the "how" element as the physical relationship.
[0093] Furthermore, the third control unit 143A can extract spots associated with each field node, people associated with each person node, events associated with each event node, and objects associated with each object node, and associate them with each node.
[0094] Here, the third control unit 143A may extract an overview and episodes of the spots associated with each location node and associate them with each node. Alternatively, for each person node, each object node, and each event node, only the episodes related to the location node may be extracted and associated with each other node. Furthermore, when a location node that is not a mission node is specified (selected) by the user 20 of the user terminal 2, the third control unit 143A may display an overview of the specified location node or an episode summarized using, for example, 5W1H (When, Where, Who, What, Why, How). Also, when a non-mission node is specified (selected) by the user 20, the third control unit 143A may display episodes in chronological order showing the relationship with the historical site spot. If the specified other node is a non-mission node associated with two or more spots, the third control unit 143A may summarize the episodes related to each spot and display them as episodes in chronological order.
[0095] Furthermore, the third control unit 143A can extract stories from episodes related to the extracted spots, people, events, and objects, explaining why and how they acted or were in a particular state within the district or region corresponding to that area map. The third control unit 143A can then determine that the extracted story is a mystery.
[0096] In the examples shown in Figures 13 and 14, information 601 indicating the mystery determined by the third control unit 143A is shown. Figures 13 and 14 also show the quest title as "Investigate Edo's Biggest Incident, 'Incident 1'!". "Incident 1" is the name of the event corresponding to incident node 313 in Figure 13 and incident node 363 in Figure 14.
[0097] Furthermore, the third control unit 143A can determine that at least one of the multiple field nodes constituting the knowledge graph is a mission node, which is a node that solves the presented mission problem. Similarly, the third control unit 143A can determine that at least one of the multiple other nodes constituting the knowledge graph is a mission node, which is a node that solves the presented mission problem. Here, the third control unit 143A may determine the mission node based on the configuration of the knowledge graph and the content of the episodes of the other nodes. The third control unit 143A can display information indicating that the at least one field node and at least one other node that have been determined to be mission nodes are mission nodes.
[0098] In the example shown in Figure 13, the shapes representing the field node 303, the person nodes 307 and 310, and the object node 312 are shown with question marks, indicating that these nodes are mission nodes for solving a mission problem. In the example shown in Figure 14, the fields 353, the person nodes 357 and 360, and the object node 362 are shown with a question icon 503, indicating that these nodes are mission nodes for solving a mission problem. In this way, the third control unit 143A can display information on the field node 353, which is a mission node, indicating that it is a node for solving a problem based on its relationship with surrounding field nodes or other nodes, or for going to the location on the map where the field node 353 is located to solve the problem. The third control unit 143A can also display information on other mission nodes indicating that they are nodes for solving a problem based on their relationship with surrounding field nodes or other nodes, or for going to the location on the map where surrounding field nodes are located to solve the problem.
[0099] Furthermore, if the correct answer is obtained to the mission problem presented in the mission node, the third control unit 143A displays it as a normal node that is not a mission node.
[0100] Furthermore, the third control unit 143A controls the system so that each time the user 20 solves a mission problem presented in the mission node, one character that makes up the keyword is obtained. In the example shown in Figures 13 and 14, the keyword unit 602 is shown with two characters of a four-character keyword already entered.
[0101] Figures 13 and 14 show a graph display on / off button 605 that allows you to toggle the display of graphs other than field nodes (other nodes and edges connecting to other nodes) in the knowledge graph displayed on the interface screen. You can also toggle the display of graphs other than field nodes by changing their saturation or transparency. In addition, window 603 displays the mission questions presented in the mission node, as well as responses to the mission questions entered by the user (answers and explanations to the mystery).
[0102] (Information processing device 1A, generation unit 15A) The generation unit 15A can generate mission problems to solve mission nodes and generate answers to the generated mission problems.
[0103] [6. Operation of Information Processing Device 1A] Figure 15 is a schematic flow showing an example of the operation of the modified information processing device 1A. Figure 16 is a conceptual diagram showing an example of an area diagram 211. Figure 17 is a conceptual diagram showing an example of field nodes and edges placed on the area diagram 211 and the determined course. Figure 18 is a conceptual diagram showing an example of a knowledge graph superimposed on the area diagram 211. Figure 19 is a conceptual diagram showing an example of a field node determined to be a mission node. Figure 20 is a conceptual diagram showing an example of another node determined to be a mission node. Figure 21 is a diagram showing an example of a mission problem presented at a mission node. Figure 22 is a diagram showing an example of an answer to the mission problem shown in Figure 21. Figure 23 is a diagram showing an example of an overview and episode shown at a node that is not a mission node.
[0104] In Figures 16 to 20, elements similar to those in Figure 4 are denoted by the same reference numerals, and detailed explanations are omitted. Also, Figures 16 to 19 show examples of when the information processing device 1A displays information on the display unit 21 of the user terminal 2 for illustrative purposes, but Figures 17 to 19 do not actually need to be displayed on the display unit 21 of the user terminal 2.
[0105] The operation of the information processing device 1A will be explained below using Figures 15 to 23. Figure 13 shows a flowchart illustrating one embodiment of the processing of the information processing device program 1713 used in the information processing device 1A. The symbol "S" shown in Figure 15 represents a step.
[0106] (S21) The CPU 170 of the information processing device 1A identifies an area diagram to be displayed on the display unit 21 of the user terminal 2. Specifically, the information processing device 1A detects one or more areas in the knowledge graph (human-object-word graph) stored in the memory unit 13 that are complexly connected to nearby location nodes and other nodes (person nodes, object nodes, event nodes). From the one or more detected areas, the information processing device 1A identifies an area corresponding to an area diagram 211, such as the one shown in Figure 16, to be displayed on the display unit 21 of the user terminal 2.
[0107] (S22) The CPU 170 of the information processing device 1A extracts location nodes corresponding to multiple historical site spots on the area map. Specifically, the information processing device 1A extracts location nodes from the area included in the region corresponding to the area map 211 that meet the conditions on the area map and connects adjacent location nodes with edges. The conditions here are, for example, that user 20 can travel on foot, by bus, or by electric train.
[0108] (S23) The CPU 170 of the information processing device 1A determines a course that visits multiple historical sites, which are shown as location nodes extracted and placed in S22.
[0109] Specifically, the information processing device 1A determines a course that goes around the field nodes 351-355 shown in Figure 17 as the course for the historical mystery quest. At that time, the information processing device 1A determines the start point and the goal point of the historical mystery quest course. In the example shown in Figure 17, field node 351 is the start point and the start icon 501 is displayed, and field node 355 is the goal point and the goal icon 502 is displayed. The information processing device 1A also places other nodes that are related to the field nodes extracted in step S11 in positions that do not overlap with the field nodes and connects the other nodes with edges to create a knowledge graph, for example, as shown in Figure 18. In the example shown in Figure 18, the knowledge graph used for the historical mystery quest is shown, consisting of field nodes 351-355, person nodes 356-360, object nodes 361 and 362, event node 363, and edges 451-467.
[0110] (S24) The CPU 170 of the information processing device 1A determines the logical or physical sequence of events of a historical or legendary episode as a mystery (historical mystery) related to multiple historical sites. Specifically, the information processing device 1A can determine the logical sequence of events that shows the "why" (WHY element) or the physical sequence of events that shows the "how" (HOW element) of a historical or legendary episode as a mystery (historical mystery) for a historical mystery quest.
[0111] (S25) The CPU 170 of the information processing device 1A determines that at least one field node will be a mission node for solving a puzzle. For example, the information processing device 1A determines that field node 353 is the mission node from among field nodes 351 to 355 shown in Figure 19. At that time, the information processing device 1A displays a question icon 503 indicating that field node 353 is a mission node, along with field node 353, for example as shown in Figure 19.
[0112] (S26) The CPU 170 of the information processing device 1A determines that at least one other node will be a mission node to solve a puzzle. For example, the information processing device 1A determines that of the person nodes 357, 360 and the object node 362 from the person nodes 356-360, the object nodes 361, 362 and the event node 363 shown in Figure 20, the person nodes 357, 360 and the object node 362 will be mission nodes. At that time, the information processing device 1A displays a question icon 503 indicating that the person nodes 357, 360 and the object node 362 are mission nodes, along with the person nodes 357, 360 and the object node 362, for example as shown in Figure 20.
[0113] (S27) The CPU 170 of the information processing device 1A generates mission problems and answers for the mission nodes to solve. For example, the information processing device 1A generates mission problems and answers for the mission nodes shown in Figure 20: the field node 353, the person nodes 357 and 360, and the object node 362.
[0114] (Mission problem) The information processing device 1A can create a mission question for a person node 357, which is a mission node, as shown in Figure 21. Figure 21 shows the mission as "Who am I?", and the question as "There is a sign to the right of the South Gate in 'Location 2'. The culprit who committed the incident in 'Incident 1' can be found there. The answer is xxx. What are the four kanji characters that fit in the xxx?", and "If you know the answer, enter it in the input field below." "Location 2" is the name of the spot corresponding to location node 353, and "Incident 1" is the name of the event corresponding to incident node 363, which is connected to person node 357 by edge 467. The mission question shown in Figure 21 may be displayed, for example, in a card-type window 607 when the user 20 selects the icon for person node 357 displayed on the display unit 21. This window 607 can be closed by selecting the close button 608.
[0115] (answer) Furthermore, the information processing device 1A can generate answers to the mission questions shown in Figure 21, for example, as shown in Figure 22. In Figure 22, the answer is shown with the title "Person 3" (with furigana), the summary description "Person 3 was a daimyo who was active in the mid-Edo period," and the episode description "In 1725, Person 3 was driven into a corner by the incident in "Event 1" and committed suicide at "Place 1." Person 3 is the name of the person corresponding to Person Node 357, and Place 1 is the name of the spot corresponding to Place Node 351. The answer shown in Figure 22 may be displayed, for example, in a card-type window 609 when the user 20 answers the mission question shown in Figure 21 displayed on the display unit 21 and answers correctly. This window 609 can be closed by specifying the close button 608.
[0116] (S28) The CPU 170 of the information processing device 1A extracts an overview description and episode of the historical site corresponding to each location node and associates it with each location node. Specifically, the information processing device 1A extracts an overview description and episode of the historical site corresponding to location nodes 351, 352, 354, and 355 that are not mission nodes as shown in Figure 20, and associates it with location nodes 351, 352, 354, and 355.
[0117] (Overview and episodes of non-mission nodes) The information processing device 1A can create, for example, an overview and episode for a non-mission node, field node 352, as shown in Figure 23. Figure 23 shows the title as "Field 2" (with furigana), the overview as "A temple from the Sengoku period whose South Gate is a national treasure," and the episode as "A temple built in 1725 by 'Person 1'" and "In 1850, 'Person ?' committed the 'Incident 1' and committed suicide here." "Field 2" is the name of the spot corresponding to field node 352. "Person ?" is the name of the person corresponding to the mission node, person node 357, but the name is withheld because the mission problem has not yet been solved. The overview and episode shown in Figure 23 may be displayed, for example, in a card-type window 610 when the user 20 specifies the icon for field node 352 displayed on the display unit 21. This window 610 can be closed by specifying the close button 608.
[0118] (S29) The CPU 170 of the information processing device 1A extracts the outline description and episodes of historical sites corresponding to each other node and associates them with each location node. Specifically, the information processing device 1A extracts the outline description and episodes of people, objects, and events corresponding to location nodes 351, 352, 354, and 355 that are not mission nodes as shown in Figure 20, as well as person nodes 356, 358, and 359, object node 361, and event node 363, and associates them with each other.
[0119] [7. Others] The above embodiments and modifications can be used in appropriate combinations. For example, the acquisition unit 11 and generation unit 15A of the information processing device 1 may perform processing using AI provided inside or outside the information processing device 1. Furthermore, the knowledge graph DB 1715 may be provided in the storage unit 13. The storage unit 13 of the information processing device 1 may be provided in a server or the like that is connected via communication.
[0120] Furthermore, in the above embodiment, the information processing device 1 was described using the example of displaying and using a two-dimensional knowledge graph, but it may also generate and use a three-dimensional knowledge graph. Also, although the information processing device 1 was described as superimposing the knowledge graph onto a two-dimensional area diagram, it may also superimpose it onto a three-dimensional area diagram (three-dimensional map) or a metaverse space. [8. Summary]
[0121] (1, 8, 9) The information processing device 1 is an information processing device that controls the display of a knowledge graph composed of a plurality of nodes and edges indicating the relationships between each of the plurality of nodes. The plurality of nodes consist of a plurality of field nodes, which are nodes relating to points that include location information, and a plurality of other nodes, which are of a different type from the plurality of field nodes and are related to at least one of the plurality of field nodes. The information processing device 1 is characterized by comprising: a first control unit 141 that controls the display of the knowledge graph in which two or more field nodes are placed at spaced-apart positions on an area diagram represented in two or three dimensions indicated by location information, and at least two of the placed two or more field nodes that are close to each other are connected by edges; and a second control unit 142 that controls the display of the knowledge graph in which other nodes related to the two or more placed field nodes are placed at positions that do not overlap with the two or more field nodes, and the two or more field nodes and the other nodes are connected by edges.
[0122] The information processing device 1 visually represents a knowledge graph that shows the relationships between a field node, which is located in real space or virtual space, and other related nodes of different types.
[0123] More specifically, the information processing device 1 first places a field node corresponding to a location on the area diagram, and then places other nodes and edges near the field node so as not to overlap with the field node. This allows the user viewing the knowledge graph to see a knowledge graph centered on the field node, making it easy to see each node and edge of the knowledge graph, as well as the relationships between each node. Furthermore, a portion of the knowledge graph (a partial graph) is formed according to the displayed area, enabling visualization tailored to the area.
[0124] (2) In such an information processing device 1, the other nodes include person nodes which are nodes relating to people, object nodes which are nodes relating to things other than people, and event nodes which are nodes relating to events, and the second control unit 142 can display a knowledge graph in which at least one of the person nodes, object nodes, and event nodes is connected to the field node by an edge.
[0125] In this way, the information processing device 1 limits the knowledge graph to four types of nodes: person nodes, object nodes, event nodes, and field nodes. It fixes the field nodes on an area and visualizes the other three types of nodes (person nodes, object nodes, and event nodes). As a result, the user viewing the knowledge graph can see a knowledge graph centered on the field nodes, making it easy to see each node and edge of the knowledge graph, as well as the relationships between each node.
[0126] Furthermore, the information displayed in the knowledge graph is categorized into four types of nodes, allowing users to predict the type of content each node represents. This makes it easier for users to read through the nodes (episodes) and understand the information in the knowledge graph (episodes). Additionally, because users can read through the information (episodes) organized as a knowledge graph, it can lead to the discovery of new knowledge. Moreover, the categorization of the knowledge graph information into four types of nodes allows for a game-like element where users can select any node they are interested in from among people, objects, events, or locations. Therefore, users can enjoy reading through episodes that constitute new knowledge, making knowledge acquisition more enjoyable.
[0127] (3) Furthermore, a location node may represent a place related to history or legend, a person node may represent a person related to history or legend, an object node may represent an object other than a person related to history or legend, and an event node may represent an event related to history or legend.
[0128] In this way, the information processing device 1 displays the knowledge graph superimposed on the area diagram, showing the connections between person nodes, object nodes, event nodes, and place nodes, so that users viewing the knowledge graph can visually understand the connections (episodes) that occurred at the historical site.
[0129] Furthermore, for example, stories about history or legends are a collection of anecdotes containing the 5W1H elements related to numerous events that occurred in the past, and can be considered knowledge that is enjoyed and understood by many people. However, history taught in school is sometimes ridiculed as merely a "subject to be memorized," and for some people, it appears only as a massive mass of information without the appeal of history as a story, leading to what is known as "historical aversion."
[0130] The information processing device 1 can classify episodes such as history represented in a knowledge graph into person nodes, object nodes, event nodes, and place nodes, as described above, and display them centered on the place nodes in an organized manner, showing what kind of content each episode contains. This makes it easier for users viewing the knowledge graph to read through episodes such as history, and can help them appreciate the fascination of history.
[0131] (4) In addition, at least two adjacent field nodes can be related within a historical or legendary episode.
[0132] This allows users viewing the knowledge graph to read through episodes related to multiple nodes, potentially leading to the discovery of new knowledge and making knowledge acquisition enjoyable.
[0133] (5) Furthermore, knowledge graphs are associated with historical or legendary episodes, and knowledge graphs associated with episodes different from the historical or legendary episodes can be connected to each other by edges via at least one other node. This allows users viewing a knowledge graph to also read about other knowledge graphs connected to it, potentially leading to the discovery of new knowledge and making knowledge acquisition more enjoyable.
[0134] (6) The system may also include a third control unit 143A that displays information, along with a knowledge graph, indicating that the game involves exploring the locations of multiple field nodes on a map in order to solve a mystery that is presented as a logical or physical sequence of events in history or legend.
[0135] This allows players to progress through the puzzles by reading episodes related to the locations, gaining knowledge not only about the locations themselves but also about the people, events, and objects associated with them. Furthermore, because these map-based games are generated using knowledge graphs, they enable visual and intuitive understanding and progression.
[0136] (7) The third control unit 143A may display information on at least one of the multiple field nodes indicating that it is a node for solving the problem based on the relationship between at least one field node and other nodes, or for going to a location on the map where at least one field node is located to solve the problem, and may display information on at least one of the multiple other nodes indicating that it is a node for solving the problem based on the relationship between at least one other node and other nodes, or for going to a location on the map where at least one other node and field nodes are located to solve the problem.
[0137] This allows for a game-like experience where users navigate locations on a map while solving problems. This makes learning new knowledge more enjoyable than simply reading through new episodes associated with nodes in a knowledge graph, thus enabling fun knowledge acquisition. Furthermore, this type of map-based game offers the potential for educational benefits by making knowledge acquisition fun. [Explanation of symbols]
[0138] 1. Information Processing Device 2 User terminals 3. Communication Network 11 Acquisition Department 12 Reception Department 13 Storage section 14 Control Unit 15A generation section 20 Users of user terminals 21 Display section 22 Terminal acquisition section 23 Instruction transmission unit 141 First Control Unit 142 Second Control Unit 143 Third Control Unit 170 CPU 171 memory 172 Storage Devices 173 connection ports 174 Communication Circuit 175 Bus Line 211 Area Map 301, 302, 303, 304, 305, 351, 352, 353, 354, 355 Field Nodes 306, 307, 308, 309, 310, 356, 357, 358, 359, 360 people nodes 311, 312, 361, 362 Object Nodes 313, 363 Event Nodes 401, 402, 403, 404, 405, 407, 408, 409, 410, 411, 412, 413, 414, 415, 417, 418, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 467 Edge 601 Information 602 Keyword Section Windows 603, 607, 609, 610 605 Graph display on / off button 608 Close button 1711 OS 1712 Browser Program 1713 Information Processing Device Program 1715 Knowledge Graph Database 1717 User Terminal Program
Claims
1. An information processing device that controls the display of a knowledge graph composed of multiple nodes and edges indicating the relationships between each of the multiple nodes, The plurality of nodes consist of a plurality of field nodes, which are nodes relating to points that include location information, and a plurality of other nodes, which are of a different type from the plurality of field nodes and are related to at least one of the plurality of field nodes. A first control unit performs control to place two or more field nodes at spaced-apart positions on an area diagram represented in two or three dimensions as indicated by the position information, and to display at least two adjacent field nodes among the placed two or more field nodes in a manner connected by the edge, An information processing device comprising: a second control unit that controls the display of the knowledge graph in a manner in which other nodes related to the two or more field nodes are placed in positions that do not overlap with the two or more field nodes, and the two or more field nodes and the other nodes are connected by the edges.
2. The aforementioned other nodes include a person node, which is a node relating to a person; an object node, which is a node relating to an object other than a person; and an event node, which is a node relating to an event. The information processing apparatus according to claim 1, wherein the second control unit displays the knowledge graph in a manner in which at least one of the person node, the object node, and the event node is connected to the field node by the edge.
3. The aforementioned field node is a node that represents a location related to history or legend, The aforementioned person node is a node representing a person related to the aforementioned history or legend, The aforementioned object node is a node that represents an object other than a person related to the aforementioned history or legend, The information processing apparatus according to claim 2, wherein the article node is a node representing an event related to the history or the legend.
4. The information processing apparatus according to claim 3, wherein the at least two adjacent field nodes are related within the historical or legendary episode.
5. The aforementioned knowledge graph relates to the aforementioned historical or legendary episode, The information processing apparatus according to claim 4, wherein the knowledge graph and another knowledge graph relating to an episode different from the aforementioned historical or legendary episode are connected by an edge via at least one of the other nodes.
6. The information processing apparatus according to claim 4, further comprising a third control unit that displays, together with the knowledge graph, information indicating that the logical or physical sequence of events in the aforementioned history or legend is a mystery, and that in order to solve the mystery, the user is to play a game involving visiting the locations on a map where the plurality of field nodes are arranged.
7. The third control unit displays information on at least one of the plurality of field nodes indicating that it is a node for solving a problem based on the relationship between the at least one field node and other field nodes, or for going to the location on the map where the at least one field node is located to solve a problem. The information processing device according to claim 6, wherein at least one of a plurality of other nodes displays information indicating that it is a node for solving a problem based on the relationship between the field nodes or other nodes surrounding the at least one other node, or a node for solving a problem on a map in which the field nodes surrounding the at least one other node are arranged.
8. In an information processing device that controls the display of a knowledge graph composed of multiple nodes and edges indicating the relationships between each of the multiple nodes, The plurality of nodes consist of a plurality of field nodes, which are nodes relating to points that include location information, and a plurality of other nodes, which are of a different type from the plurality of field nodes and are related to at least one of the plurality of field nodes. A first control step involves placing two or more field nodes at spaced-apart locations on a two-dimensional or three-dimensional area diagram indicated by the positional information, and displaying at least two of the placed field nodes that are adjacent to each other connected by the edges. A program that causes a computer to perform a second control step of displaying the knowledge graph in a manner in which other nodes related to the two or more field nodes that have been placed are placed in positions that do not overlap with the two or more field nodes, and the two or more field nodes and the other nodes are connected by the edges.
9. A method for displaying a knowledge graph composed of multiple nodes and edges indicating the relationships between each of the multiple nodes, The plurality of nodes consist of a plurality of field nodes, which are nodes relating to points that include location information, and a plurality of other nodes, which are of a different type from the plurality of field nodes and are related to at least one of the plurality of field nodes. A first control step involves placing two or more field nodes at spaced-apart locations on a two-dimensional or three-dimensional area diagram indicated by the positional information, and displaying at least two of the placed field nodes that are adjacent to each other connected by the edges. A method for displaying a knowledge graph, comprising: a second control step of controlling the display of the knowledge graph in which other nodes related to the two or more field nodes are placed in positions that do not overlap with the two or more field nodes, and the two or more field nodes and the other nodes are connected by the edges.
Citation Information
Patent Citations
Intelligent guideboard guiding system based on semantic comprehension and knowledge graph
CN108846074A
Prediction range display method for digital map
JP1997102026A
Method and apparatus for providing application engine based on real-time commute activity
JP2017131636A
Map Data Validation Using Knowledge Graphs and Randomness Measures
US20210055112A1
Computing systems and methods for managing and monitoring mesh-based communication systems
US20230344906A1