A New Path Filling Method on Data Preprocessing in Web Mining

Gong Wei, Baohui Tian
{"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}
引用次数: 3

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.
一种新的Web挖掘数据预处理路径填充方法
讨论了数据预处理在web挖掘中的重要性,并结合实际情况给出了网站的拓扑结构。分析文献[3]的局限性,提出一种基于邻接表的数据结构。该方法满足了现有网站拓扑结构的实际情况。给出了特殊的数据结构和基于邻接表的路径填充算法。该数据结构既满足现有网站拓扑结构的共性,又具有较低的时间复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信