Information processing device and information processing method

Abstract

To efficiently support information structuralization for defining requirements.SOLUTION: A requirement definition support device for data analysis has a processor to run a program and a storage device to store the program. The storage device stores multiple nodes each of which includes a character-string and an edge indicating a relation between two nodes among the multiple nodes. The storage device executes input processing to accept the input of an analysis target node, retrieval processing to retrieve a similar node including a character-string similar to a character-string of the analysis target node input by the input processing from the multiple nodes, acquisition processing to acquire a directional graph structure constituted of a node group including the similar node retrieved by the retrieval processing and an edge between two nodes in the node group, search processing to search the directional graph structures acquired by the acquisition processing for a path including the similar node, and output processing to output the directional graph structure in a displayable manner so that the path searched by the search processing is displayed in a different aspect.SELECTED DRAWING: Figure 1

Description

[Technical Field]

[0001] The present invention relates to a data analysis requirements definition support device and a data analysis requirements definition support method for supporting requirements definition for performing data analysis. [Background technology]

[0002] While advances in data analysis technology that supports digitalization are accelerating, in order to quickly create business value, it is important to utilize data analysis technology to make quick decisions based on data, and to use knowledge management that makes use of on-site know-how to do this effectively.

[0003] Since rework and delays in applying data analysis technology can result in lost business opportunities, it is necessary to properly define the issues and requirements. Therefore, in order to understand the customer's business and guide data analysis measures that lead to business issues, it is necessary to clarify the connection with business issues and understand the related data, such as related business processes and factors that serve as target values, controllable factors, and influencing factors.

[0004] To achieve this, it is necessary to organize the issues from the perspective of stakeholders, business issues, business processes, and related factors, define the relationships between each of them, and, by selecting the issues, present analytically relevant processes from the accumulated data and factors that should be used for data analysis.

[0005] Patent Document 1 below discloses a stakeholder extraction and management device that performs analysis using stakeholder information, information on customer goals that are issues, information on business processes and development process models, and information related to them. This stakeholder extraction and management device includes a stakeholder model generation unit that models stakeholders and manages organizational roles, a goal model generation unit that structures and manages customer goals, a business process model generation unit that associates and manages the customer's business process model, goals, and stakeholders, a development process model generation unit that associates and manages the system development process and stakeholders, a variety of stakeholder information storage units that store the stakeholder information structured by the stakeholder model generation unit, goal model generation unit, business process model generation unit, and development process model generation unit, a search unit that searches for related stakeholders from the variety of stakeholder information storage units using an input goal as a search condition, and an indirect stakeholder extraction processing unit that extracts stakeholders indirectly involved in the goal using the information stored in the variety of stakeholder information storage units.

[0006] Patent Document 2 below discloses a system that supports requirements definition for data analysis through user input operations. This system includes a means and processing step for inputting one of an analysis type, a customer perspective, and a presentation method based on user operations, a means and processing step for determining recommended requirement specifications and setting them as requirement specification candidates by referring to a conditional probability (type recommendation model) that holds between the customer perspective, the presentation method, customer requirements, and the display type, a means and processing step for determining similar requirement specifications to the requirement specification candidate by referring to the conditional probability, a means and processing step for visualizing and displaying the requirement specification candidates, a means and processing step for visualizing and displaying similar requirement specifications as a list, and a means and processing step for allowing the user to change the requirement specification candidate by selecting from the similar requirement specifications. [Prior art documents] [Patent documents]

[0007] [Patent Document 1] Japanese Patent Application Laid-Open No. 2010-256949 [Patent Document 2] Japanese Patent Application Laid-Open No. 2012-243194 Summary of the Invention [Problem to be solved by the invention]

[0008] However, Patent Document 1 does not consider factors related to the control of business and development processes or environmental conditions necessary for data understanding, nor does it consider the type of data, nor does it provide detailed information on the processes to be carried out by each stakeholder, and does not include information necessary for data analysis. Patent Document 2 only presents a data analysis method based on past associations with customer requests, but does not consider constraints that arise in business processes, and if the problem is not properly defined, it will result in rework.

[0009] An object of the present invention is to efficiently support the structuring of information for requirements definition. [Means for solving the problem]

[0010] The information processing device of the first disclosed technique is an information processing device having a processor that executes a program, a storage device that stores the program, an output device that outputs data in a displayable manner, and a communication interface that communicates with a terminal that outputs the data in a displayable manner, wherein the storage device stores a plurality of different directed graph structures, and each of the plurality of different directed graph structures includes a plurality of nodes each including a character string, and an edge that indicates a relationship between two of the plurality of nodes, and the processor performs an input process that receives an input of a node to be analyzed, a search process that searches for a similar node that includes a character string similar to the character string of the node to be analyzed input by the input process from a plurality of nodes included in each of the plurality of different directed graph structures, and when two or more directed graph structures including the similar node are found by the search process, a search process that searches for a similar node that is common to the two or more directed graph structures and includes the similar node. The relevant Connect multiple nodes in series Consisting of a rugged edgeA search process for searching for a common path, and when two or more directed graph structures including the similar node are found by the search process, the common path found by the search process is compared with the common path in a disjunction directed graph structure obtained by overlapping the two or more directed graph structures. Other nodes and edges that do not constitute and outputting the result to the output device or the terminal so as to display the result on the disjunction directed graph structure in a different manner from the above.

[0011] Second disclosed technology Information Processing The device is An information processing device having a processor that executes a program, a storage device that stores the program, an output device that outputs data in a displayable manner, and a communication interface that communicates with a terminal that outputs the data in a displayable manner, wherein the storage device stores a plurality of different directed graph structures and a selection history table, each of the plurality of different directed graph structures includes a plurality of nodes each including a character string and an edge that indicates a relationship between two nodes among the plurality of nodes, the selection history table stores selection items selected by the stakeholder for each stakeholder, and the processor performs an input process that receives an input of an analysis target directed graph structure, and a selection process that receives a selection of an analysis target stakeholder. The method includes: a selection process; a first calculation process for calculating a word similarity between a character string indicated by a first node included in the analyzed directed graph structure input by the input process and a character string indicated by the selection item selected by the analyzed stakeholder selected by the selection process; a first setting process for setting the first node in the analyzed directed graph structure for which the word similarity calculated by the first calculation process is equal to or greater than a threshold value as a first specific display target; and an output process for outputting the first specific display target set by the first setting process to the output device or the terminal so that it is displayed on the analyzed directed graph structure in a manner different from other nodes in the analyzed directed graph structure.

