JPWO2018003100A1 - Search program, search method, and information processing apparatus - Google Patents

Abstract

  The creation support server is generated using a plurality of nodes and a link between each of the plurality of nodes and including information on the directionality determined by the context of the time when the plurality of nodes are registered. Among the plurality of nodes included in the tree diagram, keyword information included in at least two or more specified nodes and link information between at least two specified nodes are accepted as search keys. The creation support server refers to a storage unit that stores a plurality of tree diagrams corresponding to a plurality of agendas, extracts a tree diagram that matches the search key, and outputs it as a similar tree diagram.

Description

  The present invention relates to a search program, a search method, and an information processing apparatus.

  In today's ever-changing society, there is a need to develop products and services that create new value and contribute to society, so creative support systems that support human creativity and ideas are used. For example, as a creation support system, a KJ method for connecting related information from accumulated information is known. In recent years, as a technology that supports the KJ method, multiple participants input their opinions, create an island that is the number of groups created based on the input opinions, and automatically based on the link relationship between the islands Documenting techniques are known.

JP 2002-63286 A JP 2004-185346 A

  However, the above technology is limited to partial creation support, has not reached overall creation support, and is not sufficient for individual creation support. For example, since an idea is thought in the subconscious, an idea that has been presented in the past agenda may be useful information on other agendas. However, even if each opinion of the participant is automatically documented using the above technique, it is difficult to specify which of the past opinions is useful information, and it is difficult to say that the support is sufficient.

  An object of one aspect is to provide a search program, a search method, and an information processing apparatus that can execute useful creation support.

  In the first plan, the search program has a plurality of nodes and links between the nodes of the plurality of nodes in the computer, and the direction determined by the context of the time when the plurality of nodes are registered. Among the plurality of nodes included in the tree diagram generated using the link including sex information, the keyword information included in at least two or more specified nodes and the specified at least two or more nodes A process of accepting link information as a search key is executed. The retrieval program refers to a storage unit that stores a plurality of tree diagrams corresponding to a plurality of agendas on a computer, extracts a tree diagram that matches the search key, and outputs it as a similar tree diagram To execute the process.

  According to one embodiment, useful creation support can be performed.

FIG. 1 is a diagram illustrating an example of the overall configuration of a system according to the first embodiment. FIG. 2 is a schematic diagram illustrating a usage example of the system according to the first embodiment. FIG. 3 is a diagram illustrating a functional configuration example of the creation support server. FIG. 4 is a diagram illustrating an example of information stored in the node link information DB. FIG. 5 is a diagram illustrating an example of information stored in the tree diagram DB. FIG. 6 is a diagram illustrating an example of screen display. FIG. 7 is a diagram illustrating an example of a project registration screen. FIG. 8 is a diagram illustrating an example of generating an information node. FIG. 9 is a diagram for explaining details of the information node. FIG. 10 is a diagram illustrating an example of generation of evaluation nodes. FIG. 11 is a diagram for explaining an evaluation node. FIG. 12 is a diagram for explaining an example of node evaluation calculation. FIG. 13 is a diagram for explaining the evaluation that goes back from the solution to the problem. FIG. 14 is a diagram for evaluating the activity of the entire project. FIG. 15 is a diagram for explaining the activity of an individual task. FIG. 16 is a flowchart showing the overall processing flow. FIG. 17 is a flowchart showing the flow of the evaluation calculation process. FIG. 18 is a schematic diagram illustrating an example of a functional configuration of a creation support server according to the second embodiment. FIG. 19 is a diagram illustrating an example of a screen display. FIG. 20 is a diagram for explaining a search result of a similar tree diagram. FIG. 21 is a diagram illustrating highlighting of nodes in a tree diagram. FIG. 22 is a diagram for explaining element analysis. FIG. 23 is a diagram for explaining project search. FIG. 24 is a flowchart showing the flow of a similar tree diagram search process. FIG. 25 is a diagram illustrating a hardware configuration example.

  Embodiments of a search program, a search method, and an information processing apparatus according to the present invention will be described below in detail with reference to the drawings. Note that the present invention is not limited to the embodiments. In addition, the embodiments can be appropriately combined within a consistent range.

[overall structure]
FIG. 1 is a diagram illustrating an example of the overall configuration of a system according to the first embodiment. As shown in FIG. 1, this system is a creation support system in which a plurality of users give opinions on various issues and derive solutions, and includes a plurality of user terminals 1 and a creation support server 10.

  In the present embodiment, the creation support server 10 is present on the cloud system, and each user terminal 1 accesses the creation support server 10 via a network such as the Internet to use the system. It is not limited. For example, a plurality of user terminals 1 and the creation support server 10 may be connected via a LAN (Local Area Network), and the system configuration can be arbitrarily changed.

  Each user terminal 1 is a terminal used by each user, and is a terminal such as a personal computer, a mobile phone, or a smartphone. Each user terminal 1 accesses the creation support server 10 and performs a discussion for deriving a solution in a group. The creation support server 10 is an example of an evaluation device. The creation support server 10 provides a forum for discussion to a group including a plurality of user terminals 1, and visualizes the discussion by making opinions and the like created by each user into nodes.

  Here, the visualization of the discussion will be described with reference to FIG. FIG. 2 is a schematic diagram illustrating a usage example of the system according to the first embodiment. As shown in FIG. 2, the user terminal 1 logs in to the creation support system and displays an input screen of the creation support system on the desktop. A user belongs to a project and performs a normal business, and performs various activities related to the business such as browsing emails, replying to emails, and searching for information on the Web.

  When the user terminal 1 finds useful information for a task of a group to which the user terminal 1 belongs while browsing the Web, the user terminal 1 records the information in association with the task. For example, as illustrated in FIG. 2, the user terminal 1 records information browsed on the Web in an “node” as an opinion or a proposal. In recording, the user terminal 1 connects with a “link” in order to associate with a task or previously recorded information. In this way, the project members sequentially collect information and construct a tree diagram (structure, directed acyclic graph). In the following, description of nodes may be simplified using time stamps and user names. For example, a node with a time stamp of 5 may be described as node 5 or a node generated by user A as node A.

  Then, the creation support server 10 includes a plurality of nodes and links between the nodes of the plurality of nodes, the links including information on the directionality determined by the context of the time when the plurality of nodes are registered. Among the plurality of nodes included in the generated tree diagram, keyword information included in at least two specified nodes and link information between at least two specified nodes are accepted as search keys. . Subsequently, the creation support server 10 refers to a storage unit that stores a plurality of tree diagrams corresponding to a plurality of agendas, extracts a tree diagram that matches the search key, and creates a similar tree diagram. Output. As a result, the creation support server 10 can execute useful creation support.

