JP2007257503A - Conference support system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To show quantitative data for selecting a chairperson optimum for advance of a conference. <P>SOLUTION: This conference support system 100 supporting the conference for analyzing a problem on the basis of problem information extracted from a problem information group comprising a plurality of pieces of problem information associated in a tree state has: a problem holding means 102 holding the problem information group; a problem editing part 101 acquiring operation performed to one problem information group by a participant; a tree information acquisition means acquiring tree information showing positional relation inside a tree related to the problem information operated by the participant; and a selection part 107 analyzing the acquired tree information in each the participant, and selecting the participant suitable as the chairperson of the conference. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to a system that supports a conference, and more particularly to a system that supports a conference that extracts problems and formulates solutions.

  Various problems have arisen in managing the organization. For example, problems such as “cannot achieve sales” and “cannot develop and ship products as planned” occur in companies.

  In order to find out the cause of a problem that has occurred or is likely to occur, and find a solution to it, it is common for a person to open a meeting and review it. .

  Conventionally, in a conference as described above, a database in which a large number of causal relationships between problems and causes are stored is used, and conference participants proceed with the conference using this database.

  However, the results of the conference vary greatly depending on the experience and ability of the participants, the degree of understanding and willingness to the problem, and the actual situation is that it is not always possible to find an optimal solution.

  Therefore, a conference support system that evaluates the capabilities of participants in the conference has been proposed (for example, Patent Document 1).

  This is to evaluate the participants of the conference by letting the computer system handle each stage of information collection, analysis, storage, and display, and the evaluation result can be used for selecting the participants of the conference. It is also possible to improve the willingness to participate in the conference.

