{"title":"一种新的Web挖掘数据预处理路径填充方法","authors":"Gong Wei, Baohui Tian","doi":"10.1109/ICCECT.2012.218","DOIUrl":null,"url":null,"abstract":"Discuss the importance of data preprocessing in web mining and give the topology structure for the website in the view of actual condition. Analyze the limitation of reference [3] and propose a data structure based on adjacency list. The proposed method satisfies the actual condition of topology structure for the existed website. The special data structure and path filling algorithm based on adjacency list are given. The data structure satisfies the commonness of topology structure for the existed website and the time complexity is lower.","PeriodicalId":153613,"journal":{"name":"2012 International Conference on Control Engineering and Communication Technology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A New Path Filling Method on Data Preprocessing in Web Mining\",\"authors\":\"Gong Wei, Baohui Tian\",\"doi\":\"10.1109/ICCECT.2012.218\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Discuss the importance of data preprocessing in web mining and give the topology structure for the website in the view of actual condition. Analyze the limitation of reference [3] and propose a data structure based on adjacency list. The proposed method satisfies the actual condition of topology structure for the existed website. The special data structure and path filling algorithm based on adjacency list are given. The data structure satisfies the commonness of topology structure for the existed website and the time complexity is lower.\",\"PeriodicalId\":153613,\"journal\":{\"name\":\"2012 International Conference on Control Engineering and Communication Technology\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Control Engineering and Communication Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCECT.2012.218\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Control Engineering and Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCECT.2012.218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A New Path Filling Method on Data Preprocessing in Web Mining
Discuss the importance of data preprocessing in web mining and give the topology structure for the website in the view of actual condition. Analyze the limitation of reference [3] and propose a data structure based on adjacency list. The proposed method satisfies the actual condition of topology structure for the existed website. The special data structure and path filling algorithm based on adjacency list are given. The data structure satisfies the commonness of topology structure for the existed website and the time complexity is lower.