JP2018147042A - Inference result visualization device, inference result visualization method and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide an inference result visualization device, an inference result visualization method and a program capable of visualizing the base, in addition to the conclusion drawn by inference of a computer.SOLUTION: An inference result visualization device 10 comprises: a partial graph extraction unit 11 for extracting a partial graph including the conclusion of inference, when inference using a database which holds a logical expression including a predetermined unit of information as an element as data, and an inputted query, is performed; an element decomposition unit 12 which decomposes the logical expression contained in the extracted partial graph into respective elements; a partial graph reconstruction unit 13 which reconstructs a new partial graph by using the elements obtained by the decomposition; and a display unit 14 which displays the reconstructed new partial graph on a screen for each element which constitutes the graph.SELECTED DRAWING: Figure 1

Description

  The present invention relates to an inference result visualization apparatus and an inference result visualization method for visualizing inference conclusions derived by a computer, and further to a program for realizing them.

  Conventionally, logical reasoning (hereinafter also referred to as “logical reasoning”) is performed by a computer using knowledge such as rules created in advance, information registered in a dictionary, observed facts, and input queries. )) Is being developed. In recent years, with the improvement of computer capabilities, even when the amount of knowledge has become extremely large, it has become possible to perform inferences at high speed. As a result, various judgments or insights can be used instead of people. It has become possible to do.

  By the way, the knowledge used in the logical reasoning is expressed by, for example, a predicate logical expression so that it can be used in a computer. The predicate logical expression is composed of a predicate symbol (predicate name) and a term (variable). Specifically, the predicate logical expression parent (x, y) is composed of a predicate symbol parent and two terms x and y. This predicate logical expression parent (x, y) can be defined as a predicate logical expression indicating that x is a parent of y.

  As described above, the knowledge (predicate logical expression) used in the logical reasoning is expressed extremely symbolically because it is used in the computer. The conclusion derived from the knowledge by the computer and the basis thereof are also expressed symbolically like the knowledge. Therefore, it is difficult for a general person to visually recognize and understand them.

  Incidentally, Patent Document 1 discloses a method for visualizing the result obtained by the predicate logical expression. Specifically, in the method disclosed in Patent Document 1, first, a mathematical formula group composed of a plurality of mathematical formulas is generated based on information relating to a manufacturing process of a product, and further, a predicate logical formula is generated from the mathematical formula group. Is done. Thereafter, the generated predicate logical expression is subjected to processing such as removal of a quantifier, and further, a relational expression between the production delivery date and the total energy cost or total consumed energy cost consumed during production is obtained and obtained. The relationship is visualized. As described above, according to the method disclosed in Patent Document 1, the result derived from the predicate logical expression is graphed, so that it is considered easy to understand inference by human visual recognition.

JP 2014-160359 A

  However, in the method disclosed in Patent Document 1, only the relationship between the delivery date and the cost is obtained using the predicate logical expression obtained from the mathematical formula, and the inference using the input data and the predicate logical expression is performed. It is not done. In the method disclosed in Patent Document 1, the basis for indicating what input data is applied to which part of the predicate logical expression and the conclusion is derived is not visualized. That is, even by the method disclosed in Patent Document 1, it is difficult for a person to visually recognize and understand the above conclusion and the basis thereof.

  An example of an object of the present invention is to provide an inference result visualization device, an inference result visualization method, and a program capable of solving the above-described problem and visualizing the basis in addition to the conclusion derived by inference by a computer. is there.

In order to achieve the above object, an inference result visualization apparatus according to one aspect of the present invention provides:
A subgraph extraction unit that extracts a subgraph including a conclusion of the inference when an inference is performed using a database that stores a logical expression including information of a predetermined unit as an element and an input query When,
An element decomposition unit that decomposes a logical expression included in the extracted subgraph into the elements;
A subgraph reconstruction unit that reconstructs a new subgraph using the elements obtained by the decomposition;
A display unit for displaying the reconstructed new partial graph on a screen for each element constituting the new partial graph;
It is characterized by having.

In order to achieve the above object, the inference result visualization method according to one aspect of the present invention includes:
(A) a step of extracting a subgraph including a conclusion of the inference when an inference is performed using a database that holds a logical expression including information of a predetermined unit as an element and an input query When,
(B) decomposing a logical expression included in the extracted subgraph into the elements;
(C) reconstructing a new subgraph using the elements obtained by decomposition, and (d) reconstructing the reconstructed new subgraph on the screen for each element constituting it. Show, steps,
It is characterized by having.

