JP2024092292A - Knowledge information management apparatus and knowledge information providing method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a knowledge information management apparatus and a knowledge information providing method configured to facilitate activation of a place for exchanging knowledge information.

SOLUTION: A graph management server 1 connected to communicate with each of user terminals 5 used by creators of a knowledge graph and users is configured to: receive, from the user terminals 5 of the creators, graphs of the knowledge graph created by the creators; register the received graphs on a graph storage unit; output graph IDs indicating the graphs stored in the graph storage unit so as to be browsed from the user terminals 5 of the users; provide graphs corresponding to the graph IDs to the user terminals 5 of the users so that the graphs are available; acquire a provision status of the graphs; and offer a reward to the creators corresponding to the graphs in accordance with the acquired provision status of the graphs.

SELECTED DRAWING: Figure 1

COPYRIGHT: (C)2024,JPO&INPIT

Description

The present invention relates to a knowledge information management device and a knowledge information provision method.

Electronic commerce using the Internet has been conducted in various fields. Electronic commerce requires a place to sell (provide) the things that buyers need. It is also convenient for sellers to have a place to sell.
In the chemical field, such as chemical compounds, medicines, and biotechnology, there are a wide variety of compounds, and many compounds with similar structures exist. Therefore, what a buyer needs may not necessarily be available at the store.
In view of this, a system has been disclosed that presents useful information regarding a compound inquiry from a customer to a plurality of sellers and mediates commercial transactions between the customer and the sellers (see, for example, Patent Document 1).

JP 2002-163553 A

Currently, a new attempt called MI (materials informatics) is being made. MI is a material development technology that combines cutting-edge data processing technology with materials science, and refers to the use of computers to analyze huge amounts of experimental data and data from papers, especially in the fields of materials and chemistry.
The knowledge graph created from the analysis results can reveal unknown materials and applications, for example, leading to the discovery of revolutionary new materials. The created knowledge graph can lead to further new discoveries depending on how it is used, and it is hoped that it will be widely used by the general public. It would be useful to have a forum for exchange about the knowledge information used to create such knowledge graphs, including such knowledge graphs.

The present invention aims to provide a knowledge information management device and a knowledge information provision method that can promote the activation of knowledge information-related spaces.

The present invention relates to a knowledge information management device that is communicatively connected to a creator terminal used by a creator of knowledge information related to a knowledge graph, the knowledge information including a knowledge graph that expresses connections between knowledge in a graph structure and a knowledge dictionary used to create the knowledge graph, and a user terminal used by a user of the knowledge information, the knowledge information management device comprising: a knowledge information receiving means for receiving the knowledge information created by the creator from the creator terminal; a knowledge information registering means for registering the knowledge information received by the knowledge information receiving means in a knowledge information storage unit; an information viewing means for outputting display information indicating the knowledge information stored in the knowledge information storage unit so that it can be viewed from the user terminal; a knowledge information providing means for providing the knowledge information corresponding to the display information output by the information viewing means to the user terminal so that it can be used; a provision status acquiring means for acquiring the provision status of the knowledge information by the knowledge information providing means; and a reward granting means for granting a reward to the creator corresponding to the knowledge information according to the provision status of the knowledge information acquired by the provision status acquiring means.

In addition, in the knowledge information management device, the knowledge information providing means may make the knowledge information available and provide it to the user terminal in response to the user paying value information related to the use of the knowledge information.

In addition, in the knowledge information management device, the reward granting means may grant at least a portion of the value information paid by the user as the reward to the creator.

In addition, in the knowledge information management device, the knowledge information receiving means may receive the knowledge information and explanatory information relating to the content and/or usage of the knowledge information, the knowledge information storage unit may store the knowledge information and the explanatory information in association with each other, and the information viewing means may output the explanatory information so that it can be viewed from the user terminal.

In addition, the knowledge information management device may include a tag information acquisition means for acquiring tag information from the received knowledge graph when the knowledge information receiving means receives the knowledge graph, the knowledge information storage unit stores the tag information acquired by the tag information acquisition means in association with the knowledge information, and the information viewing means outputs the tag information so that it can be viewed from the user terminal.

In addition, in the knowledge information management device, the information viewing means may group similar knowledge graphs into the same group based on the tag information acquired by the tag information acquisition means, and output the group so that the knowledge graphs can be viewed from the user terminal.

In addition, in the knowledge information management device, the information viewing means may include a detailed output means for outputting a symbol corresponding to the knowledge information so that the symbol can be viewed from the user terminal, and for outputting at least a portion of the data of the knowledge information corresponding to the symbol when a predetermined operation on the symbol is received.

In addition, in the knowledge information management device, the knowledge information receiving means may receive from the creator terminal a new knowledge graph in which the knowledge graph, which is the knowledge information provided by the knowledge information providing means for use by the user terminal, is combined with another knowledge graph.

The knowledge information management device may further include a verification request means for requesting a verifier terminal used by a verifier to verify the knowledge information received by the knowledge information receiving means, and the knowledge information registration means may register the knowledge information in the knowledge information storage unit when the verifier requested by the verification request means has verified the knowledge information.

The knowledge information management device may also include a query receiving means for receiving query information relating to the use of the knowledge information from the user terminal, a response requesting means for requesting a response to the query information received by the query receiving means from an advisor terminal used by an advisor, a response receiving means for receiving from the advisor terminal response information by the advisor requested by the response requesting means, and a response sending means for sending the response information received by the response receiving means to the user terminal.

