JPS58223864A - Production and display system of problem structure chart - Google Patents

Abstract

PURPOSE:To understand easily and quickly the result of structuring, by converting automatically structuring result into a hierarchical structure. CONSTITUTION:A structuring result data storage part 1 stores the result of grouping of problem elements by means of a structuring method. The structuring data consists of the information by which the original problem elements belonging at least to each of divided groups can be discriminated. A tree data storage part 2 stores the tree data which shows a hierarchical structure obtained from the structuring result. This tree data is read out by a tree data read/write part 3 and converted into a tree drawing instruction at a tree display data converting part 5 to be displayed at a tree display part 6. The tree chart can be freely changed in response to an indication given from a tree corrected chart indicating part 8. A tree data showing a new problem structure is produced by a converting part 7 into a tree data from a structuring data. The result of conversion is stored in the part 2.

Description

[Detailed description of the invention] [Technical field of invention] The present invention relates to a method for creating and displaying a problem structure diagram.

[Technical background of the invention and its problems] When grasping a problem in which many elements are intricately intertwined, it is convenient and often used to classify the elements hierarchically and display them in a tree-like manner. It is being said. In the example in Figure 1,
A, which represents the entire problem, is divided into two parts A1 and A2, and furthermore, (: part A1 is divided into All and A12.
211#A212. A221 and A222 correspond to the individual elements that make up the entire problem.

Traditionally, when creating a hierarchical diagram like this when solving a problem, the overall problem is detailed starting from the top layer, and then
The procedure of modifying the details later has been used, but because there is no perspective on the problem as a whole at the initial stage of problem solving, a satisfactory hierarchical structure cannot be obtained.

Instead, first cover the individual problem elements, divide them into groups using some method (hereinafter this operation is called structuring), and then use the results as a reference to create a tree diagram 1 = Procedures such as summarizing are becoming popular. However, in this case, C2 did not have a device to directly convert and display the structuring results into a tree diagram, so there were various problems. The work of structuring and interpreting problems from two viewpoints was consuming a large amount of time.

[Purpose of the invention]

The present invention relates to a method for automatically converting the result of structuring into a tree-like structure by changing parameters, structuring method 1, which does not cause structural inconsistency. The purpose is to enable quick and easy understanding of the results.

[Summary of the invention]

Many structuring methods change the structuring parameters:: Therefore, different grouping results can be obtained, but changing the parameters I: Therefore, not causing structural contradictions means that a certain parameter α When the structuring result is divided into three groups consisting of elements A, B, C and element E as shown in Figure 2 (a), the structuring result using another parameter β is As shown in Figure 2(b), the result is subdivided by the parameter αG (a group consisting of A, B, and C is subdivided into two groups consisting of A, B, and C), or the result is determined by the parameter α. is the subdivision of the results by β (the two groups D and E are
,F! ) and 1,
This means that the elements of a group created by structured concatenation with different parameters r do not cause contradictions as shown in Figure 2 (C) (in Figure 2 (a), element C is A, B belongs to the same group (1, but Fig. 2 (
C) belongs to the same group as E).

[Embodiments of the invention]

FIG. 3 shows an embodiment of the invention. The structured result data storage unit (1) is a part that stores the results of grouping problem elements using a structuring method, and the structured result data is stored in such a way that at least the original problem elements belonging to each divided group can be identified. Consists of information. Example 1 is an example of structured result data.

(Example 1) GRI BL 8 GR2 BL 7 GR3 BL 2 BL 4 In this example, GR represents the group and BL represents the original problem element. That is, group 11 = problem element 5
．． 6.8 belongs to Group 2;

3.7 belongs to group 3I; 2.4 belongs to it.

The tree data storage unit (2) has already stored tree diagram data showing a hierarchical structure based on 12 as a result of structuring.

This is data describing a structure as shown in FIG. 1, and is in the form of, for example, a ring structure. In a state where no structuring has been performed (initial state), the data stored here has a structure in which all individual problem elements are connected as children of a box representing the entire problem, as shown in Figure 4. It has become.

This tree data is stored in the tree data reading/writing section (
3) I: is read out, and the tree drawing command I: is converted in the conversion unit (5) to tree diagram display data, and the tree display unit (
6) will be displayed. This tree map is based on the tree modification instruction section (8
) instructions I: Therefore any I: can be changed.

The result of structuring using a certain parameter is read out by the structured result data reading unit (4), and is read out by the tree data reading/writing unit (3). By merging with data, tree data representing a new problem structure is created.

This operation is performed by the structured data to tree data conversion section (7)
The results are stored in the tree data storage unit (2) 1m through the tree data reading/input unit (3).

FIG. 5 is for explaining the operation of the structured data to tree data converter (7). FIG. 6(a) shows a pre-created tree structure read out from the tree data storage unit (2), and a group structured using new parameters read out from the structuring result data storage unit (1). Suppose that the result of division is I as in (Example 2). Iting rg BL A12 GR2 G 3 BL A221 BL A222 In the conversion part (7) of structured data to tree data, the problem elements belonging to each group of the structured result and each node in the already created tree structure are Comparing the elements located at the lower level of: 2. Thus, new tree data is created. That is,
The parent in the tree structure shown in FIG. 6(a) of the first element All of group 1 (GRI) in (Example 2) is a person, and the descendants of s people include elements belonging to group l, so Create a new box that is a child of A corresponding to group 1 and is the parent of All. Furthermore, the element of I niger loop l is Al
Since 1 and A12 are open, if A12 is added as a child of this newly created box, a tree structure similar to the tatami mat shown in Figure 6(b) will be created. Also group 2
The parent of the first element A2111 of (GfL2) in the tree structure is A2, and the descendants of A2 in the tree structure include elements of group 2, so they are children of A2 corresponding to group 2. If you create a box that is the parent of A2111 and add A2112 to its child, a tree structure of 4 floors or less will be created.

The tree structure corrected by the structuring result using the new parameters created in this way is shown in Fig. 6). By the tree data correction instruction section (8), AI, A21. A22 By adding the names, a tree diagram showing the problem structure as shown in Figure 1-1 is completed. By repeating the above operations while changing the parameters, a final hierarchical diagram of the problem structure can be obtained.

〔Effect of the invention〕

The effect of the present invention is that by automatically converting the structured results into a hierarchical structure diagram, the results can be understood immediately, and this allows many structurings for problem interpretation from many viewpoints to be put into practice. This makes it possible to grasp the essence of a problem in a short time.

[Brief explanation of drawings]

Figure 1 is a tree diagram showing the hierarchical structure of the problem given for problem solving, Figure 2 is a diagram to explain a structuring method that does not cause structural contradictions due to changes in parameters,
Fig. 3 is a diagram showing an embodiment of the present invention, Fig. 4 is a diagram showing the initial state of tree data stored in the tree data storage unit C2, and Fig. 5 is a diagram showing the conversion of structured data to tree data. FIG. Explanation of symbols 1...Structured result data storage section 2...Tree data storage section 3...Tree data reading/writing section 4...Structured data reading section 5...Conversion to tree display data Section 6... Tree display section 7... Structured data to tree data conversion section 8...
Tree data correction instruction department (7317) Representative patent attorney Kensuke Chika (and 1 other person) Figure 1 Figure 2 Figure 3 Figure 4

Claims (1)

[Claims] Data that represents the hierarchical structure between the elements that make up a certain matter A that has been created in advance, and data that has been created separately by dividing the constituent elements of that matter A into groups, and the contents of these two data are merged. A new hierarchy between the elements that make up the shell