| 摘要 |
PROBLEM TO BE SOLVED: To obtain a high-speed and accurate retrieval result in node retrieval.SOLUTION: A subgraph construction section 110 of a retrieval device 100 outputs a subgraph Gafter the i-th repeated calculation after an update with a graph G used for an inquiry, a subgraph Gbefore the i-th repeated calculation before the update, and a selection node S as inputs. A random walk probability calculation section 120 outputs a probability pof a random walk for each node in the subgraph Gwith the subgraph Gafter the update as the input. An estimation value calculation section 130 outputs an estimation value of the selection node S with the probability pof the random walk for each node as the input. A candidate node calculation section 140 outputs a candidate node L with the estimation value of the selection node S and the number k of the solution nodes as inputs. A determination node calculation section 150 outputs a solution node A with the candidate node L, the estimation value of the selection node S corresponding to the candidate node L, and the number k of the solution node as inputs. |