The present invention also relates to a knowledge information providing method executed by a computer communicatively connected to a creator terminal used by a creator of knowledge information related to a knowledge graph, the knowledge information including a knowledge graph that expresses connections between knowledge in a graph structure and a knowledge dictionary used to create the knowledge graph, and a user terminal used by a user of the knowledge information, the knowledge information providing method including a knowledge information receiving step of receiving the knowledge information created by the creator from the creator terminal, a knowledge information registering step of registering the knowledge information received in the knowledge information receiving step in a knowledge information storage unit, an information viewing step of outputting display information indicating the knowledge information stored in the knowledge information storage unit so as to be viewable from the user terminal, a knowledge information providing step of providing the knowledge information corresponding to the display information output in the information viewing step to the user terminal so as to be usable, a provision status acquiring step of acquiring a provision status of the knowledge information by the knowledge information providing step, and a reward granting step of granting a reward to the creator corresponding to the knowledge information according to the provision status of the knowledge information acquired in the provision status acquiring step.

The present invention provides a knowledge information management device and a knowledge information provision method that can promote the activation of knowledge information-related spaces.

1 is a diagram showing an overall configuration of a graph providing system according to an embodiment of the present invention. FIG. 2 is a diagram illustrating functional blocks of a graph management server according to the present embodiment. 5 is a diagram illustrating example items in each storage unit of the graph management server according to the embodiment. FIG. 3 is a diagram showing example items in each storage unit of the data storage device according to the embodiment; FIG. 13 is a flowchart showing a user access process in the graph management server according to the embodiment. FIG. 11 is a diagram showing an example of a screen output to a user terminal according to the embodiment. FIG. 11 is a diagram showing an example of a screen output to a user terminal according to the embodiment. FIG. 11 is a diagram showing an example of a screen output to a user terminal according to the embodiment. 13 is a flowchart showing a graph registration process in the graph management server according to the embodiment. 13 is a flowchart showing a graph use process in the graph management server according to the embodiment. 13 is a flowchart showing a query process in the graph management server according to the embodiment. 13 is a flowchart showing a history process in the graph management server according to the embodiment.

Hereinafter, an embodiment of the present invention will be described with reference to the drawings. Note that this is merely an example, and the technical scope of the present invention is not limited to this example.
(Embodiment)
[Overall configuration of graph providing system 100]
FIG. 1 is a diagram showing the overall configuration of a graph providing system 100 according to this embodiment.
FIG. 2 is a diagram showing functional blocks of the graph management server 1 according to this embodiment.
FIG. 3 is a diagram showing example items in each storage unit of the graph management server 1 according to this embodiment.
FIG. 4 is a diagram showing example items in each storage unit of the data storage device 4 according to this embodiment.

A graph providing system 100 shown in FIG. 1 is a system that provides a place for registered users to post and use knowledge graphs (knowledge information).
A knowledge graph is a graph that expresses factual correlations, which allows new knowledge to be obtained by systematizing knowledge related to the target data and its relationships. A knowledge graph can be created using technical document data and a knowledge dictionary.
Technical document data refers to technical papers, technical documents, data from public databases, etc., and technical documents include, for example, patent documents, encyclopedias, experimental data, SDS (Safety Data Sheets), product catalogs, COAs (Certificates of Analysis), etc.

The knowledge dictionary is generated by a technical term dictionary and a model showing categories and their relevance, and organizes technical terms by category and includes associations for each category. The knowledge dictionary is used to analyze technical document data related to one or more technical fields and to tag the technical document data based on the analysis results.
A knowledge graph visually represents the relationships between data by showing tags and relevance information of technical document data that have been assigned using a knowledge dictionary as nodes and edges.
Hereinafter, the knowledge graph will be simply referred to as the graph.

The graph providing system 100 includes a graph management server 1 (knowledge information management device), a data storage device 4 (knowledge information management device), and user terminals 5 (creator terminal, user terminal, verifier terminal, advisor terminal).
The graph management server 1 and the data storage device 4 may be directly connected to each other, or may be connected to each other via a communication network (not shown).
The graph management server 1 and the user terminal 5 are capable of communicating with each other via a communication network. The communication network is, for example, a communication line network such as the Internet. The communication network may include a local area network (LAN), a virtual private network (VPN), a wide area network (WAN), etc., and may be wired or wireless.

[Graph Management Server 1]
The graph management server 1 registers graphs created and posted by users (creators) and manages the use of the graphs by the users. The graph management server 1 also outputs to each user terminal 5 a list page that displays graph IDs (IDentification) (display information) and icons (symbols) of graphs managed by the graph management server 1, including graphs posted by users. Furthermore, the graph management server 1 provides graphs to the user terminals 5 of users who wish to use the graphs.
The graph management server 1 is, for example, a web server. The graph management server 1 may be configured with one computer or multiple computers. When multiple computers are used, these computers are connected via, for example, a communication network. In addition, the graph management server 1 may be configured as, for example, a virtual server (virtual machine) provided on a cloud.

As shown in FIG. 2, the graph management server 1 includes a control unit 10, a storage unit 30, and a communication IF (interface) unit 39.
The control unit 10 is a central processing unit (CPU) that controls the entire graph management server 1. The control unit 10 appropriately reads and executes an operating system (OS) and application programs stored in the storage unit 30, thereby cooperating with the above-mentioned hardware to execute various functions.

Specifically, in this embodiment, an example is described in which the graph management server 1 is realized by having a computer execute a program. The program can be recorded on a computer-readable non-transitory information recording medium such as a compact disc, a flexible disk, a hard disk, a magneto-optical disk, a digital video disk, a magnetic tape, a ROM (Read Only Memory), an EEOPROM (Electrically Erasable Programmable ROM), a flash memory, or a semiconductor memory. This information recording medium can be distributed and sold independently of the computer.