[0012] The information processing device of the third disclosed technique is an information processing device having a processor that executes a program, a storage device that stores the program, an output device that outputs data in a displayable manner, and a communication interface that communicates with a terminal that outputs the data in a displayable manner, wherein the storage device stores a plurality of different directed graph structures, each of the plurality of different directed graph structures includes a plurality of nodes each including a character string and an edge that indicates a relationship between two nodes among the plurality of nodes, and the edge has an importance, and the processor performs an acquisition process that acquires an analysis target directed graph structure from the terminal or the storage device, and for each of the edges present in the analysis target directed graph structure acquired by the acquisition process, The priority of the most upstream edge is set to be the same as the importance of the most upstream edge, and the importance of the edges other than the most upstream edge is set to be By normalizing based on the importance of the upstream edge, The edges other than the most upstream edge a conversion process for converting the importance into a priority; of based on the sum of the priorities of the edges in a path from a top node to a bottom node, The nodes and edges that constitute the path for which the sum of the priorities of the edges is the largest are defined as and a first output process for outputting the path to the output device or the terminal so that the path is displayed on the directed graph structure to be analyzed in a manner different from other nodes and other edges that do not constitute the path. [Effects of the Invention]

[0013] According to the exemplary embodiment of the present invention, it is possible to efficiently support information structuring for requirement definition. Problems, configurations, and effects other than those described above will become clear from the following description of the embodiment. [Brief explanation of the drawings]

[0014] [Figure 1] FIG. 1 is an explanatory diagram showing a first example of support for data analysis requirements definition. [Figure 2] FIG. 2 is an explanatory diagram showing a second example of the data analysis requirements definition support. [Figure 3] FIG. 3 is an explanatory diagram showing a third example of support for data analysis requirements definition. [Figure 4] FIG. 4 is an explanatory diagram illustrating an example of the system configuration of a data analysis requirements definition support system. [Figure 5] FIG. 5 is a block diagram illustrating an example of the hardware configuration of an information processing device. [Figure 6] FIG. 6 is a block diagram illustrating an example of a functional configuration of a data analysis requirements definition support device. [Figure 7] FIG. 7 is an explanatory diagram illustrating an example of a stakeholder table. [Figure 8] FIG. 8 is an explanatory diagram illustrating an example of a stakeholder relationship table. [Figure 9] FIG. 9 is an explanatory diagram illustrating an example of a stakeholder value table. [Figure 10] FIG. 10 is an explanatory diagram showing an example of an association table between issues, stakeholders, and factors. [Figure 11] FIG. 11 is an explanatory diagram illustrating an example of the task relationship table. [Figure 12] FIG. 12 is an explanatory diagram illustrating an example of the task priority table. [Figure 13] FIG. 13 is an explanatory diagram showing an example of a process-stakeholder-factor association table. [Figure 14] FIG. 14 is an explanatory diagram illustrating an example of the process relationship table. [Figure 15] FIG. 15 is an explanatory diagram illustrating an example of a factor table. [Figure 16] FIG. 16 is an explanatory diagram illustrating an example of the process carrier table. [Figure 17] FIG. 17 is an explanatory diagram illustrating an example of a user information table. [Figure 18] FIG. 18 is an explanatory diagram illustrating an example of a selection history table. [Figure 19] FIG. 19 is a flowchart showing a first example of a data analysis requirements definition support processing procedure. [Figure 20] FIG. 20 is a flowchart illustrating a second example of a data analysis requirements definition support processing procedure. [Figure 21] FIG. 21 is a flowchart illustrating a third example of a data analysis requirements definition support processing procedure. DETAILED DESCRIPTION OF THE INVENTION

[0015] <Example of support for defining data analysis requirements> First, an example of data analysis requirements definition support by the data analysis requirements definition support system will be described using Figures 1 to 3. Note that data analysis requirements definition support means supporting the definition of data analysis requirements. Data analysis requirements definition means defining the requirements necessary for data analysis.

[0016] Highlighting refers to displaying data to be highlighted in a way that makes it different from non-target data and makes it stand out, specifically by using a darker color, a thicker line, or a lower transparency compared to non-target data. Weak display refers to the opposite of highlighting, to displaying data to be highlighted in a way that makes it different from non-target data and makes it less noticeable, specifically by using a lighter color, a thinner line, a higher transparency, a dotted line, or no display compared to non-target data.

[0017] [Data analysis requirements definition support example 1] Figure 1 is an explanatory diagram showing Example 1 of Data Analysis Requirements Definition Support. Example 1 of Data Analysis Requirements Definition Support is an example of supporting data analysis requirements definition by presenting similar problem structures from multiple cases. In Figure 1, capital letters represent words containing one or more characters. Furthermore, rounded rectangles are nodes that represent problems, and arrows between nodes are edges that indicate the relationship between the nodes at both ends.

[0018] The data analysis requirements definition support system 10 stores multiple cases (in FIG. 1, for example, stored task 101 for case 1 and stored task 102 for case 2) represented by a directed graph structure having nodes and edges. When task 100 is input, the data analysis requirements definition support system 10 searches for stored tasks starting from task 100. In this example, stored task 101 for case 1 and stored task 102 for case 2 are searched for.

[0019] The data analysis requirements definition support system 10 extracts a common task 103 that is the common part of the accumulated task 101 of case 1 and the accumulated task 102 of case 2, and that includes task 100. In the example of FIG. 1, the common task 103 is a common path consisting of node A ⇒ node B ⇒ node E. The data analysis requirements definition support system 10 displays the extracted common task 103. This makes it possible to propose the common task 103 to the user as a similar task structure.

[0020] [Data analysis requirements definition support example 2] Figure 2 is an explanatory diagram showing Example 2 of Data Analysis Requirements Definition Support. Example 2 of Data Analysis Requirements Definition Support is an example of data analysis requirements definition support that presents highly relevant items from the review history of others. In Figure 2, rectangles are nodes that represent processes, and diamonds are nodes that represent factors. Arrows between nodes are edges that show the relationship between the nodes at both ends.

[0021] The data analysis requirements definition support system 10 accepts input of analysis target data 200 from a user. The analysis target data 200 includes, for example, a study issue 201 and a study process 202. In addition, in FIG. 2, it is assumed that stakeholders A and B are selected by the user in a stakeholder graph 210 as stakeholders to be analyzed collaboratively.

[0022] After this, the data analysis requirements definition support system 10 records the browsing history of the analysis target data 200 by stakeholders A and B, who have a conflict of interest. In the example of Fig. 2, the data analysis requirements definition support system 10 records issues 4 and 6 of the issues to be considered 201 that stakeholder A referenced, and issues 3, 4, and 6 of the issues to be considered 201 that stakeholder B referenced.

[0023] Similarly, the data analysis requirements definition support system 10 records process 2 of the review process 202 referred to by stakeholder A, and processes 2 and 3 of the review process 202 referred to by stakeholder B.

[0024] In addition, the data analysis requirements definition support system 10 also registers data that includes items referenced by stakeholders A and B, even if they are outside the analysis target data 200, such as other review processes 203 and their factors 5 in the example of Figure 2.

[0025] Then, the data analysis requirements definition support system 10 extracts issues 4 and 6 of the issue under consideration 201, process 2 of the review process 202, and factor 5 of another review process 203 as items referenced by both stakeholders A and B.

[0026] The data analysis requirements definition support system 10 recommends items referenced by stakeholders A and B to a user who inputs analysis target data 200. Specifically, for example, the data analysis requirements definition support system 10 displays, as recommendation information 220, a consideration issue 211 in which issues 4 and 6 referenced by both stakeholders A and B for consideration issue 201 are highlighted, a consideration process 212 in which process 2 is highlighted for consideration process 202, and another consideration process 213 in which factor 5 is highlighted.