[Function configuration]
FIG. 3 is a diagram illustrating a functional configuration example of the creation support server 10. As illustrated in FIG. 3, the creation support server 10 includes a communication unit 11, a storage unit 12, and a control unit 20.

  The communication unit 11 is a processing unit that controls communication with each user terminal 1 regardless of wired or wireless. For example, the communication unit 11 receives input of a node and a link, which will be described later, from each user terminal 1 and transmits various messages for creation support to each user terminal 1.

  The storage unit 12 is a storage device that stores a program executed by the control unit 20, data used when executing various processes, and the like, for example, a hard disk or a memory. The storage unit 12 includes a node link information DB 13, a tree diagram DB 14, and an evaluation value DB 15.

  The node link information DB 13 is a database that stores information related to nodes and links constituting the tree diagram. Specifically, the node link information DB 13 stores a score indicating the degree of contribution to the user who inputs each node or link in association with the node or link that can be input to the tree diagram.

  FIG. 4 is a diagram illustrating an example of information stored in the node link information DB 13. As illustrated in FIG. 4, the node link information DB 13 stores “item, major category, middle category, minor category, score” in association with each other as information about the node. The “term” stored here is an identifier for identifying information, “major category, medium category, minor category” indicates the classification of the node created and created, and “score” indicates the node. Indicates the contribution of the user created and created. Nodes other than “issues” and “solutions” are classified into three elements “intelligence”, “emotion”, and “behavior” that are necessary elements for innovation.

  In the case of FIG. 4, explaining “issues” and “solutions” corresponding to “major classification”, it is shown that a score “4 points” is given to the user who generated the node “issue” for setting the discussion issues , It shows that the score “4 points” is given to the user who created the node “solution” for the task. It also indicates that a score “4 points” is given to a user who has generated a node corresponding to a large classification “intelligence”, a middle classification “idea”, and a small classification “suggestion”. It also indicates that a score of “1 point” is given to a user who has generated a node corresponding to the major classification “intelligence”, middle classification “judgment”, and minor classification “evaluation”.

  Further, the node link information DB 13 stores “term, major classification, middle classification, minor classification, coefficient” in association with each other as link information for associating the nodes with each other. The “term” stored here is an identifier for identifying information, “major classification, medium classification, small classification” indicates the classification of links between nodes, and “coefficient” indicates that the lower node is higher than the upper node. The degree of influence received, in other words, the propagation coefficient that is the degree of influence from the lower node to the upper node is shown.

  Further, in the case of FIG. 4, the large classification “evaluation” means the small classification “connected to the node that gave the evaluation to the upper node”, and indicates that the coefficient is “0.9”. Similarly, the large classification “impact” indicates that the effect on the upper node is “impact, integration, separation”, and the coefficient is “0” when the nodes are connected by the “impact” link. .5 ".

  A specific example of each link is explained. The link “evaluation” indicates a link connected to the node that has an influence on the upper node, and the link “impact” indicates this node that is affected by another node. Indicates that it was created. The link “separation” indicates that the problem that was one was specified in detail and the separation was performed, and the link “integration” indicates that the two were discussed in parallel but can be integrated into one actually . The link “replacement, generalization, and specialization” indicates a node in which another node is replaced or a generalized node, and the link “connection” is used when providing further detailed information.

  The tree diagram DB 14 is a database that stores tree diagrams generated using nodes and links. Specifically, the tree diagram DB 14 stores a tree diagram visualizing the discussion. FIG. 5 is a diagram illustrating an example of information stored in the tree diagram DB 14. As illustrated in FIG. 5, the tree diagram DB 14 stores the results discussed for the node “task 1” generated by the user A.

  As shown in FIG. 5, each node displays “major category> medium category> minor category, content, score, evaluation score”. Here, “major category> medium category> minor category” is the category described with reference to FIG. 4, and “content” is information registered in the node, for example, information set in a keyword described later. “Score” is a score added by node classification, and corresponds to “score” in FIG. The “evaluation point” is an evaluation point from a lower node, and is calculated based on the degree of influence received by the lower node noded with the node and the link.

  For example, the node “task 1” has the content “health promotion by eating, eating out, calories”, the score is “4 points”, and the evaluation score is “0 points”. The node “intelligence> knowledge> opinion” connected to the node “task 1” with a link is the content “calories, recording, recording diet”, the score is “2 points”, and the evaluation score is “0 points”. It is. At this time, the node “task 1” is an upper node of the node “intellect> knowledge> opinion”, and the node “intellect> knowledge> opinion” is a lower node of the node “task 1”. In this embodiment, the description of the node “intelligence> knowledge> opinion” is simplified by simply displaying only a small classification like the node “opinion”.

  The classified nodes will be described. For example, the node “information” indicates information generated for a task or another node, and is classified into a large classification “intelligence” and a middle classification “knowledge”. The node “suggestion” indicates the content proposed for the task and other nodes, and is classified into a major classification “intelligence” and a middle classification “idea”. The node “agree” indicates that the proposal is agreed, and the node “opposite” indicates that the proposal is opposed, and each of them is classified into the large classification “intelligence” and the middle classification “judgment”. Similarly, the node “evaluation” indicates that the proposal has been evaluated, and is classified into the major classification “intelligence” and the middle classification “judgment”. The node “solution” indicates a solution to the problem.

  A link is indicated by an arrow between nodes. For example, the link between the node “opinion” and the node “issue 1” indicates that the node “opinion” is generated under the influence of the node “issue 1”. For example, the link “impact” indicates that the node is affected by a certain node. In the case of FIG. 5, the node “suggestion” generated by the user A affects the node “suggestion” generated by the user E. It shows that it was received (see (a) of FIG. 5).

  Here, each node includes “node number, node creator, user classification, project name, title, node classification, text, file, keyword, disclosure level, total score, node score, lower evaluation, higher evaluation, process , Solution Route, Silence Level (Overall), Silence Level (Issue), Divergence Node, Convergence Node, etc. "are registered at the time of creation. For example, “node number” is a number assigned to all nodes, and is automatically and sequentially assigned when a node is created. “User classification” distinguishes between individual issues and project issues. The “project name” is determined when setting a project or when an individual assignment is set. Nodes connected to the same project are given the same project name, and nodes connected to the same individual assignment also have the same assignment name. Is set.

  “Title” describes the title of the node. “Node classification” is selected from the pull-down menu as major classification, middle classification, and minor classification for the necessary elements of innovation. “Body” is a record in the body text of the node to be registered, and is input by manual input, pasting from PDF (Portable Document Format) data, or pasting from image data. “File” is information that can trace the original text, such as the original file address of the data pasted in the text, the URL (Uniform Resource Locator) address of the Web, and the like. “Keyword” is a keyword in the text, and a plurality of keywords can be registered. “Public level” is information for specifying the public range of a node, and can be set to secret (L1), specific person only (L2), up to project (L3), in-house (L4), and the like.

  The “total score” is a total score of this node, and in this embodiment, a node evaluation score is indicated. The “node score” is a score determined by node classification. “Lower evaluation” is the sum of evaluation scores from the lower rank, and “Higher evaluation” is an evaluation coefficient indicating the degree of influence on the upper node. This evaluation coefficient is set to “+1” when the small classification is in favor, “−1” when it is opposite, “0” when it is on hold, “1” when it is adopted, and “−” in the case of evaluation. It is manually set in the range of “4 to +4”. In the case of a classification corresponding to the user's intention such as appreciation or praise, it is manually set in the range of “+1 to +4”.

  “Process” indicates a current process in the project, and when connected to a node, the connection destination node takes over, but a new process is set when the process is changed. A “solution root” is a node associated with a solution. The “silence level (overall)” is the silence level of the present node as viewed in the entire project, and the “silence level (issue)” is the silence level of the present node as viewed in task units. Note that the silence level refers to the time, the rate, and the like from when this node is registered until a new node is generated for this node. The “divergent node” is a divergence degree of the present node when viewed in units of tasks, for example, the number of nodes branched from the present node. The “convergence node” is the degree of convergence of this node when viewed in units of tasks, for example, the number of links converged by this node. In “Others”, information that can be automatically acquired is registered, such as time stamp, position information, schedule link, vital information at the time of node registration, and emotion information at the time of node registration.

  In addition, “link number, connection source node, connection destination node, link creator, user classification, link classification, propagation coefficient” are registered in each link. Here, the “link number” is a number assigned to all links, and is automatically and sequentially assigned when the links are created. The “connection source node” is the number of the node serving as the departure point, and the “connection destination node” is the node number of the other party connected from the departure point. In this embodiment, the connection source node is a lower node and the connection destination node is an upper node. The “link creator” records the member who created the link. “User classification” is information for distinguishing between an individual problem and a project problem. “Link classification” is a classification of a link, and is selected from a pull-down menu as a major classification or a minor classification. “Propagation coefficient” is a coefficient determined by link classification.

  Returning to FIG. 3, the evaluation value DB 15 is a database that stores evaluation values for each user. For example, the evaluation value DB 15 stores an evaluation score of each node generated by the user for each user. Further, the evaluation value DB 15 stores evaluation points of nodes generated by each user for each task or project.

  The control unit 20 is a processing unit that controls the creation support server 10 as a whole, and is, for example, a processor. The control unit 20 includes a display control unit 21, a structuring unit 30, and a contribution determination unit 40. The display control unit 21, the structuring unit 30, and the contribution determination unit 40 are an example of an electronic circuit included in the processor and an example of a process executed by the processor.

  The display control unit 21 is a processing unit that displays the top screen of the creation support application when receiving a project or personal assignment generation instruction. In addition, the display control unit 21 performs a general login process for the user, and performs subsequent processes for the user who is permitted to log in. Specifically, the display control unit 21 displays the top screen shown in FIG. 6 on the user terminal 1 of the user who is permitted to log in, receives various operations on the screen, and displays the screen according to the received operation content. Transition.

  FIG. 6 is a diagram illustrating an example of screen display. The top screen shown in FIG. 6 has areas for home, registration, display, tool, search, and notification. In the home area, a “Project List” button that displays a project list, a “Personal Task List” button that displays a list of individual issues, and “Entire Display Selection (Project / Personal)” that displays all registered tree diagrams. Contains each button button. In the registration area, “profile registration” for registering a user profile, “project registration” for generating a new project, “individual representative task registration” for generating a new individual task, and various node preset information “ Each button of “Config” is included. The display area includes buttons for “project element” for displaying elements such as a tree diagram of the project, project nodes and links, and “person image” for searching for a person image for each user. Here, the person includes a user who is good at generating ideas (nodes) and a user who breaks the silence that generates a node during silence. The tool area is an area for displaying a tree diagram of a work target such as a retrieved tree diagram or a tree diagram of a node registration target. The search area is an area for specifying a search condition, and is an area for inputting a search range, a search keyword, and the like. In the notification area, various notification information is displayed from the system, such as node generation and advice.

  Returning to FIG. 3, the structuring unit 30 is a processing unit that accepts generation of nodes and links and structures the discussion. That is, the structuring unit 30 visualizes the discussion by generating a tree diagram. The structuring unit 30 includes a registration unit 31, a reception unit 32, and a generation unit 33.

  The registration unit 31 is a processing unit that executes new registration and correction of projects and personal tasks. Specifically, the registration unit 31 displays a new registration / correction screen when a “profile registration” button is pressed on the top screen displayed by the display control unit 21, and performs new registration or correction. Accept.

  Here, the registration of a project will be described as an example. FIG. 7 is a diagram illustrating an example of a project registration screen. The project registration screen shown in FIG. 7 has items such as a project, an outline, a keyword, a purpose, and a vision. When the registration unit 31 receives input of each information on the screen shown in FIG. 7 and detects the pressing of the “registration” button, the registration unit 31 generates a new project. Note that the registered user can arbitrarily set the project, the outline, and the keyword, and the purpose and vision can be selected by preparing a selection item in advance and using a radio button or the like.

  The receiving unit 32 is a processing unit that receives nodes and links from the user terminal 1. For example, the reception unit 32 generates generation instructions and links for various nodes such as “issue”, “suggestion”, and “agree” on a creation system screen corresponding to a task selected from a plurality of issues and projects. Accept instructions. And the reception part 32 will request | require the production | generation process of a node and a link with respect to the production | generation part 33, if a production | generation instruction | indication is received.

  The generation unit 33 is a processing unit that generates nodes and links in accordance with node and link generation instructions received by the reception unit 22, executes discussion structuring, and generates a tree diagram. Specifically, the generation unit 33 displays “type”, “major classification”, and the like stored in the node link information DB 13 of FIG. 4 on the screen of the creation system displayed on the user terminal 1, The node information to be generated is received from the user. Then, the generation unit 33 generates a “node” corresponding to the received information.

  Further, when the “node” is generated, the generation unit 33 displays the “type” of the link stored in the node link information DB 13 of FIG. In addition, the production | generation part 33 sets the accepted link between nodes, when the selection from a user is received. Moreover, the production | generation part 33 does not set a link between nodes, when the selection from a user is not received. Each node is given a time stamp indicating the generated date and time. Since the node is given a time stamp, each node can be managed uniquely. For example, it is possible to manage by assigning node numbers in the registered order.

  Here, a specific example of node generation will be described. FIG. 8 is a diagram illustrating an example of generating an information node. FIG. 8 illustrates an example in which a word found by a user in a PDF file or the like is copied to a node by drag and drop. FIG. 8 shows a state in which a node K, which is an information node connected by a link X, is generated for a task node J “example using AR” for a project of “new terminal development using AR”. In this state, the generation unit 33 selects the wording “the function of the new AR terminal is XXX” included in the PDF file extracted from the article on the Web, and drags the wording on the generation screen. A node K having the text as a body is generated.

  Detailed information on the node can be entered at this stage, but can also be entered later when time is available. Examples of detailed information to be entered here are keywords and node classification. Examples of information that is automatically acquired include time stamps and position information. These pieces of information are used for node search, evaluation, and presentation of awareness information from the system. In other words, it is possible to provide effective information to the user by accumulating and analyzing these pieces of information. In addition, when the generation unit 33 receives a click on the node K and the node J, the generation unit 33 connects the nodes with the link X. In this way, nodes are generated as needed.

  Next, registration of node classification will be described. FIG. 9 is a diagram for explaining details of the information node. The information node shown in FIG. 9 is a node corresponding to the node “information”. As illustrated in FIG. 9, the generation unit 33 displays a large classification of “intellect, emotion, and action” and accepts selection of a generation target node from a pull-down menu corresponding to each classification. In the example of FIG. 9, an example in which the minor category “information” of the middle category “knowledge” of the major category “intelligence” is selected is illustrated.

  Subsequently, the generation unit 33 receives an input of “AR, terminal” as a keyword corresponding to this node. The information copied in FIG. 8 is registered in the text of this node. Further, the generation unit 33 specifies the score “2 points” corresponding to the small classification “information” of the node from the node link information DB 13 of FIG. 4 and sets the node in the node. In this way, the generation unit 33 receives the input of the node “information” and generates a node. Note that items other than those described here can be input by the user when a node is generated, or can be selected from a pull-down menu or the like.

  Next, the evaluation node will be described. FIG. 10 is a diagram illustrating an example of generation of evaluation nodes. FIG. 10 illustrates an example of generating a node M that gives an evaluation for the node K from the state of FIG. For example, when the user B evaluates the node K registered by the user A, the generation unit 33 receives an operation similar to the node registration from the user B. When the evaluation is performed, “Evaluation” is selected in the node evaluation classification, and the node M is registered. By doing so, the node evaluation point of the user A is added by the evaluation of the user B. The node evaluation score will be higher if the evaluation is received from many members. That is, the remark of the user A with a high node evaluation score is recognized as a good remark by the member.

  Subsequently, a specific example of the evaluation node will be described. FIG. 11 is a diagram for explaining an evaluation node. The evaluation node illustrated in FIG. 11 is a node corresponding to the node “evaluation”. As illustrated in FIG. 11, the generation unit 33 displays a large classification of “intellect, emotion, and action” and accepts selection of a generation target node from a pull-down menu corresponding to each classification. In the example of FIG. 11, an example in which “4 points” of the minor classification “evaluation” of the middle classification “judgment” of the major classification “intelligence” is selected is illustrated. The score of evaluation here can be manually set in the range of “−4 to +4”. Note that the evaluation score in the node is a total evaluation score including evaluation scores from others for this node.

  Subsequently, the generation unit 33 accepts the evaluation content “very valuable information” set in this node. Further, the generation unit 33 specifies the score “1 point” corresponding to the small classification “evaluation” of the node from the node link information DB 13 of FIG. 4 and sets it to the node. In this way, the generation unit 33 receives the input of the node “evaluation” and generates a node.

  Next, link generation will be described with reference to FIG. It is assumed that the generation unit 33 generates a node L “information” for the node K “information” of the user A in accordance with an instruction from the user C. Then, the generation unit 33 displays a menu or the like for selecting “major classification” and “minor classification” of “link” in the vicinity of the generated node L “information”. Then, when “influence” of “small classification” is selected, the generation unit 33 gives a coefficient “0.5” to the generated link. In this way, the generation unit 33 receives an input of “link” between nodes and generates a link.

  As described above, the generation unit 33 generates a tree diagram by executing node generation and link generation on the generation screen in response to a user operation. Although registration from PDF data has been described as an example, various data such as text data of Web mail, data displayed on the Web, and image data can also be registered as node information.

  Returning to FIG. 3, the contribution determination unit 40 includes an evaluation calculation unit 41 and an activity evaluation unit 42, and is a processing unit that executes evaluation of each node constituting the tree diagram.

  The evaluation calculation unit 41 is a processing unit that calculates an evaluation score of each node constituting the tree diagram. Specifically, each time a new node is generated for a certain tree diagram, the evaluation calculation unit 41 updates the node evaluation score of each node positioned higher than the new node. Further, when a solution is determined, the evaluation calculation unit 41 adds a score of + α for each node from the node “issue” to the node “solution”.

  Here, a calculation example of the node evaluation score will be described. FIG. 12 is a diagram for explaining an example of node evaluation calculation. FIG. 12 is an example in which a new node N (k) is generated for the node N (j). The node N (k) may be an evaluation node or another node classification. . The node evaluation point S (j) of the node N (j) is calculated by Expression (1) using the score Nb (j) based on the node classification and the score Vd (j) based on the lower evaluation.

  Here, the score Nb (j) in the expression (1) is a score based on the node classification, and is a score associated with the small classification set in the node, and is determined by the node link information DB 13 shown in FIG. . For example, when the node N (j) is the node “devise”, the score Nb (j) is “2”.

  In addition, “Σ (s (k) * α (k) * β (k, j))” in Expression (1) is a lower evaluation (Vd (j)) that is an evaluation from a lower node. That is, Vd (j) is an evaluation point from the lower node N (k), and is a sum of evaluation points for N (j) from all lower nodes connected to the node N (j). s (k) is an evaluation score of the node N (k), and is calculated using an evaluation score of a lower node of the node N (k).

  α (k) is an evaluation coefficient for the upper node N (j). For example, when N (k) is the approval node, the evaluation coefficient α (k) is +1, and when N (k) is the opposite node, the evaluation coefficient α (k) is −1 and N (k) is the evaluation node. The evaluation coefficient α (k) is an arbitrary value between -4 and +4. If N (k) is a thank-you node, the evaluation coefficient α (k) is an arbitrary value between +1 and +4. When the value N (k) is a node other than the above, the evaluation coefficient α (k) is +1.

  β (k, j) is a propagation coefficient from the node N (k) to the node N (j), and is determined by the link type L (k, j). The link type L (k, j) is a major classification of links shown in FIG. For example, when the link type L (k, j) is evaluated, the propagation coefficient β (k, j) is 0.9, and when the link type L (k, j) is affected or replaced, the propagation coefficient β (K, j) is 0.5, and when the link type L (k, j) is connected, the propagation coefficient β (k, j) is 0.1.

  As described above, the evaluation calculation unit 41 determines, for each node, the evaluation score from the lower node “Σ (node evaluation point (S (k))) * evaluation coefficient (α (k) determined by the evaluation from the lower node”. ) * Propagation coefficient determined by link with lower node (β (k, j))) ”. And the evaluation calculation part 41 calculates the score which added the evaluation score from a low-order node to the score by node classification as an evaluation score of a node, and gives it to the said node as an evaluation score. In other words, the evaluation score of each node is updated under the influence of the lower nodes, so that each time a new node is generated, the evaluation score of each node is recursively updated.

  Note that information is accumulated by structuring using nodes and links. However, regarding the connection and separation, if the node cannot confirm the approval, the information is not propagated to the upper node. For example, when two nodes are integrated, the propagation coefficient to the upper node is set to 0.5. However, if the evaluation of the join node itself is negative, or if the evaluation is negative or the evaluation is negative and the total is negative, the join node is treated as an unsupported join node, and the higher node is reached. The propagation coefficient of is assumed to be zero. Similarly, the same idea as that of the joining node is applied to the separation node when separated. In other words, when the separation coefficient is set to 0.5 as the propagation coefficient to the upper node, but the evaluation to the separation node itself is negative, the separation node is treated as an unsupported separation node, The propagation coefficient to the upper node is zero.

  Next, from the viewpoint of the degree of contribution in the project, an example will be described in which the node updated to the problem solution is identified from the solution to the problem. The creation support server 10 evaluates the node again by the participating members of the project when the problem of the project is solved. This is because ideas and opinions that were not regarded as important in the problem-solving process are again evaluated from the perspective of the whole. Therefore, the evaluation calculation unit 41 goes back from the solution toward the problem, and makes the evaluation of the node that contributed to the solution among the nodes registered in large numbers by making the nodes on the route highly evaluated.

  FIG. 13 is a diagram for explaining the evaluation that goes back from the solution to the problem. The tree diagram in FIG. 13 is a diagram visualizing the discussion on the task node N3, and the problem is solved by the solution node N13. As illustrated in FIG. 13, the evaluation calculation unit 41 detects, as a contributing node, a node that can be traced back by one link in the process of tracing from the solution node N13 to the task node N3. Then, the evaluation calculation unit 41 increases the evaluation score of the detected contributing node. For example, the evaluation calculation unit 41 can increase the evaluation score by any method such as multiplying the evaluation score calculated for the contribution node by 1.2.

  In the example of FIG. 13, the evaluation calculation unit 41 detects the nodes N13, N9, N5, and N3 on the route from the solution node N13 to the task node N3 as high evaluation (contribution) nodes. Further, the evaluation calculation unit 41 detects the node N18 connected with one link from the node N9, detects the node N10, the node N6, and the node N14 connected with the node N5 with one link, and the node N3 The node N1, the node N4, and the node N8 connected by one link are detected.

  By doing so, it is possible to identify high-value nodes for project issues. In other words, there is a value at the time of node registration for problem solving, a value at the time of receiving evaluation from others, a value at the time when nodes are connected one after another, and a value at the time of project problem solving To do. In this way, the nodes in the project are evaluated in real time. As a result, it can be understood which node contributed to the problem solution. Moreover, as a person's evaluation, it is possible to identify a person who has a high degree of contribution to a project or an individual problem. Note that the above processing can be performed for each node identified retroactively from a newly generated node to the problem node, not limited to the problem route from the solution.

  Returning to FIG. 3, the activity evaluation unit 42 is a processing unit that evaluates the activity of the entire project or individual tasks. Specifically, the activity level evaluation unit 42 evaluates a node whose activity level has been improved on a project basis or an individual task basis in order to stimulate discussion of projects and issues and lead to good conclusions.

  FIG. 14 is a diagram for evaluating the activity of the entire project. For example, if the node registration status in the project Pj shown in the left diagram of FIG. 14 is Nt (j) as the registration time of N (j), Pj = {N1, N2, N3... N18}. If the activity level at the node N (m) is AN (m), it can be calculated as AN (m) = T / {Nt (m) −Nt (m−1)}. Here, m is 1 to 18 in the case of FIG.

  For example, as shown in the right diagram of FIG. 14, the activity evaluation unit 42 determines that AN (m) <M at node N (m), node N (m + 1), node N (m + 2), and node N (m + 3). , AN (m + 1)> M, AN (m + 2)> M, and AN (m + 3)> M, when the threshold (M) is exceeded three times in succession, the immediately preceding node N (m) is activated It is evaluated as the node that created the opportunity for conversion. The evaluation method can be arbitrarily set, for example, by multiplying the evaluation score by 1.2. Further, the threshold value and the number of times can be arbitrarily set. In addition, the horizontal axis of the right figure of FIG. 14 is time (t), and a vertical axis | shaft is activity (A).

  Moreover, the activity evaluation part 42 can evaluate activity with respect to each task, when two tasks are set to the project Pj. FIG. 15 is a diagram for explaining the activity of an individual task. In FIG. 15, the node N (3) and the node N (5) are task nodes. Here, group Ki = {N4, N7, N8, N11, N12, N16} and group Kj = {N6, N9, N10, N13, N14, N15, N17, N18} are grouped as a group for the task. Then, the activity evaluation unit 42 sets AN (m) = T / {Nt (m) −Nt (l)}, where the activity at the node N (m) is AN (m), and is the same as in the project. Each node is evaluated. Here, the node N (l) and the node N (m) are nodes belonging to the group Ki, and the node N (m) is a node connected next to the node N (l). For example, the activity evaluation unit 42 determines that AN (7) = T / {(Nt (7) −Nt (4))}, AN (7) <M, AN (8)> M, AN (11)> M , AN (12)> M, node N (7) is evaluated as the node that created the trigger for activation.

  As described above, the activity level of the node and the activity level of the node for each task as seen in the entire project are indices indicating individual contributions to the project task. For example, when node registration is stagnant, an information node registered by a person is evaluated as a node that breaks the silence of the project. These evaluation values are updated each time a new node is registered.

  In addition to the above-described evaluation, the evaluation calculation unit 41 is a node that has been registered after a predetermined first period has elapsed since the previous node was registered. If the number of nodes directly or indirectly linked to the node becomes equal to or greater than a predetermined number before the second period elapses, the evaluation value of the node can be changed to a higher evaluation. That is, the evaluation calculation unit 41 can increase the evaluation of a node that has been an opportunity to increase the activity level in a project in which the activity level has decreased.

