R. Appleton, B. Slater, Connor Laitinen, L. Ammel, Cody Malnor
{"title":"Web请求预测","authors":"R. Appleton, B. Slater, Connor Laitinen, L. Ammel, Cody Malnor","doi":"10.29007/H63W","DOIUrl":null,"url":null,"abstract":"If one could predict future web requests, it would be possible to make the web much faster. One could fetch web resources before they are needed. When the human user clicks on a link, the needed data would already have been downloaded. We have created several algorithms that attempt to predict future web requests based on past histories. Our research evaluates and compares these prediction algorithms against real histories of web usage. Prediction algorithm results are compared based on correct predictions, erroneous predictions, and prediction rate. Some algorithms make predictions rarely but accurately, while others may predict more often but with less accuracy. To take full advantage of this, we combine multiple algorithms and use different voting strategies to determine the best prediction.","PeriodicalId":264035,"journal":{"name":"International Conference on Computers and Their Applications","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Web Request Predictions\",\"authors\":\"R. Appleton, B. Slater, Connor Laitinen, L. Ammel, Cody Malnor\",\"doi\":\"10.29007/H63W\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"If one could predict future web requests, it would be possible to make the web much faster. One could fetch web resources before they are needed. When the human user clicks on a link, the needed data would already have been downloaded. We have created several algorithms that attempt to predict future web requests based on past histories. Our research evaluates and compares these prediction algorithms against real histories of web usage. Prediction algorithm results are compared based on correct predictions, erroneous predictions, and prediction rate. Some algorithms make predictions rarely but accurately, while others may predict more often but with less accuracy. To take full advantage of this, we combine multiple algorithms and use different voting strategies to determine the best prediction.\",\"PeriodicalId\":264035,\"journal\":{\"name\":\"International Conference on Computers and Their Applications\",\"volume\":\"89 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Computers and Their Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.29007/H63W\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Computers and Their Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29007/H63W","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
If one could predict future web requests, it would be possible to make the web much faster. One could fetch web resources before they are needed. When the human user clicks on a link, the needed data would already have been downloaded. We have created several algorithms that attempt to predict future web requests based on past histories. Our research evaluates and compares these prediction algorithms against real histories of web usage. Prediction algorithm results are compared based on correct predictions, erroneous predictions, and prediction rate. Some algorithms make predictions rarely but accurately, while others may predict more often but with less accuracy. To take full advantage of this, we combine multiple algorithms and use different voting strategies to determine the best prediction.