[0027] This allows the user to understand which items of the analysis target data 200 both stakeholders A and B have referred to. The user can also understand which items of other studies both stakeholders A and B have referred to.

[0028] [Data analysis requirements definition support example 3] Figure 3 is an explanatory diagram showing Example 3 of Data Analysis Requirements Definition Support. Example 3 of Data Analysis Requirements Definition Support is an example of data analysis requirements definition support that presents the value of issues to be considered by weighting the priority of the issues. (A) shows the presentation of issue value based on importance, and (B) shows the presentation of issue value based on node distance. Here, the edge connecting the starting node X and the ending node Y is explained as edge XY.

[0029] In (A), an importance level is assigned to each edge of the directed graph structure representing the study issue 301. Here, the larger the value, the more important the edge is.

[0030] The data analysis requirements definition support system 10 converts the importance of downstream edges into priorities that indicate the connection of issue values ​​based on the importance of upstream edges. After priority conversion, the issue under consideration 301 becomes issue under consideration 310. Priorities are expressed as circled numbers. The priorities of the most upstream edges AB and AC are the same as their importance.

[0031] Furthermore, the importance of edges BD and BE is normalized by the importance of edge AB upstream of them. As a result, the priorities of edges BD and BE are each set to "0.5." Similarly, the importance of edges CE and CF is normalized by the importance of edge AC upstream of them. As a result, the priorities of edges CE and CF are set to "3.1" and "1.9," respectively.

[0032] The data analysis requirements definition support system 10 identifies and highlights the group of edges from the starting node A that has the largest sum of priorities. E Therefore, the data analysis requirements definition support system 10, for example, E are displayed thicker than other edges.

[0033] A threshold value may also be set for the priority. The data analysis requirements definition support system 10 displays edges with a priority equal to or lower than the threshold value in a weaker tone than other edges. For example, for the study issue 310, if the threshold value is set to "0.5," edges BD and BE both have a priority of "0.5," and are therefore displayed with a dotted line.

[0034] Furthermore, the data analysis requirements definition support system 10 displays nodes whose end-points are connected to an edge whose total priority is equal to or less than a threshold value in a weaker tone than other nodes. For example, in the study issue 310, if the threshold value is set to "0.5," the only edge connected to node D is edge BD, and the priority of edge DB is "0.5," so node D is displayed with a dotted line. On the other hand, the only edges connected to node E are edges BE and CE, and the priorities of edges BE and CE are "0.5" and "3.1," respectively, for a total priority of "3.6." Therefore, since the total priority is not equal to or less than the threshold value, node E is not displayed with a dotted line. Note that edge BD and node D, displayed with a dotted line, can be hidden by a user operation by collapsing them.

[0035] In (B), the data analysis requirements definition support system 10 accepts the user's selection of a node for the target issue among the issues to be considered 310. Here, it is assumed that node E has been selected as the target issue, and is set as the target node. The data analysis requirements definition support system 10 sets the node distance of the selected target node E to "0," which means the starting point. The node distance is expressed as a number in parentheses within the node.

[0036] The data analysis requirements definition support system 10 calculates the node distance from the target node for each node as the task value, with one edge being one node distance. The task 310 after the node distance calculation is set as the task 320.

[0037] The data analysis requirements definition support system 10 highlights nodes in (A) whose priority is equal to or greater than a threshold and whose node distance is equal to or less than a threshold as candidates with high task value. For example, if the priority threshold is set to "0.5" and the node distance threshold is set to "2" as in (A), node F is highlighted as a candidate with high task value because its priority is "1.9" and its node distance is "2." On the other hand, node F has a priority of "2" but a node distance of "3," so it is not highlighted as a candidate with high task value.

[0038] This allows the user to understand which connection between issues is important. In this way, the data analysis requirements definition support system 10 can support information structuring for quick and effective requirements definition for new cases through data analysis requirements definition support examples 1 to 3.

[0039] <System configuration example> 4 is an explanatory diagram showing an example of the system configuration of a data analysis requirements definition support system 10. The data analysis requirements definition support system 10 includes a data analysis requirements definition support device 401 and one or more terminals 402. The data analysis requirements definition support device 401 and the terminals 402 are communicably connected via a network 403 such as the Internet, a LAN (Local Area Network), or a WAN (Wide Area Network).

[0040] <Example of hardware configuration of information processing device (data analysis requirements definition support device 401, terminal 402)> FIG. 5 is a block diagram showing an example of the hardware configuration of an information processing device. The information processing device 500 includes a processor 501, a storage device 502, an input device 503, an output device 504, and a communication interface (communication IF) 505. The processor 501, the storage device 502, the input device 503, the output device 504, and the communication IF 505 are connected via a bus 506. The processor 501 controls the information processing device 500. The storage device 502 serves as a working area for the processor 501. The storage device 502 is a non-transitory or temporary recording medium that stores various programs and data. Examples of the storage device 502 include a read-only memory (ROM), a random access memory (RAM), a hard disk drive (HDD), and a flash memory. The input device 503 inputs data. Examples of the input device 503 include a keyboard, a mouse, a touch panel, a numeric keypad, a scanner, a microphone, and a sensor. The output device 504 outputs data. The output device 504 may be, for example, a display, a printer, or a speaker. The communication IF 505 connects to the network 403 and transmits and receives data.

[0041] <Example of functional configuration of data analysis requirements definition support device 401> 6 is a block diagram showing an example of the functional configuration of the data analysis requirements definition support device 401. The data analysis requirements definition support device 401 has a graph structure operation unit 600, a data management unit 610, a network information processing unit 620, a display processing unit 630, a stakeholder information storage unit 640, an issue information storage unit 650, a process information storage unit 660, and a user history storage unit 670.

[0042] The graph structure operation unit 600, data management unit 610, network information processing unit 620, and display processing unit 630 are specifically realized, for example, by having the processor 501 execute programs stored in the storage device 502 shown in Fig. 5. The stakeholder information storage unit 640, issue information storage unit 650, process information storage unit 660, and user history storage unit 670 are specifically realized, for example, by the storage device 502 shown in Fig. 5.

[0043] The graph structure manipulation unit 600 manipulates the directed graph structure interactively with the user by the user operating the input device 503. The graph structure manipulation unit 600 accepts data creation instructions, instructions to save created data, input of search conditions, and search instructions from the user.

[0044] The data management unit 610 has a data accumulation unit 611 and a data search unit 612. When the data management unit 610 receives a data creation instruction from the graph structure operation unit 600, it calls up data from the stakeholder information storage unit 640, the issue information storage unit 650, and the process information storage unit 660, and outputs stored candidates for stakeholder, issue, process, and factor information to the display processing unit 630. When the user has completed data creation and performed a save operation in the graph structure operation unit 600, the data management unit 610 causes the data accumulation unit 611 to save the created data in the stakeholder information storage unit 640, the issue information storage unit 650, and the process information storage unit 660.

