{"title":"基于连通性推理的在线搜索范围重构","authors":"Michael Chan, Stephen Chi-fai Chan, C. Leung","doi":"10.1109/WI.2007.142","DOIUrl":null,"url":null,"abstract":"To cope with the continuing growth of the web, improvements should be made to the current brute-force techniques commonly used by robot-driven search engines. We propose a model that strikes a balance between robot and directory- based search engines by expanding the search scope of conventional directories to automatically include related categories. Our model makes use of a knowledge-rich and well- structured corpus to infer relationships between documents and topic categories. We show that the hyperlink structure ofWikipedia articles can be effectively exploited to identify relations among topic categories. Our experiments show the average recall rate and precision rate achieved are 91% and between 85% and 215% of Google's respectively.","PeriodicalId":192501,"journal":{"name":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Online Search Scope Reconstruction by Connectivity Inference\",\"authors\":\"Michael Chan, Stephen Chi-fai Chan, C. Leung\",\"doi\":\"10.1109/WI.2007.142\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To cope with the continuing growth of the web, improvements should be made to the current brute-force techniques commonly used by robot-driven search engines. We propose a model that strikes a balance between robot and directory- based search engines by expanding the search scope of conventional directories to automatically include related categories. Our model makes use of a knowledge-rich and well- structured corpus to infer relationships between documents and topic categories. We show that the hyperlink structure ofWikipedia articles can be effectively exploited to identify relations among topic categories. Our experiments show the average recall rate and precision rate achieved are 91% and between 85% and 215% of Google's respectively.\",\"PeriodicalId\":192501,\"journal\":{\"name\":\"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WI.2007.142\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI.2007.142","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Online Search Scope Reconstruction by Connectivity Inference
To cope with the continuing growth of the web, improvements should be made to the current brute-force techniques commonly used by robot-driven search engines. We propose a model that strikes a balance between robot and directory- based search engines by expanding the search scope of conventional directories to automatically include related categories. Our model makes use of a knowledge-rich and well- structured corpus to infer relationships between documents and topic categories. We show that the hyperlink structure ofWikipedia articles can be effectively exploited to identify relations among topic categories. Our experiments show the average recall rate and precision rate achieved are 91% and between 85% and 215% of Google's respectively.