[Overall process flow]
FIG. 16 is a flowchart showing the overall processing flow. As illustrated in FIG. 16, when the receiving unit 32 of the creation support server 10 receives a node input of a task (S101: Yes), the generating unit 33 generates a node “task” (S102) and displays a tree diagram. Generate (S103). The tree diagram and nodes are stored in the tree diagram DB 14.

  Thereafter, when the receiving unit 32 detects an input of a node or a link (S104: Yes), the generation unit 33 generates a node or a link according to the detected content (S105), and updates the tree diagram (S106). ). Then, triggered by the generation of a new node, the contribution determination unit 40 executes an evaluation calculation process in consideration of the score, the lower evaluation, the influence, and the like, and re-evaluates each node of the tree diagram (S107).

  Then, S104 and subsequent steps are repeated until the node “solution” is detected (S108: No). When the node “solution” is detected (S108: Yes), the contribution determination unit 40 identifies the node from the solution to the problem (S109), and updates the evaluation of the node (S110).

[Flow of evaluation calculation process]
FIG. 17 is a flowchart showing the flow of the evaluation calculation process. As shown in FIG. 17, when a node and a link are generated (S201), the evaluation calculation unit 41 specifies a score (Nb (k)) from the node classification and calculates a node evaluation score (S (k)). (S202). Subsequently, the evaluation calculation unit 41 specifies the higher evaluation (α (k)) from the evaluation content (S203). Then, the evaluation calculation unit 41 identifies the propagation coefficient (β (k, j)) from the generated link type (S204).

  After that, the evaluation calculation unit 41 identifies the higher node of the generated node (S205), the node evaluation point (s (k)) of the lower node, the higher evaluation (α (k), and the propagation coefficient (β (k, j)) and the lower evaluation are calculated (S206), and the node evaluation score of the upper node is updated (S207).

  Further, when there is an upper node higher than the node being processed (evaluation update target) (S208: Yes), the evaluation calculation unit 41 executes S206 and subsequent steps on the higher upper node. On the other hand, the evaluation calculation unit 41 ends the process when there is no higher-order node higher than the node being processed (evaluation update target) (S208: No).

[effect]
As described above, the creation support server 10 can evaluate the degree of contribution of each node using the evaluation from the lower nodes, and thus can identify the node that contributed to the problem solving. Moreover, since the creation support server 10 recursively evaluates each node every time a node is generated, the contribution degree of each node can be calculated in real time. Moreover, since the creation support server 10 increases the evaluation of the nodes on the route from the solution to the problem when the argument is solved, the real-time node evaluation and the node evaluation directly connected to the problem solution can be executed in parallel. Node evaluation from the viewpoint of Moreover, since the creation support server 10 can increase the evaluation of the node that increases the activity, it is possible to promote the activation of the discussion.

  The creation support server 10 can also provide input support to the user. For example, the creation support server 10 provides the user with creation support by automatically displaying a tree diagram of other projects and other tasks including nodes similar to the node generated by the user. Therefore, in the second embodiment, an example in which similar tree diagrams are automatically or manually searched and displayed to the user will be described. A similar tree diagram may be referred to as a similar tree diagram.

[Function configuration]
FIG. 18 is a schematic diagram illustrating an example of the functional configuration of the creation support server 10 according to the second embodiment. As illustrated in FIG. 18, the creation support server 10 includes a communication unit 11, a storage unit 12, and a control unit 20, as in the first embodiment. In addition, the same code | symbol as Example 1 is provided to the process part and memory | storage part which have the same function as Example 1. FIG. Here, the search part 50 which has a function different from Example 1 is demonstrated. The search unit 50 is an example of an output unit.

  The search unit 50 is a processing unit that searches and displays tree diagrams of other projects and other tasks including nodes and links generated by the user. Specifically, the search unit 50 searches the tree diagram DB 14 for tree diagrams of other projects and other tasks including nodes and links generated by the user. The search unit 50 displays the searched similar tree diagram side by side with the tree diagram being processed in the tool area shown in FIG. 6, together with a message such as a tree diagram that can be used as a reference. By displaying the screen, the creation support is executed to the user.

  For example, the search unit 50 searches for and displays a similar tree diagram having as a constituent element a node in which a keyword input by the user as a search keyword is registered in the search area of the screen shown in FIG. For example, when the user inputs “AR terminal”, the search unit 50 displays a similar tree diagram including a node having “AR terminal” registered as a keyword as a constituent element.

  In addition, when the user generates a node, the search unit 50 extracts a keyword and a text registered in the generated node. Subsequently, the search unit 50 searches for a node in which a character string included in the extracted keyword or text is registered in the keyword or text. Then, the search unit 50 displays a similar tree diagram having the searched nodes as components.

  Further, the search unit 50 accepts selection of a plurality of nodes from the user on the screen on which the tree diagram being processed is displayed. Then, the search unit 50 searches for nodes including character strings and the like registered in the selected plurality of nodes, and displays a similar tree diagram having the searched nodes as constituent elements. For example, it is assumed that the node N and the node N + 1 are selected, the character string “AAA” is registered as a keyword in the node N, and the character string “BBB” is registered as a keyword in the node N + 1. In this case, the search unit 50 displays a similar tree diagram that includes nodes in which both the character strings “AAA” and “BBB” are registered as keywords. As another example, the search unit 50 displays a similar tree diagram including a node in which one of the character strings “AAA” and “BBB” is registered as a keyword.

  Moreover, the search part 50 can also use the link between the selected nodes and node classification as a search keyword, when selection of the some node from a user is received. For example, when the search unit 50 specifies “proposition” and “information” as the node classification of each selected node and specifies “influence” as the link classification between the nodes, the node “proposition” and the node “information” A tree diagram including a configuration in which and are connected by a link “effect” is retrieved and displayed. Further, as a condition for narrowing down, a keyword included in each node can be used as a search condition. Moreover, when using a link as a search condition, not only a large classification but a small classification may be used.

  Furthermore, various evaluations can be used as conditions for further narrowing down the search results described above. For example, the search unit 50 determines that the node evaluation score (S (j)) is a predetermined score or higher, the lower evaluation (Vd (j)) is a predetermined score or higher, and the higher evaluation (α (k)) from the lower node is a threshold value. It is possible to narrow down and display the above nodes. For example, the search unit 50 displays a similar tree diagram having nodes having a predetermined score or more among the searched nodes as constituent elements. In addition, the search unit 50 displays a similar tree diagram including, as constituent elements, nodes having a higher evaluation (α (k)) set to a lower node of the searched node among the searched nodes. .

  In addition, the search unit 50 includes nodes having a low evaluation in which the node evaluation point (S (j)), the lower evaluation (Vd (j)), and the higher evaluation (α (k)) from the lower node are less than the threshold. It is possible to alert the user by displaying a similar tree diagram. The search unit 50 can also alert the user by displaying a low-activity tree diagram that has passed a predetermined time since the latest node generation. That is, the search part 50 can suppress the stagnation of the utterance by the same mistake or an inadvertent opinion by selecting and darely displaying the dendrogram which resulted in the bad result from the past creation situation.

  Note that various thresholds such as the predetermined score can be arbitrarily selected by the user, and can be arbitrarily set automatically by the search unit 50. In addition, the various search conditions described above can be used individually as search conditions, and a plurality of search conditions can be combined within a consistent range. The search condition is not limited to the nodes generated by the searching user and the tree diagram of the project in which the user is participating, but can also be a tree diagram of other user nodes and non-participating projects. .

  For example, when a new node is generated, the search unit 50 generates a keyword for the generated node, a keyword for an upper node or a lower node of the node, and link information (for example, type or the like) between the node and the upper node. ) Is detected. And the search part 50 can also display the tree diagram containing the node connected by link information among the nodes containing each keyword as a similar tree diagram. In this way, the search trigger can be arbitrarily set, for example, when a new node is generated, and the search can be automatically performed without a keyword specified by the user.

  Further, when a new node is generated, the search unit 50 extracts a keyword of the generated node, and displays a tree diagram including a node in which an opposite word of the extracted keyword is set as a similar tree diagram You can also In this way, an opportunity to give a new idea is provided in consideration of the fact that even if it has nothing to do with it, it can be an opportunity for a user's idea.