[0045] When the data management unit 610 receives input of search conditions from the graph structure operation unit 600, the data search unit 612 calls up data from the stakeholder information storage unit 640, the issue information storage unit 650, and the process information storage unit 660, searches for related candidates for accumulated stakeholder, issue, process, and factor information, and outputs the search results to the display processing unit 630.

[0046] The network information processing unit 620 has a structure confirmation unit 621 and a structure search unit 622. When the user selects a candidate or adds new data using the graph structure operation unit 600, the network information processing unit 620 uses the structure confirmation unit 621 to confirm the connections between stakeholders, issues, processes, and factors, and outputs the confirmation results to the display processing unit 630. Furthermore, the network information processing unit 620 uses the structure search unit 622 to search the stakeholder information storage unit 640, issue information storage unit 650, and process information storage unit 660 for the directed graph structure operated by the graph structure operation unit 600, and outputs the search results to the display processing unit 630.

[0047] The display processing unit 630 outputs the output results from the graph structure operation unit 600, the data management unit 610, and the network information processing unit 620 to the terminal 402 in a displayable manner via the communication IF 505, or to the output device 504 in a displayable manner. Specifically, for example, the display processing unit 630 outputs the common task 103 shown in FIG. 1, the recommendation information 220 shown in FIG. 2, and the consideration tasks 301, 310, and 320 shown in FIG. 3 in a displayable manner to the terminal 402, and causes them to be displayed on the terminal 402.

[0048] The stakeholder information storage unit 640 has a stakeholder table 641, a stakeholder relationship table 642, and a stakeholder value table 643. The issue information storage unit 650 has an issue-stakeholder-factor association table 651, an issue relationship table 652, and an issue priority table 653. The process information storage unit 660 has a process-stakeholder-factor association table 661, a process relationship table 662, a factor table 663, and a process carrier table 664. The user history storage unit 670 has a user information table 671 and a selection history table 672.

[0049] <Stored Contents of Stakeholder Information Storage Unit 640> 7 is an explanatory diagram showing an example of a stakeholder table 641. The stakeholder table 641 has the following fields: stakeholder ID 701, stakeholder 702, business type 703, job type 704, and job title 705. A combination of values ​​in the same row of each of the fields 701 to 705 defines information about one stakeholder 702 (hereinafter referred to as stakeholder information).

[0050] The stakeholder ID 701 is identification information that uniquely identifies the stakeholder 702. The stakeholder 702 is a person with an interest. The stakeholder 702 may be a nickname such as "data analyst" or "manufacturer sales department," a corporation, or an individual. The business type 703 is the type of business that the stakeholder 702 is engaged in. The job type 704 is the type of occupation of the stakeholder 702. The position 705 is the position of the stakeholder 702 within the organization.

[0051] 8 is an explanatory diagram showing an example of the stakeholder relationship table 642. The stakeholder relationship table 642 has the following fields: ID 801, source stakeholder ID 802, destination stakeholder ID 803, and value ID 804. A combination of values ​​in the same row of each of the fields 801 to 804 defines stakeholder relationship information, each set consisting of two stakeholders 702. In addition, the source stakeholder ID 802 and the destination stakeholder ID 803 in the stakeholder relationship information identify an edge between the stakeholders 702.

[0052] The ID 801 is identification information that uniquely identifies the stakeholder relationship information. The provider stakeholder ID 802 is the stakeholder ID 701 of the stakeholder 702 that is the provider of the value 902 (see FIG. 9). The recipient stakeholder ID 803 of the value 902 is the stakeholder ID 701 of the stakeholder 702 that is the recipient. The value ID 804 is identification information that uniquely identifies the value 902.

[0053] 9 is an explanatory diagram showing an example of the stakeholder value table 643. The stakeholder value table 643 has fields: value ID 804, value 901, and type 902. A combination of values ​​in the same row of the fields 804, 901, and 902 defines value information for the stakeholder relationship information. The value 901 is the object of trading between stakeholders 702 identified by the stakeholder relationship information. The type 902 is the type of value 901.

[0054] <Storage Contents of Assignment Information Storage Unit 650> 10 is an explanatory diagram showing an example of an issue-stakeholder-factor association table 661. The issue-stakeholder-factor association table 661 has the following fields: issue ID 1001, issue 1002, subject stakeholder ID 1003, object stakeholder ID 1004, control factor ID 1005, and objective variable factor ID 1006. The combination of values ​​in the same row of each of the fields 1001 to 1006 defines issue-stakeholder-factor association information that indicates the association between the issue 1002, stakeholder 702, and factor 1502 (see FIG. 15).

[0055] The issue ID 1001 is identification information that uniquely identifies the issue 1002. The issue 1002 is a problem to be solved or a goal to be achieved by the stakeholder 702 (subject stakeholder 702) for the stakeholder 702 (object stakeholder 702). The issue 1002 is, for example, each of nodes A to F shown in FIG. 1.

[0056] The subject stakeholder ID 1003 is identification information that uniquely identifies the subject stakeholder 702. The subject stakeholder 702 is the stakeholder 702 that is the subject of the issue 1002. The object stakeholder ID 1004 is identification information that uniquely identifies the object stakeholder 702. The object stakeholder 702 is the stakeholder 702 that is the object of the issue 1002.

[0057] The control factor ID 1005 is identification information that uniquely identifies the control factor. The control factor 1502 is a factor 1502 that controls the task 1002. The dependent variable factor ID 1006 is identification information that uniquely identifies the dependent variable factor 1502. The dependent variable factor 1502 is a factor 1502 that is the dependent variable of the task 1002. For example, if the task 1002 is "reducing material costs," the dependent variable factor 1502 is a target value for the material costs to be reduced. Furthermore, the control factor 1502 is a factor that indicates an explanatory variable for the dependent variable factor 1502. For example, if the task 1002 is "reducing material costs," the control factor 1502 is, for example, the material to be reduced and the quantity of that material.

[0058] 11 is an explanatory diagram showing an example of the task relationship table 652. The task relationship table 652 has the following fields: ID 1101, upper task ID 1102, lower task ID 1103, and priority ID 1104. The combination of values ​​in the same row of each of the fields 1101 to 1104 defines task relationship information that indicates the relationship between two tasks 1002. The task relationship information is, for example, the edges shown in FIGS. 1 and 3.

[0059] ID 1101 is identification information that uniquely identifies the task relationship information. Upper-level task ID 1102 is the task ID 1001 of the upper-level task 1002 (hereinafter referred to as upper-level task 1002). Subordinate task ID 1103 is the task ID 1001 of the lower-level task 1002 (hereinafter referred to as lower-level task 1002). Upper-level task 1002 is, for example, the node at the start end of the arrow indicating an edge in Figures 1 and 3, and subordinate task 1002 is, for example, the node at the end end of the arrow indicating an edge from upper-level task 1002 in Figures 1 and 3. Priority ID 1104 is the priority 1202 of the task relationship information (see Figure 12).