In general, a computer reads out a program recorded on a non-transitory information recording medium into a RAM (Random Access Memory), which is a temporary storage device included in the storage unit 30, and then the CPU serving as the control unit 10 executes instructions included in the read out program.
In addition, the program can be distributed and sold to computers, etc. from a program distribution server, etc. (not shown) via a temporary transmission medium such as a communication network, independently of the computer on which the program is executed.

The program can also be written in a programming language for describing the behavioral level of electronic circuits. In this case, various design drawings, such as wiring diagrams and timing charts for electronic circuits, are generated from the program written in a programming language for describing the behavioral level of electronic circuits, and the electronic circuits that make up the graph management server 1 can be created based on the design drawings. For example, the graph management server 1 can be configured on reprogrammable hardware using FPGA (Field Programmable Gate Array) technology from a program written in a programming language for describing the behavioral level of electronic circuits, and it is also possible to configure electronic circuits dedicated to specific applications using ASIC (Application Specific Integrated Circuit) technology.

The graph management server 1 is configured to execute each process described in this embodiment by the control unit 10 controlling each component unit described below.
The control unit 10 includes a login processing unit 11, a list page output unit 12 (information viewing means), a registration operation receiving unit 13, a graph registration processing unit 14 (knowledge information receiving means, tag information acquisition means, verification request means, knowledge information registration means), a detail output processing unit 15 (information viewing means, detail output means), a usage operation receiving unit 16, a graph provision processing unit 17 (knowledge information providing means), a query operation receiving unit 18, an answer provision processing unit 19 (query receiving means, answer request means, answer receiving means, answer sending means), a reward granting unit 20 (provision status acquisition means, reward granting means), and a recommendation information providing unit 21.

The login processing unit 11 performs processing related to login from a user terminal 5 that uses a service provided by the graph management server 1. The login processing unit 11 authenticates users (creator, user, verifier, and advisor) who use the user terminal 5.
The list page output unit 12 outputs to the user terminal 5 a list page on which graph IDs and icons corresponding to the graphs stored in the data storage device 4 are arranged.
The registration operation receiving unit 13 receives an operation related to graph registration from the user terminal 5 .

The graph registration processing unit 14 receives from the user terminal 5 a graph that has been created and posted by a creator. Here, the creator may be, for example, an alumnus of a chemical manufacturing company, an associate professor at a university, or a student, and is a person who has graph creation skills and is able to create graphs. In addition, the graph registration processing unit 14 may receive explanatory information explaining the graph from the user terminal 5 along with the graph. The explanatory information is, for example, information about the contents of the graph and/or how to use it. More specifically, the explanatory information may be, for example, the background of the creator, keywords, etc. Furthermore, the graph registration processing unit 14 may analyze the graph and obtain tag information from the graph.

The graph registration processing unit 14 requests the received graph to the verifier's user terminal 5. The graph registration processing unit 14 may request the verifier to verify the graph in response to a request from the creator, or may request the verifier to verify the graph when posted by a specific creator. Here, the verifier refers to, for example, an expert who has knowledge about graphs. There may be one verifier or multiple verifiers.

Then, the graph registration processing unit 14 stores the received graph in the graph storage unit 41 (knowledge information storage unit) of the data storage device 4. Furthermore, when the graph registration processing unit 14 requests a verifier to verify a graph, it stores the graph that has been verified by the verifier in the graph storage unit 41 of the data storage device 4.
The graphs registered by the graph registration processing unit 14 will be of various levels depending on the graph creator's graph creation skill. On the other hand, a graph that has been verified by a verifier will have a certain level of reliability.
The detail output processing unit 15 outputs detailed data of the graph to the user terminal 5 .

The usage operation reception unit 16 receives operations related to the use of the graph from the user's user terminal 5. Here, the user may be the same as the creator of the graph, or may be someone else. The other person may be, for example, a corporate researcher or a person who uses software that handles knowledge graphs and performs various processes.

The graph provision processing unit 17 provides a graph corresponding to the accepted operation to the user terminal 5 of the user so that the graph can be used. The graph provision processing unit 17 may, for example, download data related to the graph to the user terminal 5. The graph provision processing unit 17 may also, for example, enable the data related to the graph to be handled on the cloud. The graph provision processing unit 17 may also provide a graph corresponding to the accepted operation to the user terminal 5 of the user so that the graph can be used, by paying an amount (value information) related to the use of the graph, for example.
Then, the graph provision processing unit 17 stores the history related to the use (provision) of the graph in the user history storage unit 42 of the data storage device 4.

The inquiry operation receiving unit 18 receives inquiry data related to the use of graphs from the user's user terminal 5. The inquiry operation receiving unit 18 receives inquiry data such as a question as to which graph should be used to achieve a certain purpose, or a question as to how graphs should be combined.
The answer providing processing unit 19 requests the advisor's user terminal 5 to provide an answer to the inquiry data received from the user terminal 5. Then, upon receiving the answer data from the advisor's user terminal 5, the answer providing processing unit 19 transmits the answer data to the user terminal 5 that is the sender of the inquiry data.