Furthermore, in order to achieve the above object, a program according to one aspect of the present invention is provided.
By computer
(A) a step of extracting a subgraph including a conclusion of the inference when an inference is performed using a database that holds a logical expression including information of a predetermined unit as an element and an input query When,
(B) decomposing a logical expression included in the extracted subgraph into the elements;
(C) reconstructing a new subgraph using the elements obtained by decomposition, and (d) reconstructing the reconstructed new subgraph on the screen for each element constituting it. Show, steps,
Is executed.

  As described above, according to the present invention, in addition to the conclusion derived by inference by a computer, the basis thereof can be visualized.

FIG. 1 is a block diagram showing the configuration of the inference result visualization apparatus according to the embodiment of the present invention. FIG. 2 is a block diagram showing more specifically the inference result visualization apparatus according to the embodiment of the present invention. FIG. 3 is a diagram illustrating an example of logical expressions held in the database according to the embodiment of the present invention. FIGS. 4A and 4B are diagrams showing an example of a notation table held in the database together with the logical expression shown in FIG. 3, and different examples are shown. FIG. 5 is a diagram showing an example of an email searched by the inference execution unit in the embodiment of the present invention. FIG. 6 is a diagram showing an example of the inference conclusion generated by the inference execution unit and the inference rule application process until the conclusion is derived in the embodiment of the present invention. FIG. 7 is a diagram showing an example of the result of element decomposition obtained in the embodiment of the present invention. FIG. 8 is a diagram showing a series of main stages of the subgraph reconstruction processing performed in the embodiment of the present invention. FIG. 9 is a diagram showing a series of main stages of the subgraph reconstruction process performed in the embodiment of the present invention. FIG. 10 is a diagram showing a series of main stages of the subgraph reconstruction process performed in the embodiment of the present invention. FIG. 11 is a diagram showing an example of a new subgraph displayed in the embodiment of the present invention. FIG. 12 is a diagram showing another example of a new subgraph displayed in the embodiment of the present invention. FIG. 13 is a flowchart showing the operation of the inference result visualization apparatus 10 according to the embodiment of the present invention. FIG. 14 is a block diagram illustrating an example of a computer that implements the inference result visualization apparatus according to the embodiment of the present invention.

(Embodiment)
Hereinafter, an inference result visualization apparatus, an inference result visualization method, and a program according to an embodiment of the present invention will be described with reference to FIGS.