In this specification, claims, and drawings, the words “problem” and “cause” are used, but the difference between these words does not clearly distinguish the contents, but the same contents. May be described. The “problem information” is information indicating a certain matter, and is described as a broad meaning that is not bound by the word “problem”.
JP 2000-99570 A

  However, even if only participants who are legitimately evaluated and are suitable for the meeting at the meeting where the problem is extracted, the result of the meeting is not necessarily good. The support system itself was not functioning well.

  Therefore, the inventors of the present application reviewed the relationship between the conference support system and the result of the conference, and in order to improve the conference, not only evaluated the ability of the participants of the conference, but also the progress of the conference. I came up with an evaluation of my ability as a moderator.

  The present invention has been made in view of the above problems, and an object of the present invention is to provide a material for selecting a moderator who conducts a conference.

  In order to achieve the above object, a conference support system according to the present invention supports a conference for analyzing a problem based on problem information extracted from a group of problem information composed of a plurality of problem information associated in a tree shape. A conference support system comprising: an information holding unit that holds the problem information group; an operation acquisition unit that acquires an operation performed by the participant on any one of the problem information groups; and a tree relating to the problem information operated by the participant A tree information acquisition unit that acquires tree information indicating a positional relationship in the system, and a selection unit that analyzes the acquired tree information for each participant and selects a participant who is suitable as a conference host. And

  As a result, it is possible to present information for selecting the best moderator for the facilitator of the conference.

  The operation in the operation acquisition means is an action in which the participant selects any problem information from the problem information group, or an action in which the participant adds new problem information to the problem information group.

  By acquiring these actions and analyzing them based on the tree information, it is possible to quantitatively present information for selecting the best moderator for the meeting facilitator.

  Note that a problem analysis support method that includes the processing operations performed by the above means as steps can achieve the same effects as described above. The same applies to a program that causes a computer to execute these steps.

  Information for selecting the best moderator for the progress of the problem extraction meeting can be presented and the meeting itself can be evaluated.

  Next, an embodiment according to the present invention will be described with reference to the drawings.

  FIG. 1 is a block diagram illustrating a functional configuration of the conference support system according to the present embodiment.

  The conference support system 100 according to the present embodiment, when problem information is selected from a problem information group composed of problem information as a plurality of unit information associated in a tree shape, or a new problem is added to the problem information group When information is added, it is a system that shows a general moderator evaluation function that is information for selecting the best moderator of the conference based on the tree information of the problem information that has been selected or added. Problem editing unit 101 that functions as an operation acquisition unit, problem storage unit 102 that functions as an information storage unit, labeling processing unit 103, selection result totaling unit 104, selection result analysis unit 105, storage unit 106, and selection Unit 107, tree difference totaling unit 108, and pass / fail presentation unit 109.

  The problem editing unit 101 is a processing unit that accepts operations such as selection of problem information in the problem information group, addition of new problem information to the problem information group, deletion of problem information, and reconnection of the relationship between the problem information, A GUI (graphical user interface) realized by a computer is provided, and problem information can be selected and input from a mouse or a keyboard with reference to a computer screen.

  The problem holding unit 102 is a storage medium that holds a group of problem information. As this storage medium, a medium capable of storing and holding a large amount of information such as a hard disk can be listed.

  The labeling processing unit 103 is a processing unit that assigns a label as an identifier for identifying each problem information to the problem information held in the problem holding unit 102. Further, the labeling processing unit 103 searches and specifies tree information indicating where each problem information exists and in what kind of spread, and stores the tree information in association with the label. .

  Here, the problem information group and tree information will be described.

  FIG. 2 is a diagram showing a group of problem information before the labeling process.

  As shown in the figure, the problem information group 110 is data configured by associating a plurality of problems that are the cause of failure to achieve a business plan that occurs in the operation of a company in a tree shape as problem information. The problem information is related in a vertical relationship.

  FIG. 3 is a diagram showing the problem information group 110 after the labeling process.

  As shown in the figure, the labeling processing unit 103 assigns serial numbers as labels in order from the top of the problem information to the problem information group 110 having a tree structure. The labeling method (law) is not particularly limited as long as each problem information can be identified, and the contents of the label (letters, numbers, decoding thereof, etc.), the order of labeling, and the like are not particularly limited.

  In the case of the present embodiment, the problem information “Business plan cannot be achieved” located at the top of the tree structure is labeled “1”, and each time the hierarchy is lowered, a numerical value as a label is added and the same. In the case of a hierarchy, the lowest numerical value label is attached to the problem information located on the leftmost side, and one numerical value is added toward the right.

  FIG. 4 is a diagram illustrating a correspondence relationship between the label attached to each piece of problem information by the labeling processing unit 103 and the positional relationship of the piece of problem information.

  As shown in the figure, the hierarchy where the problem information is located is the depth, the tree is traced downward from the corresponding problem information, the label of the problem information that arrives at the end is the end branch, and these are the tree information and the label It is associated.

  The labeling processing unit 103 attaches a label as shown in FIG. 3 and also has a function of searching for and acquiring tree information of problem information attached with the label.

  Specifically, the depth means that the problem information at the top of the tree (in FIG. 3, “business plan cannot be achieved”) is the first, and problem information directly linked to the top (in FIG. 3) , “Sales cannot be achieved” etc.) is ranked second, and problem information directly linked to the second-ranked problem information (in FIG. 3, “commercialization is delayed and misses business opportunities”, etc.) is 3 In this case, the problem information with a larger numerical value is a concept that becomes (deeper) problem information that is farther from the top.

  A terminal branch is a problem in which, when certain problem information (for example, “the product is not the product desired by the customer” in FIG. 3) is selected, the relationship is traced from the problem information in the lower direction and finally arrives. Information (in Fig. 3, "Technology-driven development has failed to develop technology corresponding to customer feedback" and "There is no mechanism to reflect customer feedback in the plan") (Fig. 3 Indicates “11” and “12”). Therefore, when there is a wide variety of problem information related to the lower direction with respect to certain problem information, there are a large number of terminal branches.

  The selection result totaling unit 104 is a processing unit that acquires and accumulates the tree information 120 of the problem information selected by the problem editing unit 101 and totals the tree information 120 for each conference participant who has selected the problem information. .

  The selection result analysis unit 105 is a processing unit that analyzes the tree information 120 aggregated by the selection result aggregation unit 104 for each participant in the conference and transmits the result to the storage unit 106.

  The accumulating unit 106 is a storage medium for accumulating the results analyzed by the selection result analyzing unit 105 and the results totaled by a tree difference totaling unit 108 described later.

  The selection unit 107 is a processing unit that presents information for selecting an optimal participant as a conference presenter based on the analysis results and the aggregation results stored in the storage unit 106.

  The tree difference totaling unit 108 is a processing unit that acquires the state of the problem information group in each conference and totals the differences between conferences existing in time series.

  The selection result totaling unit 104, the selection result analyzing unit 105, the selection unit 107, the tree difference totaling unit 108, and the pass / fail presentation unit 109 each function as a tree information acquisition unit that acquires tree information. .

  The pass / fail presentation unit 109 is a processing unit that aggregates tree information and creates a graph in order to provide information that contributes to pass / fail judgment of the conference itself.

  Next, the processing operation of the conference support system 100 configured as described above will be described.

  First, a processing operation for selecting problem information from the problem information group 110 will be described.

  First, as pre-processing, a conference ID for identifying a conference to be held and a moderator ID (one of the participant IDs) of the conference are input.

  FIG. 5 is a flowchart showing a processing operation for selecting problem information from the problem information group 110.

  Next, the participant ID for identifying the participant of a meeting is input using the function of the question edit part 101 (S401).

  FIG. 6 is a diagram showing a GUI by the question editing unit 101.

  As shown in the upper left of the figure, an input box is displayed on the screen of the conference support system 100 together with a message prompting the participant ID to be input. Then, the participant ID (A in the figure) of the participant who selects the problem information is input in the input box. Next, if the OK button is virtually pressed with the mouse, the screen shifts to the next search screen.

  Next, in order to select problem information, a keyword related to the problem information is input (S402).

  As shown in FIG. 6, an input box is displayed on the screen of the conference support system 100 together with a message for prompting the keyword. Then, a keyword (business plan in the figure) is entered in the input box. Next, if the OK button is virtually pressed with the mouse, the screen shifts to the next selection screen.

  Next, problem information candidates shown on the selection screen are selected (S403).

  As shown in FIG. 6, problem information candidates are displayed on the screen of the conference support system 100. After checking the check box to the left of the problem information candidates, the OK button is clicked with the mouse. Press virtually to return to the problem input screen.

  Next, the label of the selected problem information and the participant ID are stored in the storage unit 106 in association with the conference ID and the moderator ID set in advance.

  Next, if the end button on the question input screen is virtually pressed (S405: Y), the selection of the question information is finished.

  On the other hand, when a new keyword is input into the input box on the question input screen and the OK button is virtually pressed, the processing from S402 is repeated.

  The above processing is performed for all the members participating in the conference.

  As described above, the problem information is selected without presenting the entire problem information group 110 or the causal relationship of the problem information by searching by keyword and presenting and selecting only the hit problem information. Therefore, since the tree information 120 associated with the problem information is not known to the participant, an arbitrary meaning such as “Let's select deep problem information” can be eliminated.

  Although FIG. 6 shows a state where the keyword is input twice, the present invention is not limited to this, and the keyword may be input once or more than twice. . Moreover, not all the participants have to select the same number of pieces of problem information, the number of selections is arbitrary, and the number of selections may be zero.

  Next, the process of the selection counting unit 104 will be described.

  As shown in FIG. 7, the selection counting unit 104 totals the tree information 120 for each participant ID and for each conference ID. Specifically, based on the label stored in the storage unit 106, the participant ID, and the conference ID, the depth information associated with the label attached to the problem information selected by the participant is extracted and the average value thereof is extracted. Is calculated for each participant ID.

  Specifically, participant ID: A, meeting ID: 1st, labels corresponding to the selected problem information: 9, 6, 8, depth corresponding to these: 4, 3, 3, these information When the average value is calculated based on the above, the average value is 3.33.

  Similarly, the number of terminal branches associated with the label is counted, and the total is calculated for each participant ID.

  Specifically, participant ID: A, conference ID: 1st, labels corresponding to the selected problem information: 9, 6, 8, terminal branches corresponding to these: {16} {11, 12} { 14, 15}, and counting the number of terminal branches based on these pieces of information yields the number of terminal branches: 5. In the case of labels 4 and 9 corresponding to the selected problem information, terminal branches corresponding to these are {16} {16}. In this case, since the same terminal branch is one, the number of terminal branches is one.

  Finally, the average value of the depth and the total value of the end branches are added for each participant ID, and the result is stored in the storage unit 106 as the participant ID and the moderator evaluation function for each conference.

  Specifically, the average value of the depth: 3.33 and the value obtained by adding the number of terminal branches: 8.33 are stored as the moderator evaluation function of the participant ID: A as the moderator evaluation function. .

  Further, the average depth calculated for each participant ID is summed for each conference ID, and the value obtained by dividing this value by the number of participant IDs (depth average) and the number of terminal branches for each participant ID For each conference ID, and a value obtained by dividing this value by the number of participant IDs (average number of terminal branches) is stored in the storage unit 106 in association with the conference ID.

  Note that detailed values of the second and subsequent meetings in the diagram shown in FIG. 7 are omitted, and only the total results are shown.

  Next, processing of the selection result analysis unit 105 will be described.

  As shown in FIG. 8, the selection result analysis unit 105 extracts the depth average and the terminal branch number average calculated by the selection totaling unit 104 from the storage unit 106, and between the conference IDs arranged in time series. The depth average difference is calculated, and the terminal branch number average difference is calculated. These differences are accumulated in the accumulating unit 106 as an average depth change amount and an end branch number average change amount.

  Next, processing for adding problem information to the problem information group 110 will be described.

  FIG. 9 is a diagram showing a problem information addition screen by the problem editing unit 101.

  As shown in the figure, a conference ID and a moderator ID are input as conference information. If the conference ID and the moderator ID are input in advance, these inputs can be omitted.

  Next, the problem information is searched by the keyword, and the search result is displayed. The displayed problem information becomes problem information that is directly above the problem information to be added.

  Next, check the most relevant problem information from the displayed parent candidates and virtually press the OK button.

  Next, when the problem information to be added is input and the OK button is virtually pressed, a confirmation screen is displayed. When the OK button is virtually pressed, the addition of the problem information is completed.

  In this way, problem information is added to form a problem information group 110 as shown in FIG. 10, and the information is held in the problem holding unit 102.

  In addition, in the selection screen for parent candidates shown in FIG. 9, a plurality of checks can be entered as related problem information.

  In such a case, as indicated by the solid line in FIG. 11, one piece of problem information is associated with two different pieces of problem information. In this case, as shown by a broken line in FIG. 11, two different pieces of problem information are labeled as being associated with the parent problem information, and the tree information 120 is created.

  In addition, as shown by a broken line in FIG. 12, there is a case where the association goes backward from the lower problem information to the higher problem information. In this case, the tree information 120 is created ignoring the broken line. .

  As described above, when problem information is added, the end branch of the tree information 120 changes, which affects the overall moderator evaluation function calculated in the selection unit 107.

  Next, the tree difference totaling unit 108 acquires the maximum value of the tree depth of the problem information group 110, acquires the number of all terminal branches, and calculates a difference with the tree depth acquired last time, The difference from the number of all end branches is calculated.

  Then, these acquisition results and calculation results are stored in the storage unit 106.

  Specifically, when the problem information group 110 in the state shown in FIG. 2 is changed to the problem information group 110 in the state shown in FIG. 13, the change amount of the tree depth is 2, and the change amount of the tree width is 2 and these values are stored in the storage unit 106.

  Next, processing of the selection unit 107 will be described.

  The selection unit 107 extracts the change in the depth of the tree, the change in the width of the tree, the change in the average depth, and the change in the average number of terminal branches accumulated in the storage unit 106 in advance. As shown in FIG. 14, these are added for each conference ID. This added value is an evaluation function indicating the quality of the conference and a moderator evaluation function based on the amount of change that is an evaluation function of the conference moderator.

  Further, by adding a moderator evaluation function based on the answer result obtained by the participant selecting problem information at each meeting to the moderator evaluation function based on the change amount, a general moderator A person evaluation function is calculated.

  And those having many general moderator evaluation functions are selected as the optimal moderators. The conference support system presents the general moderator evaluation function. However, the presentation method may present only the participant ID that has obtained the highest general moderator evaluation function, or all participant IDs. It is also possible to present a general moderator evaluation function for.

  In the present embodiment, selection and addition are specifically shown as operations in the question editing unit 101, but the present invention is not limited to this. For example, as the operation in the problem editing unit 101, other items such as deletion of problem information, change of the tree structure of the problem information group 110 (relation of related relationships), and the like can be listed.

  Specifically, the deletion of the problem information is an operation of identifying certain problem information and deleting the identified problem information.

  The participant who has performed the deletion operation obtains the same tree information 120 as when the parent (higher level) of the deleted problem information is selected, and the subsequent processing is executed. For example, when an operation for deleting the problem information “label is not the product desired by the customer” on label 6 is performed, the problem information on label 11 and label 12 is associated with label 2 that is the parent of label 6. . Then, it is assumed that the participant who performed the operation has selected the label 2 without the label 6.

  The change of the tree structure is an operation for changing the connection relationship without adding and deleting the problem information.

  The participant who has performed the change operation obtains the same tree information 120 as when the changed problem information is selected, and the subsequent processing is executed. For example, when the state in which the label 2 and the label 6 are associated is changed to the state in which the label 3 and the label 6 are associated, it is assumed that the label 6 is selected.

  In addition, these operations may be deleted or changed by searching for words as described above. A tree structure is displayed on the screen, and after the problem information is selected, it can be deleted or the problem information can be deleted with the mouse. You can drag and change them using

  Next, an information providing process for determining whether the meeting itself is good or bad will be described.

  First, the pass / fail presentation unit 109 acquires the average depth and the total number of terminal branches for each participant ID and conference ID from the storage unit 106. And the gravity center of participant ID is calculated for every meeting ID based on following Formula.

