{"title":"Web访问模式挖掘——一种新方法","authors":"A. Rajimol, G. Raju","doi":"10.1504/IJWS.2014.066434","DOIUrl":null,"url":null,"abstract":"An efficient web access pattern mining algorithm, FOL-mine is presented in this paper. The FOL-mine algorithm is based on the projected database of each frequent event and eliminates the need for construction of pattern tree. A data structure, first occurrence list (FOL), is introduced in the proposed algorithm for efficient handling of suffix building. Rebuilding of projection databases is completely eliminated in the new method. Experimental analysis of the algorithms reveals significant performance gain over other web access pattern mining algorithms.","PeriodicalId":425045,"journal":{"name":"Int. J. Web Sci.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Web access pattern mining - a new method\",\"authors\":\"A. Rajimol, G. Raju\",\"doi\":\"10.1504/IJWS.2014.066434\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An efficient web access pattern mining algorithm, FOL-mine is presented in this paper. The FOL-mine algorithm is based on the projected database of each frequent event and eliminates the need for construction of pattern tree. A data structure, first occurrence list (FOL), is introduced in the proposed algorithm for efficient handling of suffix building. Rebuilding of projection databases is completely eliminated in the new method. Experimental analysis of the algorithms reveals significant performance gain over other web access pattern mining algorithms.\",\"PeriodicalId\":425045,\"journal\":{\"name\":\"Int. J. Web Sci.\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Web Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJWS.2014.066434\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Web Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJWS.2014.066434","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An efficient web access pattern mining algorithm, FOL-mine is presented in this paper. The FOL-mine algorithm is based on the projected database of each frequent event and eliminates the need for construction of pattern tree. A data structure, first occurrence list (FOL), is introduced in the proposed algorithm for efficient handling of suffix building. Rebuilding of projection databases is completely eliminated in the new method. Experimental analysis of the algorithms reveals significant performance gain over other web access pattern mining algorithms.