[0060] 12 is an explanatory diagram showing an example of the task priority table 653. The task priority table 653 has a priority ID 1104 and a priority 1201. The priority 1201 is a relative value indicating whether the task relationship information, which is an entry in FIG. 11, should be placed before (or is more important than) or after (or is less important than) other task relationship information. The priority 1201 is, for example, the value of the circled number assigned to the edge shown in FIG. 3.

[0061] <Storage Contents of Process Information Storage Unit 660> 13 is an explanatory diagram showing an example of the process-stakeholder-factor association table 661. The process-stakeholder-factor association table 661 has the following fields: process ID 1301, process 1302, actor stakeholder ID 1303, input factor ID 1304, and output factor ID 1305. A combination of values ​​in the same row of each of the fields 1301 to 1305 defines process-stakeholder-factor association information that indicates the association between the process 1302, stakeholder 702, and factor 1502.

[0062] The process ID 1301 is identification information that uniquely identifies the process 1302. The process 1302 is a process that indicates the work and procedures for achieving the study task 201 in which multiple tasks 1002 are organized into a tree structure using task relationship information.

[0063] The acting stakeholder ID 1303 is the stakeholder ID 701 of the acting stakeholder 702 (acting stakeholder 702). The acting stakeholder 702 is the stakeholder 702 that provides a factor 1502 to the process 1302. The input factor ID 1304 is the factor ID 1501 (see FIG. 15) of the factor 1502 (hereinafter, input factor 1502) provided to the process 1302 by the acting stakeholder 702. The output factor ID 1305 is the factor ID 1501 of the factor 1502 (hereinafter, output factor 1502) that is output from the process 1302 to which the input factor 1502 is provided.

[0064] For example, in the review process 202 of FIG. 2, the "factor 1" and "factor 2" given to "process 2" are input factors 1502, and the "factor 3" output from "process 2" is the output factor 1502.

[0065] 14 is an explanatory diagram showing an example of a process relationship table 662. The process relationship table 662 has fields of ID 1401, previous process ID 1402, next process ID 1403, and carrier ID 1404. A combination of values ​​in the same row of each of the fields 1401 to 1404 defines process relationship information indicating the relationship between two consecutive processes 1302. The process relationship information is, for example, the edges of the process under consideration 202, which is the directed graph structure of the process shown in FIG. 2.

[0066] The ID 1401 is identification information that uniquely identifies the process relationship information. The previous process ID 1402 is the process ID 1301 of the process 1302 that appears first of two consecutive processes. The next process ID 1403 is the process ID 1301 of the process 1302 that appears last of two consecutive processes. The carrier ID 1404 is identification information that uniquely identifies the carrier 1601 (see FIG. 16).

[0067] 15 is an explanatory diagram showing an example of the factor table 663. The factor table 663 has fields of a factor ID 1501 and a factor 1502. The factor 1502 is an element that is input to the process 1302 or output from the process 1302.

[0068] 16 is an explanatory diagram showing an example of the process carrier table 664. The process carrier table 664 has fields of a carrier ID 1404 and a carrier 1601. The carrier 1601 is a general term for people, things, information, etc. that flow between two consecutive processes 1302.

[0069] <Stored Contents of User History Storage Unit 670> FIG. 17 is an explanatory diagram showing an example of a user information table 671. The user information table 671 has fields: a user ID 1701 and a user name 1702. A combination of values ​​in the same row of the fields 1701 to 1702 defines user information. The user ID 1701 is identification information that uniquely identifies a user who operates the terminal 402 to use the data analysis requirements definition support device 401. The user ID 1701 is also used as the stakeholder ID 701. The user name 1702 is the name of the user identified by the user ID 1701.

[0070] 18 is an explanatory diagram showing an example of the selection history table 672. The selection history table 672 has the following fields: ID 1801, user ID 1701, selected item 1802, and date and time 1803. The combination of values ​​in the same row of the fields 1801 to 1803 and 1701 defines the selection history information.

[0071] The ID 1801 is identification information that uniquely identifies the selection history information. The selected item 1802 is the ID of the item (task 1002, process 1302, factor 1502) selected by the user identified by the user ID 1701. The date and time 1803 is the date and time when the user identified by the user ID 1701 selected the selected item 1802.

[0072] <Data analysis requirements definition support processing procedure> [Data analysis requirements definition support example 1] 19 is a flowchart showing data analysis requirements definition support processing procedure example 1. FIG. 19 shows processing procedures corresponding to data analysis requirements definition support processing procedure example 1 shown in FIG.

[0073] The data analysis requirements definition support device 401 receives input of a node (for example, task 100 in FIG. 1) from the graph structure operation unit 600 through the user's operation of the terminal 402 (step S1901).

[0074] Next, the data analysis requirements definition support device 401 calculates the word similarity of the storage node with respect to the input node (step S1902). For each issue 1002 in the issue-stakeholder-factor association table 651, the data analysis requirements definition support device 401 calculates, for example, the cosine similarity with the word of the input node.

[0075] Next, the data analysis requirements definition support device 401 determines whether there is a storage node whose similarity is equal to or greater than a threshold value (step S1903). Specifically, for example, the data analysis requirements definition support device 401 determines whether there is a problem 1002 whose cosine similarity is equal to or greater than a threshold value. If there is no node whose similarity is equal to or greater than the threshold value (step S1903: No), the series of processes ends.

[0076] On the other hand, if there is a node whose similarity is equal to or greater than the threshold value (step S1903: Yes), the data analysis requirements definition support device 401 acquires a directed graph structure including stored nodes whose similarity is equal to or greater than the threshold value (hereinafter referred to as similar stored nodes) (step S1904). Specifically, for example, the data analysis requirements definition support device 401 references the task relationship table 652 and constructs a directed graph structure of stored tasks in which the task ID 1001 of the similar stored node is the upper task ID 1102 or the lower task ID 1103. In the example of Fig. 1, stored tasks 101 and 102 are constructed, which include task A, which is a similar node.

[0077] Next, the data analysis requirements definition support device 401 determines whether or not there are two or more directed graph structures acquired in step S1904 (step S1906). If there are not two or more directed graph structures (step S1906: No), there is only one directed graph structure, so the data analysis requirements definition support device 401 outputs the directed graph structure including the similar accumulation node as an accumulation task to the terminal 402 via the display processing unit 630 (step S1905).

[0078] On the other hand, if there are two or more directed graph structures (step S1906: Yes), the data analysis requirements definition support device 401 searches for paths common to two or more directed graph structures (hereinafter referred to as common paths) as tasks common to two or more accumulated tasks (common tasks) (step S1907).

[0079] Specifically, for example, the data analysis requirements definition support device 401 identifies a similar accumulation node for each of two or more directed graph structures. Next, the data analysis requirements definition support device 401 searches for a node of the upper-level task 1002 that has the similar accumulation node as a lower-level task 1002 for each of the two or more directed graph structures. Then, the data analysis requirements definition support device 401 calculates the cosine similarity between the nodes of the upper-level task 1002 for each of the two or more directed graph structures. If all of the cosine similarities between the nodes of the upper-level task 1002 are equal to or greater than a threshold, the data analysis requirements definition support device 401 searches for a node of the upper-level task 1002 when the node of the upper-level task 1002 is used as a node of the lower-level task 1002. This search is repeated until one of the cosine similarities between the nodes of the upper-level task 1002 becomes less than the threshold, or until no node of the upper-level task 1002 exists in any of the two or more directed graph structures.