[Screen display example]
Next, an example of screen display will be described with reference to FIGS. FIG. 19 is a diagram illustrating an example of a screen display. As shown in FIG. 19, the display control unit 21 displays a tree diagram selected from the project list or the personal assignment list in the tool area. For example, the display control unit 21 displays a plurality of buttons for executing various operations in this tool area. For example, the display control unit 21 displays a “task list” button that highlights the displayed tree diagram tasks, a “task / solution display” button that highlights the tasks and solutions, and each node of the tree diagram. "Personal / date" button that displays the date generated for the node, the node creator, etc., a "node" button that selects the node to be highlighted, and a "link" button that selects the link to be highlighted Let

  Furthermore, the display control unit 21 includes an “element analysis” button for totalizing the classification status of each node of the displayed tree diagram, an “activity” button for calculating the activity of the project, and the concentration level of the project. “Concentration” button for calculating The display control unit 21 displays an enlargement / reduction button, and executes enlargement or reduction of the tree diagram by selecting the enlargement / reduction button. The display control unit 21 also displays a keyword input area for searching for nodes and the like in the project (dendrogram), an area for setting notification from the system, and the like.

  Then, the display control unit 21 displays the similar tree diagrams searched by the search unit 50 side by side in the tool area. FIG. 20 is a diagram for explaining a search result of a similar tree diagram. As shown in FIG. 20, the display control unit 21 configures the nodes and links searched by the search unit 50 in the above-described process, alongside the tree diagram of the project name “new terminal development using AR” being processed. A tree diagram of the project name “terminal technology” as an element and a tree diagram of the project name “original development” are displayed. The button configuration displayed on each tree diagram is the same.

  In addition, the display control unit 21 can highlight links and nodes in each displayed tree diagram. FIG. 21 is a diagram illustrating highlighting of nodes in a tree diagram. Specifically, the display control unit 21 displays a pull-down menu, accepts selection of the node classification to be highlighted, and highlights the received node classification on the tree diagram. For example, as shown in FIG. 21, when the “node” button is selected, the display control unit 21 displays the node classification item “major category-medium category” and checks the node category to be highlighted. Accept with a button. Then, the display control unit 21 highlights the node by changing the color of the node corresponding to the middle category “idea” to which the check button is added.

  Note that the display control unit 21 can also highlight a link by selecting a large classification or a small classification for a link. The display control unit 21 can also combine node highlighting and link highlighting. The display control unit 21 displays an assignment list when the “issue list” button is selected. Further, when the “problem / solution display” button is selected, the display control unit 21 displays only the problems and solutions in a table format. In order to highlight the problem and the solution, a check button for the problem and the solution is selected in the classification in FIG. Further, when the “person / date” button is selected, the display control unit 21 causes each node and each link constituting the tree diagram to display corresponding to the generated date (time stamp). For example, only the node registered by itself is displayed, or the node registered in one week is displayed.

  Further, the display control unit 21 can analyze the status of discussion from the activity of the tree diagram, the node type (classification) constituting the tree diagram, and the like, and output various messages. For example, if the generation of the node does not occur for a certain period of time, the display control unit 21 determines that the problem solving has become stagnant, and the member of the corresponding tree diagram project is “discussed more actively. Send a message such as "Let's go." The display control unit 21 also highlights nodes with high activity even when the “activity” button on the screen is selected.

  After that, when many nodes are generated for solving the problem, the display control unit 21 adds up the classification of each node of the corresponding tree diagram and detects that “needs” are few. Then, the display control unit 21 transmits a message such as “Let's consider more needs” to the members of the corresponding tree diagram project. Since such a notification is also a notification in the project, it is notified in a notification window (notification area or the like) on the project screen side.

  When the “element analysis” button is selected on the screen, the display control unit 21 refers to the constituent elements of the tree diagram and displays the analysis result of the node classification and the analysis result of the link classification. FIG. 22 is a diagram for explaining element analysis. As shown in FIG. 22, the display control unit 21 aggregates the classification of each node of the tree diagram for each element of the medium classification and the classification of each link of the tree diagram for each element of the small classification. Display the results. By doing so, the member can know the deficient elements. Note that the graph shown in FIG. 22 is merely an example, and the present invention is not limited to this. The graph can be displayed in various graphs, and the total results can be displayed in numerical values.

  Further, when the “project list” button is selected on the screen shown in FIG. 19 or the like, the display control unit 21 displays the currently created project list as shown in the left diagram of FIG. FIG. 23 is a diagram for explaining project search. “No” shown in the left diagram of FIG. 23 is an identification number, “Project” is a project name, “Summary” is information indicating issues and project characteristics, and “Participants” is a project. This is a list of participants. “Open” is whether or not the problem has been solved, and “x” is set when the problem is solved, and “◯” is set when the problem is not solved. “Process” is information indicating what kind of process the project is defined. For example, 1 is set in the case of empathy. “Activity” is information calculated by the activity evaluation unit 42, and is displayed in, for example, five levels depending on the node generation status per unit time. The “participation” button is a button selected when it is desired to participate in the project. The display control unit 21 generates and displays such information.

  Then, when the project displayed in the left diagram of FIG. 23 is selected, the display control unit 21 displays the assignment list of the project (upper right diagram of FIG. 23). Here, the display control unit 21 displays “issue” indicating a project issue, “content” and “keyword” set in each issue node, and “open” indicating a solution status. By displaying such information, the user can visually confirm what kind of problem is unsolved. When the problem has been solved, “open” is not displayed or “closed” is displayed.

  When the display control unit 21 detects a special operation such as a right click on the project displayed in the left diagram of FIG. 23, the display control unit 21 displays the analysis result of the node classification and the link classification of each project (right of FIG. 23). (Figure below). Here, the display control unit 21 illustrates an example in which the same content as the graph format illustrated in FIG. 22 is expressed in another graph format, but a graph format similar to that in FIG. 22 may be employed.