The reward granting unit 20 acquires the provision status of the graph provided to the user terminal 5 from the user history storage unit 42, and grants the creator a usage fee (value information) according to the acquired provision status. The reward granting unit 20 may grant the creator the usage fee as at least a part of the amount paid by the user as reward.
The recommended information providing unit 21 provides recommendations to the user terminal 5 of the user. For example, the recommended information providing unit 21 analyzes the history of the user's use stored in the user history storage unit 42 of the data storage device 4 to grasp the tendency of the graph usage for each user. Then, the recommended information providing unit 21 transmits a recommendation corresponding to the grasped tendency to the user terminal 5 of the user.

The storage unit 30 is a storage area such as a hard disk, a semiconductor memory device, etc. for storing programs, data, etc. required for the control unit 10 to execute various processes.
The storage unit 30 includes a program storage unit 31 , a user information storage unit 32 , and a remuneration storage unit 33 .
The program storage unit 31 is a storage area that stores various programs. The program storage unit 31 stores a graph management program 31a. The graph management program 31a is a program for executing each function of the control unit 10 described above. Note that each of the above programs is an example. Therefore, the graph management program 31a may execute each function of the control unit 10 described above using multiple programs.

The user information storage unit 32 is a storage area that stores information about users who use the services provided by the graph management server 1.
3A shows an example of items in the user information storage unit 32. The user information storage unit 32 stores, for example, a user name, attribute information such as affiliation, authority flag, etc., using a user ID as a key.
Attribute information refers to, for example, the name of a company, a university, or a research institute.
The authority flag is, for example, a flag for general member, special member, verifier, advisor, etc. Here, a general member is, for example, a user who uses the service provided by the graph management server 1 free of charge, and a special member is, for example, a user who uses the service for a fee. When using the service provided by the graph management server 1, a user decides in advance whether to become a paid or free member and registers. A verifier is a person who verifies a graph posted by a creator, for example, a reviewer who has knowledge about graphs. An advisor is a person who answers (gives advice) to a user's inquiries, for example, a consultant who has knowledge about graphs.

The remuneration storage unit 33 is a storage area for storing information regarding the remuneration to be paid to the creator.
3(B) shows example items in the remuneration storage unit 33. The remuneration storage unit 33 stores, for example, the creator's user ID, a remuneration calculation period, a remuneration, and a completed flag in association with each other.
The creator user ID is identification information that identifies the creator of the graph.
The remuneration calculation period is the period for which the remuneration is calculated.
The remuneration amount is an amount calculated as a portion of the payment amount.
The payment completed flag is a flag indicating whether or not the remuneration amount has been paid.
The communication IF unit 39 is an interface for communicating between the data storage device 4 and the user terminal 5 .

[Data storage device 4]
The data storage device 4 shown in FIG. 2 stores graphs, usage history, and the like.
The data storage device 4 stores a graph storage unit 41 and a user history storage unit 42 .
The graph storage unit 41 is a storage area for storing information related to graphs.
FIG. 4A shows an example of items in the graph storage unit 41.
The graph storage unit 41 has the following items: graph ID, graph data, various information, creator's user ID, posting date, verifier's user ID, and verification completion date.

The graph ID is identification information for identifying a graph. For example, when a creator posts a graph, the control unit 10 of the graph management server 1 may assign the graph ID to the graph so that the graph ID is unique.
Graph data is the graph data itself.
The various information is various information related to the graph, and includes, for example, an icon, explanatory information, and tag information. The icon may be, for example, a simplified schematic representation of the shape of the graph. For example, if the graph has 10 nodes, the icon may be a simplified version of the graph with approximately three nodes. The explanatory information is explanatory information about the graph received from the user terminal 5. The tag information is information obtained by analyzing the graph. Note that the system may have only one of the explanatory information and the tag information.
The creator's user ID and posting date are the user ID and date received from the user terminal 5 .
The verifier's user ID and verification completion date are registered when the verifier performs verification.
In addition, other information such as information indicating the usage amount may also be stored.

The user history storage unit 42 is a storage area for storing the usage history of a user with respect to a graph.
FIG. 4B shows an example of items in the user history storage unit 42.
The user history storage unit 42 stores the date and time of use, the user ID of the user, the graph ID, and the payment amount in association with each other.
The usage date and time is the date on which the graph was provided to the user and/or used.
The user ID of the user is the user ID received from the user terminal 5 .
The graph ID is the ID of the graph that is provided and/or used.
The payment amount is the amount paid by the user for the provision and/or use of the graph.
In addition, the payment amount is left blank if the graph is free of charge.

The data storage device 4 may be a distributed network consisting of multiple storage devices (called nodes) that constitute a ledger management system (e.g., a blockchain) equipped with a tamper-proof function from the viewpoint of security and reliability assurance. In this case, the data storage device 4 generates units of data called "blocks" at regular intervals and stores data by linking them like a chain. The data storage device 4 uses a P2P (Peer to Peer) network, and each storage device communicates directly with the other devices. By storing data in a chain, once data in a block is stored, the data cannot be changed retroactively, and tamper-proofing and safety and reliability can be guaranteed. The multiple storage devices may be, for example, multiple computers or servers.

[User terminal 5]
1 is a terminal used by each user. The user terminal 5 is, for example, a personal computer (PC). The user terminal 5 may also be a mobile terminal such as a tablet.
The user terminal 5 includes a control unit, a storage unit, a communication IF unit, a display unit, an input unit (none of which are shown), and the like.

Note that a computer refers to an information processing device equipped with a control unit, a storage device, etc., and the graph management server 1 and the user terminal 5 are both information processing devices equipped with a control unit, a storage device, etc., and are included in the concept of a computer.