[0080] Similarly, the data analysis requirements definition support device 401 searches for nodes of the super-task 1002 that have the similarity accumulation node as the super-task 1002 for each of the two or more directed graph structures. Then, the data analysis requirements definition support device 401 calculates the cosine similarity between the nodes of the sub-tasks 1002 for each of the two or more directed graph structures. If all of the cosine similarities between the nodes of the sub-tasks 1002 are equal to or greater than a threshold, the data analysis requirements definition support device 401 searches for nodes of the sub-task 1002 when the node of the sub-task 1002 is set as a node of the super-task 1002. This search is repeated until one of the cosine similarities between the nodes of the sub-tasks 1002 falls below the threshold, or until no nodes of the sub-task 1002 exist in any of the two or more directed graph structures.

[0081] In the example of Figure 1, a common path consisting of node A ⇒ node B ⇒ node E is searched for as a common problem.

[0082] After this, the data analysis requirements definition support device 401 uses the node group searched in this way and the edges between the nodes within the node group as common paths, and outputs a directed graph structure including the common paths to the terminal 402 via the display processing unit 630.

[0083] The directed graph structure including a common path may be only the common path, or may be a directed graph structure obtained by logically ORing two or more directed graph structures in which the common path is highlighted (and / or paths other than the common path are weakly displayed). Also, a similar accumulation node included in the common path may be replaced with an input node. Also, the similar accumulation node (or the replaced input node) may be highlighted in a format different from that of other nodes in the common path.

[0084] In the data analysis requirements definition support example 1, the data analysis requirements definition support device 401 searches for a directed graph structure of a problem, but the data analysis requirements definition support device 401 may search for a directed graph structure of a process such as the review process 202.

[0085] [Data analysis requirements definition support example 2] 20 is a flowchart showing a data analysis requirements definition support processing procedure example 2. FIG. 20 shows a processing procedure corresponding to the data analysis requirements definition support processing procedure example 2 shown in FIG.

[0086] In the data analysis requirements definition support device 401, the user operates the terminal 402 to receive input of the analysis target data 200 in the graph structure operation unit 600 (step S2001).

[0087] Next, the data analysis requirements definition support device 401 accepts the selection of stakeholders to be analyzed by the user operating the terminal 402 (step S2002). Here, it is assumed that stakeholders A and B are selected as stakeholders to be analyzed, as shown in FIG.

[0088] Next, the data analysis requirements definition support device 401 calculates the word similarity between the input node of the analysis target data 200 and the node referenced by the analysis target stakeholder stored in the selection history table 672 (step S2003). The word similarity is, for example, cosine similarity as described above. The input nodes of the analysis target data 200 are the nodes represented by rounded rectangles in the issue to be considered 201 included in the analysis target data 200 (issues 1 to 5 in FIG. 2) and the nodes represented by rectangles and diamonds in the issue to be considered 1922 (processes 1 to 3 and factors 1 to 3 in FIG. 2).

[0089] The nodes referenced by the stakeholder being analyzed and stored in the selection history table 672 are the issue 1002, process 1302, and factor 1502 identified by the issue ID 1001, process ID 1301, and factor ID 1501 recorded in the selection item 1802, where the user ID 1701 in the selection history table 672 is the stakeholder ID 701 of the stakeholder being analyzed.

[0090] When there are multiple stakeholders to be analyzed, the nodes referenced by the stakeholders to be analyzed stored in the selection history table 672 may be the nodes referenced by multiple stakeholders to be analyzed, or may be the nodes referenced by any one of the multiple stakeholders to be analyzed. The user can set conditions in advance for when there are multiple stakeholders to be analyzed. In the example of Figure 2, when there are multiple stakeholders to be analyzed, the nodes referenced by the stakeholders to be analyzed stored in the selection history table 672 are set to the nodes referenced by multiple stakeholders to be analyzed.

[0091] Next, the data analysis requirements definition support device 401 sets the input node whose word similarity with the node of the stakeholder to be analyzed is equal to or greater than a threshold as the first highlighted node (step S2004). In the example of Fig. 2, in the data to be analyzed 200, the nodes referenced by stakeholders A and B are Issue 4 and Process 2. The data analysis requirements definition support device 401 sets Issue 4 and Process 2 as the first highlighted nodes.

[0092] Next, the data analysis requirements definition support device 401 searches for nodes (hereinafter referred to as related nodes) that are related to nodes (hereinafter referred to as similar nodes) whose word similarity with the input node is equal to or greater than a threshold value and that have been referenced by the stakeholder to be analyzed (step S2005). For example, if the input node is a task, the related nodes are higher-level tasks or lower-level tasks of the task indicated by the input node, control factors or objective variable factors of the task indicated by the input node, and control factors or objective variable factors of the higher-level tasks or lower-level tasks of the task indicated by the input node.

[0093] Furthermore, for example, if the input node is a process, the related nodes are the previous or subsequent process of the process indicated by the input node, the input factors or output factors of the process indicated by the input node, and the input factors or output factors of the previous or subsequent process of the process indicated by the input node. The data analysis requirements definition support device 401 searches for related nodes by referring to the issue-stakeholder-factor association table 651, the issue relationship table 652, the process-stakeholder-factor association table 661, the process relationship table 662, the factor table 663, and the selection history table 672.

[0094] Next, the data analysis requirements definition support apparatus 401 calculates the word similarity between the related node and the node referenced by the analysis target stakeholder stored in the selection history table 672 (step S2006). The word similarity is, for example, the cosine similarity as described above.

[0095] Next, the data analysis requirements definition support device 401 sets the related nodes whose word similarity with the node referenced by the analysis target stakeholder is equal to or greater than a threshold value as second highlighted nodes (step S2007). In the example of FIG. 2, the related nodes are Issue 6 and Factor 5. The data analysis requirements definition support device 401 sets Issue 6 and Factor 5 as second highlighted nodes. 2 Set to the highlighted node.

[0096] Next, the data analysis requirements definition support device 401 generates recommendation information (step S2008). Specifically, for example, the data analysis requirements definition support device 401 adds issue 6 to the examination issue 201, updates the examination issue 201 to the examination issue 211, and generates the examination issue 211 in which issues 4 and 6 are highlighted. The data analysis requirements definition support device 401 also generates an examination process 212 in which the process of the examination process 202 is highlighted. The data analysis requirements definition support device 401 also generates another examination process 213 in which factor 5 is highlighted and which is composed of process 2 and process 3 included in the examination process 202, process 4 which is an associated node of process 3, factor 4 which is an input factor to process 4, and factor 5 which is an output factor from process 4.

[0097] Next, the data analysis requirements definition support device 401 outputs the generated recommendation information 220 to the terminal 402 so as to be displayable (step S2009). Specifically, for example, the data analysis requirements definition support device 401 outputs the study issues 211, the study processes 212, and the other study processes 213 as the recommendation information 220 to the terminal 402 so as to be displayable.