Formula: (centroid x = (iXa + jXb + kXc) / (i + j + k), centroid y = (iYa + jYb + kYc) / (i + j + k))
Xa, Xb, and Xc are the average number of terminal branches for each participant ID when the X-axis is the number of terminal branches.
Ya, Yb, and Yc are depth average values for each participant ID when the Y-axis is the depth.
i, j, k are weighting variables (in this embodiment, i = j = k = 1)

  The obtained values (circles in FIG. 15), the graph in which the calculated center of gravity (cross in FIG. 15) is plotted on a graph, and the graph in which only the center of gravity is represented as one are presented.

  FIG. 15 is a diagram illustrating a presentation result of the pass / fail presentation unit 102.

  Based on the graph shown in the figure, from the state where the depth of the conference is low and the number of terminal branches is small, the number of terminal branches once increases, then the number of terminal branches decreases and the depth increases. You can see the trend at a glance.

  The curve indicated by a broken line in the figure shows a curve of a favorable transition of the meeting by matching the center of gravity plotted by the pass / fail presentation unit 102.

  The center of gravity shown this time follows the curve, and it can be determined that the transition of the conference is good and the individual conference is also good.

  On the other hand, if there is a meeting that deviates significantly from the curve, it can be determined that the meeting is not good.

  As described above, according to the present invention, the evaluation as a conference participant is quantitatively shown, and the evaluation of the moderator as the facilitator of the conference and the evaluation of the conference itself can be quantitatively shown. Can present effective materials for the selection of moderators. Moreover, since the quality of the conference itself and the temporal transition are also presented, it can be determined whether or not the conference is proceeding properly, and the end time of the conference can be predicted.

  Although the present embodiment has been described based on specific numerical values, the present invention is not limited to these numerical values. For example, the number of participants is three, but the number of participants in the conference is not limited as long as the number is two or more. In addition, the number of times the conference is held is arbitrary.

  Further, the evaluation function is an example, and statistical processing such as calculation of variance can be performed, further detailed analysis can be performed, and a chairperson can be selected or a meeting can be evaluated.

  Further, the problem information selection method has been described as being performed by selecting candidates that have been hit by a search, and the effects thereof have been shown. However, these descriptions are not intended to limit the present invention, and for example, a tree shape is formed for participants. The problem information group 110 arranged in the above may be presented, and the problem information may be selected by clicking the problem information.

  The present invention can be used for a system, a program, and the like provided for conference support.