[Processing Description]
Next, the processing in the graph providing system 100 will be described.
FIG. 5 is a flowchart showing a user access process in the graph management server 1 according to this embodiment.
6 to 8 are diagrams showing examples of screens output to the user terminal 5 according to this embodiment.

The user terminal 5 connects to the graph management server 1 and, for example, inputs a user ID or the like from a login page (not shown), whereby the control unit 10 (login processing unit 11) of the graph management server 1 performs login processing in step S (hereinafter, "step S" will be simply referred to as "S") 11 of Fig. 5. The control unit 10 authenticates the user, for example, by referring to the user information storage unit 32.
If the user is authenticated, the control unit 10 (list page output unit 12) edits a list page and transmits it to the user terminal 5 in S12.

Fig. 6 shows examples of list pages output to the user terminal 5. Fig. 6(A) is an example of list page 51 output to the user terminal 5 when the user is a general member, and Fig. 6(B) is an example of list page 52 output to the user terminal 5 when the user is a special member.
The list page 51 of FIG. 6A includes a login information section 51a, an icon output section 51b, a post button 51c, a question button 51d, and a message board button 51e.
The login information section 51a outputs information about the currently logged-in user.
The icon output unit 51b outputs a plurality of icons corresponding to each of a plurality of graphs stored in the graph storage unit 41. In this example, an icon with a simplified shape of the graph and the graph ID are output. More specifically, the icon output unit 51b outputs an icon corresponding to a graph in which the verifier's user ID and the verification completion date are blank, among the graphs stored in the graph storage unit 41.
The submit button 51c is a button that the creator selects when he or she wishes to submit a newly created graph.
The question button 51d is a button that the user selects when he or she wishes to receive advice from an advisor about how to use the graph.
The message board button 51e is a button that the user or the like selects when he or she wishes to know information about each graph.

The list page 52 of FIG. 6(B) includes a login information section 52a, an icon output section 52b, a post button 52c, a question button 52d, a bulletin board button 52e, and also a dedicated icon output section 52f.
The login information section 52a to the bulletin board button 52e are similar to the login information section 51a to the bulletin board button 51e in FIG. 5(A).
The dedicated icon output unit 52f outputs an icon corresponding to a graph that has been verified by a verifier among the graphs. In other words, the dedicated icon output unit 52f outputs an icon corresponding to a graph in which values are input for the verifier's user ID and the verification completion date among the graphs stored in the graph storage unit 41.
Note that the configuration of the list page is merely an example, and is not intended to be limiting. For example, an area for displaying advertisements may be provided on the list page, so that advertising revenue can be earned.

In S13 of FIG. 5, the control unit 10 determines whether or not an operation signal has been received from the user terminal 5. An operation signal refers to, for example, a signal output from the user terminal 5 when the user operates various buttons in FIG. 6, or a signal output from the user terminal 5 when the user operates an icon in the icon output unit 51b, etc. If an operation signal has been received from the user terminal 5 (S13: YES), the control unit 10 transfers the process to S14. On the other hand, if an operation signal has not been received from the user terminal 5 (S13: NO), the control unit 10 transfers the process to S24.

In S14, the control unit 10 (registration operation receiving unit 13) determines whether the received operation signal is a graph posting. For example, the control unit 10 determines that the operation signal is a graph posting when the post button 51c on the list page 51 in Fig. 6(A) or the post button 52c on the list page 52 in Fig. 6(B) is operated. If the received operation signal is a graph posting (S14: YES), the control unit 10 shifts the process to S15. On the other hand, if the received operation signal is not a graph posting (S14: NO), the control unit 10 shifts the process to S16.
In S15, the control unit 10 (graph registration processing unit 14) performs a graph registration process, which will be described later.

In S16, the control unit 10 judges whether the received operation signal is a bulletin board request. For example, the control unit 10 judges that the operation signal is a bulletin board request when the bulletin board button 51e on the list page 51 in Fig. 6(A) or the bulletin board button 52e on the list page 52 in Fig. 6(B) is operated. If the received operation signal is a bulletin board request (S16: YES), the control unit 10 shifts the process to S17. On the other hand, if the received operation signal is not a bulletin board request (S16: NO), the control unit 10 shifts the process to S18.
In S17, the control unit 10 performs a bulletin board output process, ie, outputs to the user terminal 5 a bulletin board page (not shown) in which the usage method of each graph and the contents of the graph are formatted in a bulletin board format.

In S18, the control unit 10 judges whether the received operation signal is a detailed graph request. A detailed graph request can be made, for example, by right-clicking a specific icon 51g with the pointer P (which may be the user's finger, etc.) as shown in FIG. 7 and selecting "View details" from the right menu 51h that is output when the pointer P (which may be the user's finger, etc.) is selected. If the received operation signal is a detailed graph request (S18: YES), the control unit 10 moves the process to S19. On the other hand, if the received operation signal is not a detailed graph request (S18: NO), the control unit 10 moves the process to S20.

In S19, the control unit 10 (detail output processing unit 15) performs detailed information output processing. The control unit 10 outputs, for example, a detail page 61 illustrated in FIG. 8 to the user terminal 5. The detail page 61 includes a graph ID section 61a, an overview section 61b, an input information section 61c, and a graph section 61d. The graph ID section 61a is the graph ID of the selected graph. The overview section 61b and the input information section 61c are information based on various information stored in the graph memory unit 41. The graph section 61d indicates the shape of the graph data and its contents.