[0098] [Data analysis requirements definition support example 3] 21 is a flowchart showing data analysis requirements definition support processing procedure example 3. FIG. 21 shows processing procedures corresponding to data analysis requirements definition support processing procedure example 3 shown in FIG.

[0099] The data analysis requirements definition support device 401 acquires the study subject from the terminal 402 (step S2101). 3In this example, the data analysis requirements definition support device 401 acquires the study issue 301 from the terminal 402. For example, the data analysis requirements definition support device 401 may read out the directed graph structure of the study issue 301 created in the past by the user from the storage device 502, or may search the directed graph structure of the study issue 301 using a node indicating a certain issue as a search key. The user has assigned importance to the edges of the study issue 301.

[0100] 3, the data analysis requirements definition support device 401 converts the importance of the study issue 301 into a priority 1201 (step S2102). The data analysis requirements definition support device 401 assigns a priority ID 1104 that identifies the converted priority 1201 and registers it in the issue relationship table 652, and registers the priority 1201 and the priority ID 1104 in the issue priority table 653. Furthermore, if a priority ID 1104 has already been set for each edge (higher-level issue ID 1102 and lower-level issue ID 1103) of the study issue 301, no importance is assigned to the study issue 301, and the data analysis requirements definition support device 401 reads out the priority 120 from the issue priority table 653.

[0101] Next, the data analysis requirements definition support device 401 searches for a path with the highest total priority in the study subject 310 (step S2103). E The path with the highest total priority, "8.1", is searched for.

[0102] Next, the data analysis requirements definition support device 401 outputs the study issue 310 to the terminal 402 so that the path with the highest total priority is highlighted (step S2104).

[0103] Next, the data analysis requirements definition support device 401 acquires a target task by selection from the terminal 402 (step S2105). In the example of Fig. 3, the target task is node E. The data analysis requirements definition support device 401 sets the node distance of node E, which is the target task, to "0", which indicates the starting point.

[0104] Next, the data analysis requirements definition support apparatus 401 calculates the node distance from the objective problem to each node (step S2106). The node distance is incremented by 1 each time an edge is passed.

[0105] Next, the data analysis requirements definition support apparatus 401 searches for a node whose priority is equal to or greater than a threshold value and whose node distance is equal to or less than a predetermined distance (step S2107). In the example of FIG.

[0106] Then, the data analysis requirements definition support apparatus 401 further outputs the study issue 320 to the terminal 402 so that the node F is highlighted (step S2108).

[0107] In the data analysis requirements definition support example 3, the data analysis requirements definition support device 401 has been described as an example in which the value of a task is presented using the directed graph structure of the task, but the value of a process may also be presented using the directed graph structure of a process such as the review process 202.

[0108] According to this embodiment, when it is unclear how to structure the data, Data Analysis Requirements Definition Support Example 1, which is a recommendation technology that infers data from other cases, can suggest to the user a common task 103 that includes a common path common to the accumulated tasks as a similar task structure.

[0109] Furthermore, when the focus of information is unknown, the data analysis requirements definition support example 2, which is a highlighting technique based on the ideas of others, allows the user to understand which items of the analysis target data 200 both stakeholders A and B, who have interests, have referred to. The user can also understand which items of other studies both stakeholders A and B, who have interests, have referred to.

[0110] In addition, Data Analysis Requirements Definition Support Example 3, which is a rating technology that aligns with business value when it does not match the issue value of the user's field, allows users to understand which issue connections are important.

[0111] In this way, the data analysis requirements definition support device 401 can support information structuring for performing quick and effective requirements definition for new cases through data analysis requirements definition support examples 1 to 3. Therefore, even if the candidate issue to be considered is changed, for example, it is possible to simultaneously compare related stakeholders and the processes associated with them, and it becomes possible to propose the process consideration points and data required for consideration across multiple different tasks.

[0112] The data analysis requirements definition support device 401 may check whether there is a gap between the nodes of the directed graph structure, and if there is a gap, may output a warning to the terminal 402 in a displayable manner to the effect that there is a gap between the nodes.

[0113] Specifically, when adding a new node, the processing differs depending on the directed graph structure of each stakeholder, issue, and process. For example, in the case of a directed graph structure of stakeholders, if no bidirectional edges are defined between nodes representing stakeholders (only one-way arrows), the data analysis requirements definition support device 401 determines that no payment has been made and outputs a warning to the terminal 402 in a displayable manner.

[0114] In addition, in the case of a directed graph structure of a problem, if no edges are defined between the nodes representing the problem, or if only one-way edges are defined, the data analysis requirements definition support device 401 outputs a displayable warning to the terminal 402 indicating whether there are any further edges connecting the nodes.

[0115] Furthermore, in the case of a directed graph structure of a process, if no edge is defined between nodes indicating issues or if only a one-way edge is defined, the data analysis requirements definition support device 401 displays a warning indicating whether or not there are any more edges connecting the nodes to the terminal 402. Furthermore, the data analysis requirements definition support device 401 displays a warning indicating whether or not factors are missing for nodes to which no factors are connected to the terminal 402.

[0116] The terminal 402 that wants to receive the warning display adds the missing edges and factors through user operation. As a result, the data analysis requirements definition support device 401 reflects the added edges and factors from the terminal 402. This makes it possible to suppress data loss and support information structuring for quick and effective requirements definition for new cases.

[0117] The present invention is not limited to the above-described embodiments, and includes various modifications and equivalent configurations within the spirit and scope of the appended claims. For example, the above-described embodiments have been described in detail to clearly explain the present invention, and the present invention is not necessarily limited to configurations including all of the described configurations. Furthermore, part of the configuration of one embodiment may be replaced with the configuration of another embodiment. Furthermore, the configuration of another embodiment may be added to the configuration of one embodiment. Furthermore, part of the configuration of each embodiment may be added to, deleted from, or replaced with other configurations.

[0118] Furthermore, the aforementioned configurations, functions, processing units, processing means, etc. may be realized in part or in whole in hardware, for example by designing them as integrated circuits, or may be realized in software by a processor interpreting and executing a program that realizes each function.

[0119] Information such as programs, tables, and files that realize each function can be stored in storage devices such as memory, hard disks, and SSDs (Solid State Drives), or on recording media such as IC (Integrated Circuit) cards, SD cards, and DVDs (Digital Versatile Discs).

[0120] In addition, the control lines and information lines shown are those that are considered necessary for the explanation, and do not necessarily show all the control lines and information lines that are necessary for implementation. In reality, it can be considered that almost all components are interconnected. [Explanation of symbols]

[0121] 10. Data analysis requirements definition support system 401 Data Analysis Requirements Definition Support Device 402 Terminal 501 processor 502 Storage Devices 600 Graph Structure Operation Unit 610 Data Management Department 611 Data Storage Unit 612 Data Search Unit 620 Network Information Processing Unit 621 Structure confirmation section 622 Structure Search Department 630 Display processing unit 640 Stakeholder Information Storage Unit 650 Assignment information storage section 660 Process Information Storage Unit 670 User History Storage Unit