[Process flow]
FIG. 24 is a flowchart showing the flow of a similar tree diagram search process. Note that the processing described here will be described using search conditions using nodes and links as an example.

  As shown in FIG. 24, the display control unit 21 displays a tree diagram being processed (S301). In this state, when receiving a search condition such as a plurality of nodes or links on the screen (S302: Yes), the search unit 50 determines whether or not an evaluation value such as a node evaluation point is specified (S303). ).

  When the evaluation value is not designated (S303: No), the retrieval unit 50 retrieves a tree diagram having the same keyword as the plurality of nodes designated by the retrieval condition (S304). That is, the search unit 50 searches for a tree diagram having a node having the same keyword set as a plurality of designated nodes as a constituent element.

  Subsequently, the search unit 50 identifies a tree diagram including link information to which a plurality of nodes specified by the search condition are connected among the searched tree diagrams (S305). Thereafter, the search unit 50 displays the identified tree diagram side by side with the tree diagram being processed (S306).

  On the other hand, when the evaluation value is specified in S303 (S303: Yes), the search unit 50 has the same keyword as the plurality of nodes specified in the search condition and has a tree shape having nodes equal to or higher than the specified evaluation value. The figure is searched (S307). Thereafter, S305 and subsequent steps are executed.

[effect]
As described above, the creation support server 10 can search and present to the user information that is likely to be forgotten, such as nodes that the user has generated in the past, and thus can be aware of the user and provide support. Not only partial creation support, but overall creation support can be provided, and fulfillment creation support can be provided.

  Further, since the creation support server 10 can structure and display the process leading to the conclusion and the node status of the project in a graph, the degree of contribution to the project can be visualized. This improves personal motivation. In addition, the creation support server 10 can display objective information by specifying a person image from the generation status of the node or the like, specifying the progress status of the project, and the like, and thus can provide objective information.

  Although the embodiments of the present invention have been described so far, the present invention may be implemented in various different forms other than the embodiments described above.