[Device configuration]
First, the configuration of the inference result visualization apparatus according to the present embodiment will be described. FIG. 1 is a block diagram showing the configuration of the inference result visualization apparatus according to the embodiment of the present invention.

  The inference result visualization apparatus 10 in the present embodiment shown in FIG. 1 is an apparatus for displaying the conclusion of the inference on the screen when inference is performed. As illustrated in FIG. 1, the inference result visualization apparatus 10 includes a partial graph extraction unit 11, an element decomposition unit 12, a partial graph reconstruction unit 13, and a display unit 14. Further, a display device 30 such as a liquid crystal display device is connected to the inference result visualization device 10.

  The subgraph extraction unit 11 extracts a subgraph including a conclusion of inference when inference is performed using the database and the input query. The database holds, as data, a logical expression including information of a predetermined unit as an element (see FIG. 2 described later).

  The element decomposition unit 12 decomposes the logical expression included in the partial graph extracted by the partial graph extraction unit 11 into each element. The subgraph reconstruction unit 13 reconstructs a new subgraph using the elements obtained by the decomposition. The display unit 13 displays the reconstructed new partial graph on the screen of the display device 30 for each element constituting it.

  Thus, in the present embodiment, a new partial graph is created and displayed using the elements obtained from the partial graph. In addition, the subgraph includes not only the inference conclusion but also the process leading to the conclusion. Therefore, according to the present embodiment, in addition to the conclusion derived by the inference by the computer, it is possible to visualize the basis.

  Next, the configuration of the inference result visualization apparatus according to the present embodiment will be described more specifically with reference to FIGS. FIG. 2 is a block diagram showing more specifically the inference result visualization apparatus according to the embodiment of the present invention.

  As shown in FIG. 2, in the present embodiment, the inference result visualization apparatus 10 constitutes a part of the inference apparatus 20 that executes inference. The inference device 20 is constructed by introducing a program for inference to a computer. Similarly, the inference result visualization device 10 also introduces a program according to the present embodiment to be described later to this computer. Is built by that.

  In addition to the inference result visualization device 10, the inference device 20 includes an inference execution unit 21, a database 22, and a query input reception unit 23. As described above, the database 22 holds a logical expression including information of a predetermined unit as an element as data.

  FIG. 3 is a diagram illustrating an example of logical expressions held in the database according to the embodiment of the present invention. FIGS. 4A and 4B are diagrams showing an example of a notation table held in the database together with the logical expression shown in FIG. 3, and different examples are shown. The logical expression shown in FIG. 3 is also expressed as an inference rule. In the example of FIG. 3, an inference rule for inferring whether or not x1 and x2 are negotiated is included.

  In FIG. 3, a symbol with a cross in a circle represents an AND condition. Specifically, this symbol indicates that the logical expression connected to the right side (contact (e1, t1, p1), etc.) x1, x2), etc.).

  The query input receiving unit 23 receives a query input from the outside. The query input receiving unit 23 receives, for example, text data such as “has rigging occurred” as a query.

  The inference execution unit 21 applies the query received by the query input reception unit 23 to the inference rules held in the database 22 and executes inference. Specifically, the inference execution unit 21 first extracts inference rules to be applied to the accepted query. For example, in the example of FIG. 4A, a portion surrounded by a broken line is extracted.

  Subsequently, the inference execution unit 21 searches, for example, a mail element that matches the extracted inference rule from a large amount of mail stored in the mail server. FIG. 5 is a diagram showing an example of an email searched by the inference execution unit in the embodiment of the present invention.

  Then, the inference execution unit 21 generates an inference conclusion when a suitable mail element can be searched. The inference execution unit 21 inputs the obtained inference conclusion and the application process of the inference rule until the conclusion is derived to the subgraph extraction unit 11. FIG. 6 is a diagram showing an example of the inference conclusion generated by the inference execution unit and the inference rule application process until the conclusion is derived in the embodiment of the present invention. The conclusion shown in FIG. 6 and the application process of the inference rule are represented by subgraphs.

  In this embodiment, the subgraph extraction unit 11 extracts the subgraph generated by the inference execution unit 21 shown in FIG. The partial graph shown in FIG. 6 shows a partial graph extracted when the above-described query “has collusion occurred” is applied to the inference rule shown in FIG.

  In the present embodiment, the element decomposition unit 12 performs element decomposition on the subgraph extracted by the subgraph extraction unit 11 as shown in FIG. The elements contained in the enclosed rule) are extracted. FIG. 7 is a diagram showing an example of the result of element decomposition obtained in the embodiment of the present invention. Further, in the example of FIG. 7, the extracted predicate and the related term are linked.

  In the present embodiment, the subgraph reconstruction unit 13 first includes elements included in the inference conclusion from among the logical expressions included in the extracted subgraph, that is, among the elements obtained by the decomposition. Identify the same elements as Then, the subgraph restructuring unit 13 reconstructs a new subgraph by associating the elements on the subgraph related to the identified element with the elements included in the inference conclusion.

  Here, the reconstruction process by the subgraph reconstruction unit 13 will be specifically described with reference to FIGS. FIG. 8 to FIG. 10 are diagrams showing a series of main stages of the subgraph reconstruction process performed in the embodiment of the present invention. In the examples of FIGS. 8 to 10, the partial graph that is the basis of the reconstruction is the partial graph shown in FIG. 6.

  As shown in FIG. 8, the subgraph reconstruction unit 13 first converts each element extracted by the element decomposition unit 12 into a natural language expression using a notation table as shown in FIG. Subsequently, as illustrated in FIG. 9, the subgraph constructing unit 13 selects “event” as an element included in the inference conclusion (the top-level logical expression “collusion”) from the logical expressions illustrated in FIG. 8. (Id1) ”and“ individual (Tanaka) ”are specified.

  Then, as shown in FIG. 9, the subgraph reconstruction unit 13 determines that “event (id1)” and “individual (Tanaka)” identified in the logical expressions other than the uppermost logical expression indicating the conclusion of the inference Identify the same elements and identify the elements on the subgraph that are related to them (linked to them). Specifically, the subgraph reconstruction unit 13 identifies “contact”, “competitive relationship”, and “price adjustment”.

  Then, the subgraph reconstruction unit 13, as shown in FIG. 10, uses the identified elements “event (id1)” included in any one of the representative logical expressions indicating the conclusion of inference and Connect to "Individual (Tanaka)". In addition, if there are elements included in two or more logical expressions, which are included in elements other than the inference conclusion, the subgraph reconstruction unit 13 also identifies these elements and links them together. In the example of FIG. 10, “individual (Suzuki)” existing in the logical expression “contact” and “individual (Suzuki)” existing in the logical expression “competitive relationship” are linked. The subgraph is reconstructed by the above processing.

  Then, the subgraph reconstruction unit 13 passes the reconstructed partial graph shown in FIG. 10 to the display unit 13. In this embodiment, when the display unit 13 receives the partial graph reconstructed by the subgraph reconstruction unit 13 (see FIG. 8), the display unit 13 uses this to display the screen of the display device 30 as shown in FIG. Display a subgraph on top.

  FIG. 11 is a diagram showing an example of a new subgraph displayed in the embodiment of the present invention. The example of FIG. 11 corresponds to the partial graph shown in FIG. In the present embodiment, since the element is converted into the natural language expression by the subgraph reconstruction unit 13, the display unit 13 displays the reconstructed new subgraph using the natural language expression. To do.

  FIG. 12 is a diagram showing another example of a new subgraph displayed in the embodiment of the present invention. In the example of FIG. 12, indirect information for deriving the consequence is also displayed as part of the subgraph. Also, in this case, unlike the example shown in FIG. 7, the element decomposition unit 12 performs elements decomposition and then includes elements other than the direct rules (rules surrounded by broken lines in FIG. 6) that lead to the consequences. Will be extracted.