In S20 of Fig. 5, the control unit 10 (use operation reception unit 16) judges whether the received operation signal is for graph use. For example, as shown in Fig. 7, a graph can be used by selecting "download" or "use in cloud" from a right menu 51h that is output by right-clicking with the pointer P selected on a specific icon 51g. If the received operation signal is for graph use (S20: YES), the control unit 10 shifts the process to S21. On the other hand, if the received operation signal is not for graph use (S20: NO), the control unit 10 shifts the process to S22.
In S21, the control unit 10 (graph provision processing unit 17) performs a graph use process, which will be described later.

In S22, the control unit 10 (inquiry operation receiving unit 18) judges whether the received operation signal is an inquiry. The control unit 10 judges that it is an inquiry when, for example, the question button 51d on the list page 51 in Fig. 6(A) or the question button 52d on the list page 52 in Fig. 6(B) is operated. If the received operation signal is an inquiry (S22: YES), the control unit 10 shifts the process to S23. On the other hand, if the received operation signal is not an inquiry (S22: NO), the control unit 10 shifts the process to S24.
In S23, the control unit 10 (answer providing processing unit 19) performs a query process, which will be described later.

In S24, the control unit 10 determines whether or not to log out. For example, when the page is closed, the control unit 10 determines that log out is to occur. If log out is to occur (S24: YES), the control unit 10 ends this process. On the other hand, if log out is not to occur (S24: NO), the control unit 10 moves the process to S13.

Next, the graph registration process will be described.
FIG. 9 is a flowchart showing the graph registration process in the graph management server 1 according to this embodiment.
In S31, the control unit 10 accepts a graph from the user terminal 5.
In S32, the control unit 10 acquires tag information of the graph.

In S33, the control unit 10 determines whether or not the graph does not require verification. When registering a graph in the user terminal 5, the user can select whether or not the graph should be verified by a verifier, and the control unit 10 can determine whether or not the graph should be verified based on the creator's selection. If the graph does not require verification (S33: YES), the control unit 10 moves the process to S34. On the other hand, if the graph does require verification (S33: NO), the control unit 10 moves the process to S35.

In S34, the control unit 10 registers the received graph on the general member site. Specifically, the control unit 10 adds a record to the graph storage unit 41 (see FIG. 4) and registers data in each item up to the posting date. Thereafter, the control unit 10 shifts the process to S16 in FIG. 5.
On the other hand, in S35, the control unit 10 registers the graph in a provisional area (see FIG. 1). The provisional area corresponds to a temporary storage area of the storage unit 30, for example.

In S36, the control unit 10 requests the verifier's user terminal 5 to verify the graph. Here, the selection of the verifier is arbitrary. The control unit 10 may select the verifier based on, for example, the availability of the verifier (not shown). The control unit 10 may also select the verifier based on, for example, tag information of the graph to be verified.
In S37, the control unit 10 acquires the verification result from the user terminal 5 of the verifier.
In S38, the control unit 10 notifies the creator's user terminal 5 of the verification result.

In S39, the control unit 10 judges whether the verification result is OK, that is, whether or not the verifier has verified the graph. If the verification result is OK, that is, if the verifier has verified the graph (S39: YES), the control unit 10 moves the process to S40. On the other hand, if the verification result is NG (S39: NO), the control unit 10 deletes the graph from the provisional area without registering it, ends this process, and moves the process to S16 in FIG. 5.

In S40, the control unit 10 registers the graph that was registered in the provisional area on the special member site. Specifically, the control unit 10 adds a record to the graph storage unit 41 (see FIG. 4) and registers data in all items up to the verification completion date. After that, the control unit 10 moves the process to S16 in FIG. 5.

Next, the graph use process will be described.
FIG. 10 is a flowchart showing the graph use process in the graph management server 1 according to this embodiment.
In S51, the control unit 10 judges whether or not the graph related to use received from the user terminal 5 is for which a fee is charged. For example, when an icon in the dedicated icon output section 52f (see FIG. 6(B)), which is a graph area for special members only, is selected, the control unit 10 judges that the graph related to use is for which a fee is charged. If the graph related to use is for which a fee is charged (S51: YES), the control unit 10 transfers the process to S52. On the other hand, if the graph related to use is not for which a fee is charged (S51: NO), the control unit 10 transfers the process to S54.

In S52, the control unit 10 presents the usage amount to the user terminal 5. The usage amount may be, for example, a uniform amount, or may be an amount determined by the creator or verifier.
In S<b>53 , the control unit 10 accepts payment information from the user terminal 5 .
In S54, the control unit 10 judges whether or not the usage method of the graph related to the usage accepted from the user terminal 5 is by downloading. If it is by downloading (S54: YES), the control unit 10 shifts the process to S55. On the other hand, if it is not by downloading (S54: NO), the control unit 10 shifts the process to S56.

In S55, the control unit 10 transmits data related to the target graph to the user terminal 5. After that, the control unit 10 moves the process to S57.
On the other hand, in S56, the control unit 10 updates the data related to the target graph so that it can be used on the cloud.
In S57, the control unit 10 registers the history information in the user history storage unit 42. Thereafter, the control unit 10 shifts the process to S22 in FIG.

Next, the inquiry process will be described.
FIG. 11 is a flowchart showing a query process in the graph management server 1 according to this embodiment.
In S61, the control unit 10 accepts a question from the user terminal 5.
In S62, the control unit 10 transmits the question content to the advisor's user terminal 5. Note that the method for selecting an advisor is arbitrary.
In S63, the control unit 10 acquires a response from the user terminal 5 of the advisor.
In S64, the control unit 10 transmits the answer to the user terminal 5 of the questioner. After that, the control unit 10 shifts the process to S24 in FIG.