[Batch management of input information]
In addition, the creation support server 10 can store all the nodes generated by the user, the time when the user generated the node, and the like in the storage unit 12 and manage them collectively for each user. By performing such collective management, it is possible to evaluate the number of user utterances and the like by counting the number of user nodes generated over a long span such as one year. Furthermore, it is also possible to change the color and display so that a node where information and opinions are concentrated and a node with a high evaluation score can be identified. In addition, the calculation method of each evaluation value mentioned above can also be performed independently, and can also be performed combining several.

[Between groups]
In the above-described embodiment, an example in which the creation support server 10 transmits a message or the like that activates the discussion has been described, but the transmission destination user is not limited to a user of the same project. For example, when there is no person image that can overcome the stagnation or the like, the creation support server 10 can search for a corresponding user from other projects and encourage participation in the discussion.

[Character identification]
The creation support server 10 can accumulate past actions for each individual and specify a person image from the accumulated actions. For example, the creation support server 10 compares the number of generated nodes with a threshold value to identify a person image.

  For example, the creation support server 10 identifies a user who has generated a node more than a threshold as a “person who generates an idea”, and identifies a user who has generated a node in a state where a node has not been generated for a predetermined time as “a person who breaks silence”. ". In addition, the creation support server 10 identifies a user who generates a node that aggregates the divergence as a “person who summarizes opinions” in a state where the nodes are diverging, and a state in which the nodes are generated without branching from the task Then, the user who generated the node to be diverged is specified as “the person to be diverged”.

  In addition, the creation support server 10 identifies a user who has proposed a node for another project as “a person who assists”, identifies a person who frequently generates a node of a new proposal as “a person who moves to action”, and A person who makes an evaluation giving up a node is specified as “a person who is good at giving up”, and a user who generates a node having a high node evaluation score is specified as “a person with a high degree of contribution”.

  Then, the creation support server 10 can transmit a message recommending the participation of the project to the user corresponding to the person image that activates the project according to the result of the element analysis of the project for which the solution hardly appears. For example, the creation support server 10 recommends the participation of a user who corresponds to a “person who creates an idea” for a project with low activity.

