RELATIONSHIP GRAPH INTERLINKAGE SYSTEM

• US 20160110476A1
• Filed: 05/20/2014
• Published: 04/21/2016
• Est. Priority Date: 05/31/2013
• Status: Abandoned Application

• Current Assignee: Kobe Digital Labo Inc., Kyoto University
• Original Assignee: Kobe Digital Labo Inc., Kyoto University
• Inventors: SHINKUMA, Ryoichi, YAMAGUCHI, Kazuhiro
• Application Number:
  US14/894,636
• Publication Number:
  US 20160110476A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/28 Databases characterised by their database models, e.g. relational or object models
• CPC Class Codes: G06F 16/288 Entity relationship models
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques

Abstract

A relationship graph interlinkage system includes a plurality of relationship graph databases 20 which stores a plurality of relationship graphs respectively, a selected information acceptance unit 101 which accepts selected information from a terminal device 40 via a computer network, a relationship graph selection unit 102 which selects a plurality of the relationship graphs from the relationship graph databases based on the selected information, a relationship graph evaluation unit 103 which evaluates each relationship graph by measuring a parameter of the node contained in each relationship graph, a parameter evaluation unit 104 which evaluates the parameter of the node contained in each relationship graph evaluated by the relationship graph evaluation unit 103, an output node determination unit 105 which determines node to be output to a terminal device via a computer network based on a result of evaluation of the parameter by the parameter evaluation unit 104.

Claims

1. A relationship graph interlinkage system configured to mutually link a plurality of relationship graphs connecting a plurality of nodes with links, comprising:

a plurality of relationship graph databases configured to store the plurality of relationship graphs respectively;

a selected information acceptance unit configured to accept selected information from a terminal device via a computer network;

a relationship graph selection unit configured to select a plurality of the relationship graphs from the relationship graph databases based on the selected information accepted by the selected information acceptance unit;

a relationship graph evaluation unit configured to evaluate each relationship graph by measuring a parameter of a node contained in each relationship graph selected by the relationship graph selection unit;

a parameter evaluation unit configured to evaluate the parameter of the node contained in each relationship graph evaluated by the relationship graph evaluation unit; and

an output node determination unit configured to determine a node to be output to the terminal device via the computer network based on a result of evaluation of the parameter by the parameter evaluation unit.

2. The relationship graph interlinkage system as recited in claim 1,

wherein the relationship graph evaluation unit selects a reference point node which becomes a reference point from the nodes contained in the relationship graphs, and measures a distance from the reference point node to each predetermined node as a parameter.

3. The relationship graph interlinkage system as recited in claim 2,

wherein the relationship graph evaluation unit creates anode list showing each predetermined node and distances from the reference point node to each predetermined node in a manner as to be sorted by descending order or ascending order of the distance.

4. The relationship graph interlinkage system as recited in claim 3,

wherein, when evaluating the distance of each node contained in each relationship graph evaluated by the relationship graph evaluation unit, the parameter evaluation unit mutually compares the node list of each relationship graph and extracts a node by subtracting an upper node in another node list from an upper node in one node list.

5. The relationship graph interlinkage system as recited in claim 1,

wherein the relationship graph evaluation unit measures a number of connections of each predetermined node contained in the relationship graph.

6. The relationship graph interlinkage system as recited in claim 5,

wherein the relationship graph evaluation unit creates anode list showing each node and a number of connections of each node in a manner as to be sorted by descending order or ascending order of the number.

7. The relationship graph interlinkage system as recited in claim 6,

wherein, when evaluating the number of connections of each node contained in each relationship graph evaluated by the relationship graph evaluation unit, the parameter evaluation unit mutually compares the node list of each relationship graph and extracts a node which is larger in increase or decrease in the number of connections of another list with respect to the number of connections of one node list.

8. The relationship graph interlinkage system as recited in claim 1,

wherein the relationship graph evaluation unit measures reliability of each predetermined node contained in the relationship graphs as a parameter.

9. The relationship graph interlinkage system as recited in claim 8,

wherein the relationship graph evaluation unit creates anode list showing each node and reliability of each node in a manner as to be sorted by descending order or ascending order of the reliability.

10. The relationship graph interlinkage system as recited in claim 9,

wherein, when evaluating the reliability of each node contained in the relationship graph evaluated by the relationship graph evaluation unit, the parameter evaluation unit mutually evaluates that the relationship graph should not be employed when the reliability of each node is low.

11. The relationship graph interlinkage system as recited in claim 1,

wherein the relationship graph evaluation unit evaluates each relationship graph selected by the relationship graph selection unit in parallel, and

wherein the parameter evaluation unit mutually evaluates the parameter of the node contained in each relationship graph evaluated in parallel by the relationship graph evaluation unit.

12. The relationship graph interlinkage system as recited in claim 1,

wherein the relationship graph evaluation unit evaluates one relationship graph selected by the relationship graph selection unit, and the parameter evaluation unit evaluates the parameter of the node contained in the one relationship graph evaluated by the relationship graph evaluation unit, and thereafter

the relationship graph evaluation unit evaluates another relationship graph selected by the relationship graph selection unit based on a result of evaluation of the parameter of the node contained in the one relationship graph evaluated by the relationship graph evaluation unit, and the parameter evaluation unit evaluates the parameter of the node contained in the another relationship graph evaluated by the relationship graph evaluation unit.