[Device operation]
Next, operation | movement of the inference result visualization apparatus 10 in embodiment of this invention is demonstrated using FIG. FIG. 13 is a flowchart showing the operation of the inference result visualization apparatus 10 according to the embodiment of the present invention. In the following description, FIGS. In the present embodiment, the inference result visualization method is implemented by operating the inference result visualization device 10. Therefore, the description of the inference result visualization method in the present embodiment is replaced with the following description of the operation of the inference result visualization device 10.

  First, as a premise, in the inference device 20 shown in FIG. 2, the query input receiving unit 23 receives an input of a query, and the inference executing unit 21 uses the inference rules held in the database 22 based on the query. Suppose you are performing inference.

  As shown in FIG. 13, first, when the inference execution unit 21 performs an inference using the inference rules held in the database 22 and the input query, the subgraph extraction unit 11 determines the conclusion of the inference. A subgraph (see FIG. 6) is extracted (step A1).

  Next, the element decomposition unit 12 performs element decomposition on the subgraph extracted in step A1, and extracts elements included in the direct rule (rule surrounded by a broken line in FIG. 6) that leads to the consequence. (Step A2). Thereafter, the element decomposition unit 12 passes the obtained elements to the subgraph reconstruction unit 13.

  Next, the subgraph reconstruction unit 13 first expresses each element extracted by the element decomposition unit 12 using natural language expression (see FIG. 5) (step A3). Next, the subgraph construction unit 13 identifies the element included in the inference conclusion (the uppermost logical expression) from the logical expressions in which the elements are converted into the natural language expression (step A4).

  Next, the subgraph reconstruction unit 13 specifies the same element as the specified element in the logical expression other than the uppermost logical expression indicating the conclusion of the inference, and further, on the subgraph related to these elements. Are identified (step A5).

  Next, the subgraph restructuring unit 13 connects these elements specified in step A5 to the elements of the uppermost logical expression specified in step A4, and reconstructs a new subgraph (step A6).

  Thereafter, when receiving the partial graph reconstructed in step A6 from the subgraph restructuring unit 13, the display unit 13 displays it on the screen of the display device 30 (see FIGS. 11 and 12) (step A7). ).

  As described above, when steps A1 to A7 are executed, the contents of the inference are displayed on the screen in a natural language including not only the conclusion of the inference but also the process leading to the conclusion. According to the present embodiment, in addition to the conclusion derived by the inference by the computer, the basis thereof is also visualized, so that it is easy to understand the inference by human visual recognition.

