研究者詳細

研究発表

54 件中 1 - 10 件目

年度 Year	題目又はセッション名 Title or Name of Session	細目 Authorship	発表年月（日） Date
年度 Year	発表学会等名称 Name, etc. of the conference at which the presentation is to be given, 主催者名称 Organizer, 掲載雑誌名等 Publishing Magazine，発行所 Publisher，巻／号 Vol./no.，頁数 Page nos.
2022	日本-南米間の技術者倫理の越境問題について考える	単独	2022/05/29
	応用哲学会第14回年次研究大会
	概要（Abstract）
	備考（Remarks）
2020	Calculation Cost Efficient Alternative to Google PageRank	未設定	2021/03/10
	電子情報通信学会2021年総合大会，電子情報通信学会
	概要（Abstract） Google PageRank is widely used by search engines and known for its high calculation cost. This study proposes an alternative to it for search systems.
	備考（Remarks）
2020	Tractable and Calculation cost efficient Alternative to Google PageRank	未設定	2020/09/23
	WAW 2020 17th Workshop on Algorithms and Models for the Web Graph
	概要（Abstract）
	備考（Remarks）
2020	Beyond Google’s PageRank: A Novel Link Analysis Algorithm without a Damping Factor	未設定	2020/07/15
	International Network for Social Network Analysis
	概要（Abstract）
	備考（Remarks）
2020	HermitianStatus: Algorithm Based on Hermitian Adjacency Matrix Alternative to Google PageRank	未設定	2020/06/28
	The 2nd International Conference on Computer Communication and the Internet
	概要（Abstract）
	備考（Remarks）
2019	Beyond Google’s PageRank: A Novel Node Ranking Approach Using Complex Numbers and the Complex Plane	未設定	2020/03/13
	The 11th International Multi-Conference on Complexity, Informatics and Cybernetics
	概要（Abstract） The Google founders, Larry Page and Sergey Brin, acquired the patent of PageRank, the algorithm for a page ranking for WWW, in 2001. Today, the search engine giant needs ultra high speed computing. One of the purposes could be speeding up PageRank calculations. This presentation proposes HermitianStatus, which is a cost efficient and manipulable algorithm for node ranking calculations as an alternative to PageRank.
	備考（Remarks）
2019	An Alternative Link Analysis Algorithm to PageRank	未設定	2020/03/03
	電子情報通信学会2020年総合大会，電子情報通信学会
	概要（Abstract） PageRank is widely used by search engines. The algorithm is known for its high cost of calculations. This paper proposes an alternative to it for search systems.
	備考（Remarks）
2019	Beyond Google’s PageRank: Using Complex Numbers in Node Ranking Calculations: Invited Speech	未設定	2019/12/19
	2019 12th International Conference on Computer Science and Information Technology (ICCSIT 2019)
	概要（Abstract） http://www.iccsit.org/key.html
	備考（Remarks）
2019	Hermitian Centrality Score as an Alternative to Google’s PageRank	単独	2019/06/23
	INSNA 2019
	概要（Abstract）
	備考（Remarks）
2018	Using Complex Numbers in Website Ranking Calculations: A Non-ad hoc Alternative to Google’s PageRank	単独	2018/12/22
	2018 11th International Conference on Computer Science and Information Technology
	概要（Abstract） This paper presents an alternative to Google's PageRank, i.e., it presents an algorithm used to calculate the score for a webpage using complex numbers that overcomes the problems inherent in Google's method. This algorithm was inspired by eigenvector centrality in social network analyses and is designed to reproduce the ranking results of Google's PageRank and to satisfy the condition of soundness. This algorithm can be developed further to achieve more desirable outcomes.
	備考（Remarks）

Page: [<<PREV] [1] [2] [3] [4] [5] [6] [NEXT>>]

<< 業績一覧に戻る

△このページの先頭へ