[Vital data, position data]
In the above embodiment, an example of giving a time stamp to a node has been described. However, the present invention is not limited to this. For example, vital data, position information, or the like can be given. For example, the creation support server 10 acquires vital data such as blood pressure and heart rate from a wearable device worn by the user at the timing when the node is generated, and manages the data in association with the node.

  By doing in this way, the creation support server 10 can specify for each user what kind of state it is generating many nodes. As a result, the creation support server 10 can notify the user of a state in which a node is generated, that is, a health state in which many ideas can be created.

  The creation support server 10 can also identify the user's emotion from the vital data and associate the emotion with the node. Even if emotion data cannot be obtained from the initial vital data, it can be replaced by manual input. For example, it is possible to input what emotional state the user himself is. By doing so, the creation support server 10 can identify and present which type of node is generated for each user at what emotion.

  The creation support server 10 can also acquire position information from a GPS (Global Positioning System) such as a wearable device or a mobile phone held by the user, and manage the node and the position information in association with each other. By doing so, the creation support server 10 can identify and present that there are many nodes generated during a train or while walking. Similarly, the creation support server 10 can identify and present which type of node is generated during a train or while walking.

  Thus, the creation support server 10 can extract and present information that the user is not aware of by associating information that can be acquired from an existing device worn by the user with the node. In other words, a new viewpoint that cannot be noticed because the user is unconscious can be presented as “awareness”.

