2022 Fiscal Year Final Research Report
A Study for the Search Engine Algorithm based-on Link-Analysis Using Complex Numbers
| Project/Area Number |
20K11856
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Review Section |
Basic Section 60100:Computational science-related
|
|---|
| Research Institution | Nanzan University |
|---|
Principal Investigator |
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
嶋田 創 名古屋大学, 情報基盤センター, 准教授 (60377851)
|
|---|
| Project Period (FY) |
2020-04-01 – 2023-03-31
|
| Keywords | 情報検索 / PageRank / エルミート行列 / エルミート隣接行列 |
|---|
| Outline of Final Research Achievements |
PageRank is the widely used algorithm for search engines based-on link-analysis of the network. PageRank algorithm has problems such as high calculation cost. Improved PageRank algorithms have been increasingly studied. Those studies employ the adjacency matrix of the network as with PageRank. However, there is a concern that the problems of PageRank cannot be solved by the matrix. This study has utilized the Hermitian adjacency matrix to score a node of the network. By using the matrix, the study studied how a similar tendency ranking result with PageRank can be realized and how the problems of PageRank are revolved.
|
| Free Research Field |
エルミート隣接行列
|
| Academic Significance and Societal Importance of the Research Achievements |
情報検索のための PageRank はネットワークのリンク解析によるノードへのスコア付与アルゴリズムとして広く普及しており，これに替わる手法の開発には社会的な意義が認められる．
|