[program]
The program in the present embodiment may be a program that causes a computer to execute steps A1 to A7 shown in FIG. By installing and executing this program on a computer, the inference result visualization apparatus and the inference result visualization method in the present embodiment can be realized. In this case, a CPU (Central Processing Unit) of the computer functions as a partial graph extraction unit 11, an element decomposition unit 12, a partial graph reconstruction unit 13, and a display unit 14 to perform processing.

  The program in the present embodiment may be executed by a computer system constructed by a plurality of computers. In this case, for example, each computer may function as any of the partial graph extraction unit 11, the element decomposition unit 12, the partial graph reconstruction unit 13, and the display unit 14, respectively.

  Here, a computer that realizes the inference result visualization apparatus 10 by executing the program according to the present embodiment will be described with reference to FIG. FIG. 14 is a block diagram illustrating an example of a computer that implements the inference result visualization apparatus according to the embodiment of the present invention.

  As shown in FIG. 11, the computer 110 includes a CPU 111, a main memory 112, a storage device 113, an input interface 114, a display controller 115, a data reader / writer 116, and a communication interface 117. These units are connected to each other via a bus 121 so that data communication is possible.

  The CPU 111 performs various calculations by developing the program (code) in the present embodiment stored in the storage device 113 in the main memory 112 and executing them in a predetermined order. The main memory 112 is typically a volatile storage device such as a DRAM (Dynamic Random Access Memory). Further, the program in the present embodiment is provided in a state of being stored in a computer-readable recording medium 120. Note that the program in the present embodiment may be distributed on the Internet connected via the communication interface 117.

  Specific examples of the storage device 113 include a hard disk drive and a semiconductor storage device such as a flash memory. The input interface 114 mediates data transmission between the CPU 111 and an input device 118 such as a keyboard and a mouse. The display controller 115 is connected to the display device 119 and controls display on the display device 119.

  The data reader / writer 116 mediates data transmission between the CPU 111 and the recording medium 120, and reads a program from the recording medium 120 and writes a processing result in the computer 110 to the recording medium 120. The communication interface 117 mediates data transmission between the CPU 111 and another computer.

  Specific examples of the recording medium 120 include general-purpose semiconductor storage devices such as CF (Compact Flash (registered trademark)) and SD (Secure Digital), magnetic recording media such as a flexible disk, or CD- An optical recording medium such as ROM (Compact Disk Read Only Memory) can be used.

  The inference result visualization apparatus 10 according to the present embodiment can be realized not by using a computer in which a program is installed but also by using hardware corresponding to each unit. Furthermore, the inference result visualization device 10 may be partially realized by a program and the remaining part may be realized by hardware.

  As described above, according to the present invention, in addition to the conclusion derived by inference by a computer, the basis thereof can be visualized. The present invention is useful in various fields where automatic inference is performed.

DESCRIPTION OF SYMBOLS 10 Inference result visualization apparatus 11 Partial graph extraction part 12 Element decomposition | disassembly part 13 Subgraph reconstruction part 14 Display part 20 Inference apparatus 21 Inference execution part 22 Database 23 Query input reception part 30 Display apparatus 110 Computer 111 CPU
112 Main Memory 113 Storage Device 114 Input Interface 115 Display Controller 116 Data Reader / Writer 117 Communication Interface 118 Input Device 119 Display Device 120 Recording Medium 121 Bus

Claims (9)

A subgraph extraction unit that extracts a subgraph including a conclusion of the inference when an inference is performed using a database that stores a logical expression including information of a predetermined unit as an element and an input query When,
An element decomposition unit that decomposes a logical expression included in the extracted subgraph into the elements;
A subgraph reconstruction unit that reconstructs a new subgraph using the elements obtained by the decomposition;
A display unit for displaying the reconstructed new partial graph on a screen for each element constituting the new partial graph;
An inference result visualization device characterized by comprising: The display unit displays the reconstructed new subgraph using a natural language expression.
The inference result visualization device according to claim 1. The subgraph restructuring unit identifies the same element as the element included in the conclusion of the inference from the logical expressions included in the extracted subgraph, and the subgraph related to the specified element Reconstructing the new subgraph by linking the above elements to the elements contained in the inference conclusion;
The inference result visualization device according to claim 1 or 2. (A) a step of extracting a subgraph including a conclusion of the inference when an inference is performed using a database that holds a logical expression including information of a predetermined unit as an element and an input query When,
(B) decomposing a logical expression included in the extracted subgraph into the elements;
(C) reconstructing a new subgraph using the elements obtained by decomposition, and (d) reconstructing the reconstructed new subgraph on the screen for each element constituting it. Show, steps,
An inference result visualization method characterized by comprising: In the step (d), the reconstructed new subgraph is displayed using a natural language expression.
The inference result visualization method according to claim 4. In the step (c), an element identical to the element included in the conclusion of the inference is identified from the logical expressions included in the extracted subgraph, and the subgraph related to the identified element Reconstructing the new subgraph by linking another element above to an element contained in the inference conclusion;
The inference result visualization method according to claim 4 or 5. By computer
(A) a step of extracting a subgraph including a conclusion of the inference when an inference is performed using a database that holds a logical expression including information of a predetermined unit as an element and an input query When,
(B) decomposing a logical expression included in the extracted subgraph into the elements;
(C) reconstructing a new subgraph using the elements obtained by decomposition, and (d) reconstructing the reconstructed new subgraph on the screen for each element constituting it. Show, steps,
A program that executes In the step (d), the reconstructed new subgraph is displayed using a natural language expression.
The program according to claim 7. In the step (c), an element identical to the element included in the conclusion of the inference is identified from the logical expressions included in the extracted subgraph, and the subgraph related to the identified element Reconstructing the new subgraph by linking another element above to an element contained in the inference conclusion;
The program according to claim 7 or 8.

Images