[Awareness support]
For example, the creation support server 10 can provide support to a project member who recognizes a new idea. Specifically, the creation support server 10 extracts at random from the nodes registered so far and presents them through the notification window. This is because, although it may not be related at all, a new awareness may occur by extracting a node that a human does not think about. In addition, when the idea support server 10 registers an idea node, the creation support server 10 presents a new consideration point using a notification window. This is to provide consideration points sequentially from the basic form of the idea even when the stage does not reach the stage of judging the content from the keyword.

  When the idea support server 10 registers an idea node, the creation support server 10 discriminates the keyword of the registered node and proposes an antonym or the like. Further, the creation support server 10 records time zones, places, and other states in the nodes, and therefore analyzes and displays places where many personal ideas have been created. For example, when the creation support server 10 has created many ideas while moving, the system prompts the user to think about ideas when moving.

[hardware]
The creation support server 10 can be realized by, for example, a computer having the following hardware configuration. FIG. 25 is a diagram illustrating a hardware configuration example. As illustrated in FIG. 25, the creation support server 10 includes a communication interface 100a, an HDD (Hard Disk Drive) 100b, a memory 100c, and a processor 100d.

  An example of the communication interface 100a is a network interface card. The HDD 100b is a storage device that stores various DBs illustrated in FIG.

  Examples of the processor 100d include a central processing unit (CPU), a digital signal processor (DSP), a field programmable gate array (FPGA), and a programmable logic device (PLD). Examples of the memory 100c include a RAM (Random Access Memory) such as SDRAM (Synchronous Dynamic Random Access Memory), a ROM (Read Only Memory), a flash memory, and the like.

  The creation support server 10 operates as an information processing apparatus that executes a search method by reading and executing a program. That is, the creation support server 10 executes a program that performs the same functions as the display control unit 21, the structuring unit 30, the contribution determination unit 40, and the search unit 50. As a result, the creation support server 10 can execute a process for executing functions similar to those of the display control unit 21, the structuring unit 30, the contribution determination unit 40, and the search unit 50. Note that the program in the other embodiments is not limited to being executed by the creation support server 10. For example, the present invention can be similarly applied to a case where another computer or server executes the program or a case where these programs cooperate to execute the program.

  This program can be distributed via a network such as the Internet. The program is recorded on a computer-readable recording medium such as a hard disk, flexible disk (FD), CD-ROM, MO (Magneto-Optical disk), DVD (Digital Versatile Disc), and the like. It can be executed by being read.

[system]
3 does not necessarily need to be physically configured as illustrated. That is, it can be configured to be distributed or integrated in arbitrary units. For example, the structuring unit 30 and the contribution determination unit 40 can be integrated. Further, all or any part of each processing function performed in each device may be realized by a CPU and a program analyzed and executed by the CPU, or may be realized as hardware by wired logic.

  In addition, among the processes described in the present embodiment, all or a part of the processes described as being automatically performed can be manually performed. Alternatively, all or part of the processing described as being performed manually can be automatically performed by a known method. In addition, the processing procedure, control procedure, specific name, and information including various data and parameters shown in the above-described document and drawings can be arbitrarily changed unless otherwise specified.

10 creation support server 11 communication unit 12 storage unit 13 node link information DB
14 Tree diagram DB
15 Evaluation DB
DESCRIPTION OF SYMBOLS 20 Control part 21 Display control part 30 Structured part 31 Registration part 32 Reception part 33 Generation part 40 Contribution determination part 41 Evaluation calculation part 42 Activity evaluation part

Claims (6)

On the computer,
A tree generated using a plurality of nodes, and links between the nodes of the plurality of nodes, each of which includes directionality information determined by the context of the time at which the plurality of nodes are registered. The keyword information included in at least two or more specified nodes among the plurality of nodes included in the drawing and the link information between the specified two or more nodes are accepted as search keys,
Referencing a storage unit that stores a plurality of tree diagrams corresponding to a plurality of agendas, extracting a tree diagram that matches the search key, and executing a process of outputting the tree diagram as a similar tree diagram Feature search program. Each of the plurality of nodes is connected via the link, and has an evaluation value evaluated using the degree of influence on the connection source node specified by the directionality given to the link,
The accepting process accepts the evaluation value as a key for the search,
The processing to output is to search a plurality of tree diagrams whose constituent elements are nodes equal to or higher than the evaluation value among nodes including the keyword information, and among the plurality of tree diagrams, a tree shape having the link information The search program according to claim 1, wherein a diagram is output as the similar tree diagram.   The process to be output includes the keyword information included in the new node when the generation of a new node and a new link is detected in the tree diagram being processed as the node and the link generation destination. The keyword information included in an existing node connected to the new node by the new link and the link information of the new link are extracted as the search keys. Search program described in.   In the process of outputting, when the generation of a new node is detected in the tree diagram in the processing target that is the generation destination of the node and the link, an antonym of the keyword information included in the new node is determined. The search program according to claim 1, wherein the search program is extracted as a key for the search. Computer
A tree generated using a plurality of nodes, and links between the nodes of the plurality of nodes, each of which includes directionality information determined by the context of the time at which the plurality of nodes are registered. The keyword information included in at least two or more specified nodes among the plurality of nodes included in the drawing and the link information between the specified two or more nodes are accepted as search keys,
Referencing a storage unit that stores a plurality of tree diagrams corresponding to a plurality of agendas, extracting a tree diagram that matches the search key, and executing a process of outputting the tree diagram as a similar tree diagram A featured search method. A tree generated using a plurality of nodes, and links between the nodes of the plurality of nodes, each of which includes directionality information determined by the context of the time at which the plurality of nodes are registered. A receiving unit that receives keyword information included in at least two or more specified nodes among a plurality of nodes included in the drawing, and link information between the specified two or more nodes as a search key;
An output unit that extracts a tree diagram that matches the search key by referring to a storage unit that stores a plurality of tree diagrams corresponding to a plurality of agendas and outputs the tree diagram as a similar tree diagram; An information processing apparatus characterized by the above.

Images