Claims

1. An information processing device having a processor that executes a program, a storage device that stores the program, an output device that outputs data in a displayable manner, and a communication interface that communicates with a terminal that outputs the data in a displayable manner, the storage device stores a plurality of different directed graph structures, each of the plurality of different directed graph structures including a plurality of nodes each including a character string, and an edge indicating a relationship between two nodes among the plurality of nodes; The processor: an input process for receiving input of the analysis target node; a search process for searching for a similar node including a character string similar to the character string of the analysis target node input by the input process from among the plurality of nodes included in each of the plurality of different directed graph structures; a search process for searching for a common path that is common to the two or more directed graph structures and is made up of a plurality of nodes including the similar node and edges connecting the plurality of nodes in series, when two or more directed graph structures including the similar node are found by the search process; an output process for outputting, when two or more directed graph structures including the similar node are found by the search process, the common path found by the search process to the output device or the terminal so as to be displayed on the disjunction directed graph structure obtained by superimposing the two or more directed graph structures in a manner different from other nodes and other edges that do not constitute the common path in the disjunction directed graph structure; An information processing device characterized by executing the above.

2. An information processing device having a processor that executes a program, a storage device that stores the program, an output device that outputs data in a displayable manner, and a communication interface that communicates with a terminal that outputs the data in a displayable manner, the storage device stores a plurality of different directed graph structures and a selection history table; each of the plurality of different directed graph structures includes a plurality of nodes each including a character string, and an edge indicating a relationship between two nodes among the plurality of nodes; the selection history table stores, for each stakeholder, the selection items selected by the stakeholder; The processor: an input process for accepting an input of a directed graph structure to be analyzed; a selection process for accepting a selection of stakeholders to be analyzed; a first calculation process for calculating a word similarity between a character string indicated by a first node included in the analysis target directed graph structure input by the input process and a character string indicated by the selection item selected by the analysis target stakeholder selected by the selection process; a first setting process for setting the first node in the analyzed directed graph structure, in which the word similarity calculated by the first calculation process is equal to or greater than a threshold, as a first specific display target; an output process of outputting the first specific display target set by the first setting process to the output device or the terminal so that the first specific display target is displayed on the analysis target directed graph structure in a manner different from other nodes in the analysis target directed graph structure; An information processing device characterized by executing the above.

3. An information processing device having a processor that executes a program, a storage device that stores the program, an output device that outputs data in a displayable manner, and a communication interface that communicates with a terminal that outputs the data in a displayable manner, the storage device stores a plurality of different directed graph structures, each of the plurality of different directed graph structures including a plurality of nodes each including a character string and an edge indicating a relationship between two nodes among the plurality of nodes, the edge having an importance; The processor: an acquisition process of acquiring an analysis target directed graph structure from the terminal or the storage device; a conversion process for converting the importance of the edges other than the most upstream edge into priorities by making the priority of the most upstream edge the same as the importance of the most upstream edge for each of the edges present in the analyzed directed graph structure acquired by the acquisition process and normalizing the importance of the edges other than the most upstream edge based on the importance of the edges on the upstream side; a first output process for outputting, to the output device or the terminal, the nodes and edges that constitute the path whose sum of the priorities of the edges is the largest based on the sum of the priorities of the edges in the path from the top node to the bottom node of the directed graph structure to be analyzed, so as to be displayed on the directed graph structure to be analyzed in a manner different from other nodes and other edges that do not constitute the path whose sum of the priorities of the edges is the largest; An information processing device characterized by executing the above.

4. An information processing method executed by an information processing device having a processor that executes a program, a storage device that stores the program, an output device that outputs data in a displayable manner, and a communication interface that communicates with a terminal that outputs the data in a displayable manner, the storage device stores a plurality of different directed graph structures, each of the plurality of different directed graph structures including a plurality of nodes each including a character string, and an edge indicating a relationship between two nodes among the plurality of nodes; The processor: an input process for receiving input of the analysis target node; a search process for searching for a similar node including a character string similar to the character string of the analysis target node input by the input process from among the plurality of nodes included in each of the plurality of different directed graph structures; a search process for searching for a common path that is common to the two or more directed graph structures and is made up of a plurality of nodes including the similar node and edges connecting the plurality of nodes in series, when two or more directed graph structures including the similar node are found by the search process; an output process for outputting, when two or more directed graph structures including the similar node are found by the search process, the common path found by the search process to the output device or the terminal so as to be displayed on the disjunction directed graph structure obtained by superimposing the two or more directed graph structures in a manner different from other nodes and other edges that do not constitute the common path in the disjunction directed graph structure; An information processing method comprising:

5. An information processing method executed by an information processing device having a processor that executes a program, a storage device that stores the program, an output device that outputs data in a displayable manner, and a communication interface that communicates with a terminal that outputs the data in a displayable manner, the storage device stores a plurality of different directed graph structures and a selection history table; each of the plurality of different directed graph structures includes a plurality of nodes each including a character string, and an edge indicating a relationship between two nodes among the plurality of nodes; the selection history table stores, for each stakeholder, the selection items selected by the stakeholder; The processor: an input process for accepting an input of a directed graph structure to be analyzed; a selection process for accepting a selection of stakeholders to be analyzed; a first calculation process for calculating a word similarity between a character string indicated by a first node included in the analysis target directed graph structure input by the input process and a character string indicated by the selection item selected by the analysis target stakeholder selected by the selection process; a first setting process for setting the first node in the analyzed directed graph structure, in which the word similarity calculated by the first calculation process is equal to or greater than a threshold, as a first specific display target; an output process of outputting the first specific display target set by the first setting process to the output device or the terminal so that the first specific display target is displayed on the analysis target directed graph structure in a manner different from other nodes in the analysis target directed graph structure; An information processing method comprising:

6. An information processing method executed by an information processing device having a processor that executes a program, a storage device that stores the program, an output device that outputs data in a displayable manner, and a communication interface that communicates with a terminal that outputs the data in a displayable manner, the storage device stores a plurality of different directed graph structures, each of the plurality of different directed graph structures including a plurality of nodes each including a character string and an edge indicating a relationship between two nodes among the plurality of nodes, the edge having an importance; The processor: an acquisition process of acquiring an analysis target directed graph structure from the terminal or the storage device; a conversion process for converting the importance of the edges other than the most upstream edge into priorities by making the priority of the most upstream edge the same as the importance of the most upstream edge for each of the edges present in the analyzed directed graph structure acquired by the acquisition process and normalizing the importance of the edges other than the most upstream edge based on the importance of the edges on the upstream side; a first output process for outputting, to the output device or the terminal, the nodes and edges that constitute the path whose sum of the priorities of the edges is the largest based on the sum of the priorities of the edges in the path from the top node to the bottom node of the directed graph structure to be analyzed, so as to be displayed on the directed graph structure to be analyzed in a manner different from other nodes and other edges that do not constitute the path whose sum of the priorities of the edges is the largest; An information processing method comprising:

Images