Next, the history processing will be described.
FIG. 12 is a flowchart showing the history processing in the graph management server 1 according to this embodiment.
The history process shown in FIG. 12 is a process that is repeatedly executed by the control unit 10 of the graph management server 1 at a predetermined timing, for example, once a week or once a month.
In S81, the control unit 10 (reward granting unit 20) checks the usage status for each graph during a predetermined period by referring to the user history storage unit 42. The control unit 10 calculates, as the usage status, for example, the number of downloads, which is the provision status of the graph, or the number of uses in the cloud.

In S82, the control unit 10 (reward granting unit 20) calculates the amount of reward for each graph according to the usage status based on the usage amount obtained in a predetermined period, etc. The control unit 10 may use, as a source of the reward amount, for example, advertising fees for advertisements output on the list page in addition to the usage amount obtained in the predetermined period.
In S83, the control unit 10 (reward granting unit 20) collectively registers the remuneration amount for each creator in the remuneration amount storage unit 33.

In S84, the control unit 10 (recommended information providing unit 21) refers to the user history storage unit 42 and analyzes the usage tendency of each user.
In S85, the control unit 10 (recommended information providing unit 21) recommends a graph suitable for the user based on the analysis result to the user's user terminal 5. The timing of the recommendation may be, for example, outputting the graph on a list page after the user performs a login process from the user terminal 5, or may be notifying the user's user terminal 5. Thereafter, the control unit 10 ends this process.

As described above, the graph management server 1 of this embodiment has the following advantages.
(1) Receive a graph created by a creator from the user terminal 5, register it in the graph storage unit 41, and output the graph ID and icon of the graph stored in the graph storage unit 41 so that they can be viewed from the user terminal 5 of the user. Also, provide the graph to the user terminal 5 of the user so that it can be used, obtain the availability status of the graph, and grant a reward to the creator corresponding to the graph according to the obtained availability status of the graph.
Therefore, graph creators can post and register the graphs they have created on a platform for others to use. In addition, as the graphs are used, rewards are given to the graph creators according to the status of provision, which increases the motivation of the graph creators to create graphs. As a result, the opportunities for posting and using graphs provided and managed by the graph management server 1 are revitalized.

(2) In response to a user paying a usage fee for the use of the graph, the graph is made available for use and provided to the user's user terminal 5. Thus, the user can use the graph by paying the usage fee.
(3) At least a portion of the usage fee paid by the user is given to the creator as a reward. Thus, the usage fee paid by the user can be used as a source of the reward paid to the creator.

(4) Receive a graph and explanatory information relating to the content and/or usage of the graph, store the graph and explanatory information in correspondence with each other in the graph memory unit 41, and output the explanatory information so that it can be viewed from the user's user terminal 5.
Therefore, since the creator can input and register the contents and usage of the graph himself, information from the creator who is most knowledgeable about the contents and usage of the graph can be provided to the user. In addition, the user can check the explanatory information to understand the contents and usage of the graph, which promotes the user's understanding of the graph.
(5) Tag information is acquired from the graph, the tag information is associated with the graph, and the tag information is stored and output so as to be viewable from the user terminal 5 of the user.
Therefore, since tag information is automatically obtained from the graph, the creator can reduce the amount of work required, and the user can conveniently check the contents of the graph by relying on the tag information.

(6) An icon corresponding to the graph is output so as to be viewable on the user terminal 5 of the user, and when a predetermined operation on the icon is received, data relating to the graph corresponding to the icon is output.
Therefore, since the graph is output as an icon, it can be displayed in a creative way. Also, the contents of the graph, which cannot be understood from the icon, can be output by performing a specific operation on the icon, so that the details of the graph can be output conveniently by user-friendly operations.

(7) Verification of the graph is requested to the user terminal 5 used by the verifier, and when the verifier has verified the graph, the graph is registered in the graph storage unit 41.
Therefore, a reliable graph can be registered.
(8) Receive inquiry information regarding the use of graphs from the user's user terminal 5, request a response to the inquiry information from the advisor's user terminal 5, receive the advisor's response information from the advisor's user terminal 5, and transmit the response information to the user's user terminal 5.
This provides a place for inquiries about the use of graphs, making it possible to provide a more user-friendly environment for users. In particular, it is useful to be able to make inquiries about combinations of graphs, since the detailed data that users can view is the details of each individual graph and is therefore unclear.

Although the embodiments of the present invention have been described above, the present invention is not limited to the above-mentioned embodiments. Furthermore, the effects described in the embodiments are merely a list of the most favorable effects resulting from the present invention, and the effects of the present invention are not limited to those described in the embodiments. Note that the above-mentioned embodiments and the modified forms described below can be used in appropriate combinations, but detailed explanations will be omitted.

(Modifications)
(1) In the present embodiment, the posting and use of a knowledge graph has been described, but the present invention is not limited to this. For example, the present invention may be used for posting and use of a knowledge dictionary required for creating a knowledge graph.

(2) Although not specifically explained in this embodiment, it is possible for a user to combine a graph they downloaded with other graphs and post the resulting graph to the data management server as the creator. In this way, a cycle can be created in which users can post further graphs that they have devised, which will revitalize the services provided by the graph management server 1.

(3) In this embodiment, a usage fee is paid when using a graph, but this is not limited to the above. For example, a special membership may be one that pays a flat usage fee regardless of the number of times the graph is used.

(4) In this embodiment, a reward is given to the creator depending on the usage situation, but this is not limited to the example. For example, a reward may also be given to the verifier. Furthermore, the reward amount may be determined by various methods, such as setting the payout rate for a graph verified by a verifier higher than the payout rate for other graphs.