It is a block diagram which shows the function structure of the meeting assistance system concerning this embodiment. It is the figure which showed the problem information group in the shape of a tree with the relation of problem information. It is a figure which shows the state by which the label was attached | subjected to the problem information group shown by the tree form. It is a figure which shows a label and tree information. It is a flowchart which shows the input reception operation | movement of a problem edit part. It is a figure which shows an input reception screen. It is a figure which shows the state by which tree information etc. were totaled. It is a figure which shows the analyzed information. It is a figure which shows the state by which various evaluation functions are shown. It is a figure which shows the input reception screen at the time of problem information addition. It is a figure which shows the problem information group after problem information addition. It is a figure which shows the change by problem information addition. It is a figure which shows the graph shown for the quality evaluation of a meeting. It is a figure which shows a comprehensive moderator evaluation function calculation state. It is a figure which shows the graph by which the quality of a meeting is represented.

Explanation of symbols

DESCRIPTION OF SYMBOLS 100 Meeting support system 101 Problem edit part 102 Information holding part 103 Labeling process part 104 Selection result total part 105 Selection result analysis part 106 Storage part 107 Selection part 108 Tree difference total part 109 Pass / fail presentation part 110 Problem information group 120 Tree information

Claims (9)

A meeting support system that supports a meeting that analyzes information and examines a solution based on an information group that includes a plurality of unit information and has a tree structure.
Information holding means for holding the information group;
Operation acquisition means for acquiring details of operations related to unit information performed by the participants of the conference on the information group;
Tree information acquisition means for acquiring tree information indicating a positional relationship in the information group of unit information operated by a participant;
Analyzing the acquired tree information for each participant, and selecting means for selecting a suitable participant as a conference host;
A conference support system characterized by comprising: The conference support system according to claim 1, wherein the operation in the operation acquisition unit is an action in which a participant selects any unit information from the information group. The conference support system according to claim 1, wherein the operation in the operation acquisition unit is an action in which a participant adds new unit information to the information group.   The conference support system according to claim 1, wherein the tree information includes a hierarchy in the unit information tree and a number of terminal branches extending downward from the unit information.   The said selection means selects the participant suitable as a moderator of a meeting based on the analysis result for every participant in one meeting, and the analysis result for every participant in the meeting held before the said meeting. 2. The meeting support system according to 2. A meeting support method for supporting a meeting that analyzes information and examines a solution based on an information group including a plurality of unit information and having a tree structure,
An operation acquisition step for acquiring the contents of the operation related to the unit information performed by the participant of the conference for the information group held in the information holding means;
A tree information acquisition step of acquiring tree information indicating a positional relationship in the information group of the unit information operated by the participant;
Analyzing the acquired tree information for each participant, and selecting a participant who is suitable as a conference moderator;
A meeting support method comprising: A conference support program for supporting a conference consisting of a plurality of unit information and analyzing information and considering a solution based on an information group having a tree structure,
An operation acquisition step for acquiring the contents of the operation related to the unit information performed by the participant of the conference for the information group held in the information holding means;
A tree information acquisition step of acquiring tree information indicating a positional relationship in the information group of the unit information operated by the participant;
Analyzing the acquired tree information for each participant, and selecting a participant who is suitable as a conference moderator;
A conference support program for causing a computer to execute. A conference support system that supports a conference that is composed of a plurality of unit information and has a tree structure to analyze information and examine solutions,
Information holding means for holding the information group;
Operation acquisition means for acquiring details of operations related to unit information performed by the participants of the conference on the information group;
Tree information acquisition means for acquiring tree information indicating a positional relationship in the information group of unit information operated by a participant;
A presentation means for analyzing the acquired tree information and presenting information on the quality of the meeting;
A conference support system characterized by comprising:   The conference support system according to claim 8, wherein the presenting unit presents information regarding the quality of the conference based on an analysis result in a single conference and an analysis result in a conference held before the conference.

Images