首页> 外文期刊>Information Technology Journal >A Rough Sets Based Data Preprocessing Algorithm for Web Structure Mining
【24h】

A Rough Sets Based Data Preprocessing Algorithm for Web Structure Mining

机译:基于粗糙集的Web结构挖掘数据预处理算法。

获取原文
           

摘要

Aimed to enhance the efficiency of web structure mining, based on the Rough Sets (RS), an effective web structure mining preprocessing algorithm is proposed in this paper. Firstly, to linear the huge web link graph, the Vast Forward Path (VFP) is introduced and extracted from the user access record in web server logs. Secondly, to build the data analysis model, the Information System is constructed using the VFP. Thirdly, the paper make using of the attribute reduction theory of RS; the Information System is reduced by eliminate a lot of abundant attributes. The experiments show that the proposed algorithm can get high efficiency and avoid the abundant web redundant data.
机译:为了提高网络结构挖掘的效率,基于粗糙集(RS),提出了一种有效的网络结构挖掘预处理算法。首先,为了线性化庞大的Web链接图,引入了Vast Forward Path(VFP),并从Web服务器日志中的用户访问记录中提取了VFP。其次,为了建立数据分析模型,使用VFP构建信息系统。第三,利用RS的属性约简理论。通过消除许多丰富的属性来减少信息系统。实验表明,所提算法能达到较高的效率,避免了大量的网络冗余数据。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号