(5) In this embodiment, an example has been described in which graph icons are arranged and output on a list page, but this is not limiting. For example, similar graphs may be grouped into the same group based on tag information and output. In this way, similar graphs are output together, making it possible to provide output that is easy for the user to understand.

(6) In this embodiment, various data are stored in the data storage device 4 connected to the graph management server 1, but this is not limited to the above. For example, various data may be stored in the storage unit of the graph management server.

REFERENCE SIGNS LIST 1 Graph management server 4 Data storage device 5 User terminal 10 Control unit 12 List page output unit 14 Graph registration processing unit 15 Detail output processing unit 17 Graph provision processing unit 19 Answer provision processing unit 20 Reward granting unit 21 Recommended information provision unit 30 Storage unit 31a Graph management program 32 User information storage unit 33 Reward amount storage unit 41 Graph storage unit 42 User history storage unit 51, 52 List page 61 Details page 100 Graph provision system

Claims (11)

A knowledge information management device includes a knowledge graph that expresses connections between knowledge in a graph structure and a knowledge dictionary that is used to create the knowledge graph, the knowledge information management device being communicatively connected to a creator terminal used by a creator of knowledge information related to the knowledge graph and a user terminal used by a user of the knowledge information,
a knowledge information receiving means for receiving the knowledge information created by the creator from the creator terminal;
a knowledge information registration means for registering the knowledge information received by the knowledge information receiving means in a knowledge information storage unit;
an information viewing means for outputting display information showing the knowledge information stored in the knowledge information storage unit so as to be viewable from the user terminal;
a knowledge information providing means for providing the knowledge information corresponding to the display information output by the information viewing means to the user terminal so that the knowledge information can be used;
a provision status acquisition means for acquiring a provision status of the knowledge information provided by the knowledge information providing means;
a reward providing means for providing a reward to the creator of the knowledge information according to the provision status of the knowledge information acquired by the provision status acquiring means;
A knowledge information management device comprising: 2. The knowledge information management apparatus according to claim 1,
The knowledge information providing means is a knowledge information management device that makes the knowledge information available and provides it to the user terminal in response to the user paying value information related to the use of the knowledge information. 3. The knowledge information management apparatus according to claim 2,
The reward granting means grants at least a portion of the value information paid by the user as the reward to the creator. 2. The knowledge information management apparatus according to claim 1,
the knowledge information receiving means receives the knowledge information and explanatory information relating to the content and/or usage method of the knowledge information;
the knowledge information storage unit stores the knowledge information and the explanation information in association with each other;
The information viewing means outputs the explanatory information so as to be viewable from the user terminal. 2. The knowledge information management apparatus according to claim 1,
a tag information acquiring means for acquiring tag information from the received knowledge graph when the knowledge information receiving means receives the knowledge graph;
the knowledge information storage unit stores the tag information acquired by the tag information acquisition means in association with the knowledge information;
The information viewing means outputs the tag information so as to be viewable from the user terminal. 6. The knowledge information management apparatus according to claim 5,
The information viewing means groups similar knowledge graphs into the same group based on the tag information acquired by the tag information acquisition means, and outputs the group so that the knowledge graphs can be viewed from the user terminal. 7. A knowledge information management device according to claim 1,
The information viewing means outputs a symbol corresponding to the knowledge information so as to be viewable from the user terminal;
a detail output unit that outputs at least a part of the knowledge information corresponding to the symbol when a predetermined operation on the symbol is received; 7. A knowledge information management device according to claim 1,
The knowledge information receiving means receives from the creator terminal a new knowledge graph that combines other knowledge graphs with the knowledge graph, which is the knowledge information provided by the knowledge information providing means to be usable by the user terminal. 7. A knowledge information management device according to claim 1,
a verification request means for requesting a verifier terminal used by a verifier to verify the knowledge information received by the knowledge information receiving means,
The knowledge information registration means registers the knowledge information in the knowledge information storage unit when the verifier requested by the verification request means has verified the knowledge information. 7. A knowledge information management device according to claim 1,
a query receiving means for receiving query information relating to the use of the knowledge information from the user terminal;
a response requesting means for requesting an advisor terminal used by an advisor to provide a response to the inquiry information received by the inquiry receiving means;
a response receiving means for receiving, from the advisor terminal, response information by the advisor requested by the response requesting means;
a response transmitting means for transmitting the response information received by the response receiving means to the user terminal;
Equipped with a knowledge information management device. A knowledge information providing method executed by a computer communicatively connected to each of a creator terminal used by a creator of knowledge information related to a knowledge graph, the knowledge information including a knowledge graph expressing connections between knowledge in a graph structure and a knowledge dictionary used to create the knowledge graph, and a user terminal used by a user of the knowledge information, the method comprising:
a knowledge information receiving step of receiving the knowledge information created by the creator from the creator terminal;
a knowledge information registration step of registering the knowledge information received in the knowledge information receiving step in a knowledge information storage unit;
an information viewing step of outputting display information indicating the knowledge information stored in the knowledge information storage unit so as to be viewable from the user terminal;
a knowledge information providing step of providing the knowledge information corresponding to the display information output by the information browsing step to the user terminal so that the knowledge information can be used;
a provision status acquisition step of acquiring a provision status of the knowledge information by the knowledge information provision step;
a reward providing step of providing a reward to the creator of the knowledge information according to the provision status of the knowledge information acquired in the provision status acquiring step;
A method for providing knowledge information, including:

Images