{"title":"基于复数的节点排序计算","authors":"K. Sugihara","doi":"10.1109/ICCCI51764.2021.9486803","DOIUrl":null,"url":null,"abstract":"Google PageRank is widely used by search engines and known for its high calculation cost. This study proposes the usage of complex numbers in node ranking calculations for a network. The node scores are calculated in the graph using the Hermitian adjacency matrix and the complex plane through an algorithm, called HermitianStatus. The result of the proposed method is then compared to that of Google PageRank. In conclusion, HermitianStatus has advantages over PageRank.","PeriodicalId":180004,"journal":{"name":"2021 3rd International Conference on Computer Communication and the Internet (ICCCI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Complex Number-Based Node Ranking Calculation\",\"authors\":\"K. Sugihara\",\"doi\":\"10.1109/ICCCI51764.2021.9486803\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Google PageRank is widely used by search engines and known for its high calculation cost. This study proposes the usage of complex numbers in node ranking calculations for a network. The node scores are calculated in the graph using the Hermitian adjacency matrix and the complex plane through an algorithm, called HermitianStatus. The result of the proposed method is then compared to that of Google PageRank. In conclusion, HermitianStatus has advantages over PageRank.\",\"PeriodicalId\":180004,\"journal\":{\"name\":\"2021 3rd International Conference on Computer Communication and the Internet (ICCCI)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 3rd International Conference on Computer Communication and the Internet (ICCCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCI51764.2021.9486803\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 3rd International Conference on Computer Communication and the Internet (ICCCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCI51764.2021.9486803","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Google PageRank is widely used by search engines and known for its high calculation cost. This study proposes the usage of complex numbers in node ranking calculations for a network. The node scores are calculated in the graph using the Hermitian adjacency matrix and the complex plane through an algorithm, called HermitianStatus. The result of the proposed method is then compared to that of Google PageRank. In conclusion, HermitianStatus has advantages over PageRank.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
