{"title":"融合元胞自动机技术与网页搜寻方法,提供超连结网页排名的新方法","authors":"A. Kundu, R. Dutta, D. Mukhopadhyay","doi":"10.1109/ISITC.2007.36","DOIUrl":null,"url":null,"abstract":"Search for any topic or a word using Web search engine depends on its ranking mechanism. Generally, search engine sorts through the millions of Web pages and then present the significant Web-pages that match search topic of the user. These matches will be further ranked, so that the most relevant ones come first. This paper proposes an alternate way to rank hyper-linked Web page through analysis of link structure. This link structure is stored in an efficient way to minimize the storage space using Galois Extension Field GF (2P).","PeriodicalId":394071,"journal":{"name":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Converging Cellular Automata Techniques with Web Search Methods to Offer a New Way to Rank Hyper-linked Web-Pages\",\"authors\":\"A. Kundu, R. Dutta, D. Mukhopadhyay\",\"doi\":\"10.1109/ISITC.2007.36\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Search for any topic or a word using Web search engine depends on its ranking mechanism. Generally, search engine sorts through the millions of Web pages and then present the significant Web-pages that match search topic of the user. These matches will be further ranked, so that the most relevant ones come first. This paper proposes an alternate way to rank hyper-linked Web page through analysis of link structure. This link structure is stored in an efficient way to minimize the storage space using Galois Extension Field GF (2P).\",\"PeriodicalId\":394071,\"journal\":{\"name\":\"2007 International Symposium on Information Technology Convergence (ISITC 2007)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Symposium on Information Technology Convergence (ISITC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITC.2007.36\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITC.2007.36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Converging Cellular Automata Techniques with Web Search Methods to Offer a New Way to Rank Hyper-linked Web-Pages
Search for any topic or a word using Web search engine depends on its ranking mechanism. Generally, search engine sorts through the millions of Web pages and then present the significant Web-pages that match search topic of the user. These matches will be further ranked, so that the most relevant ones come first. This paper proposes an alternate way to rank hyper-linked Web page through analysis of link structure. This link structure is stored in an efficient way to minimize the storage space using Galois Extension Field GF (2P).