优先关联的Web日志数据逼真生成算法  

Simulate Generating Web Log Algorithm Using Fields' Priority Relevance

作　　者：丘志鹏[1,2] 肖如良[1,2] 张锐[1,2] QIU Zhi-Peng XIAO Ru-Liang ZHANG Rui(Faculty of Software, Fujian Normal University, Fuzhou 350117, China Fujian Provincial Engineering Research Center of Public Service Big Data Analysis and Application, Fuzhou 350117, China)

机构地区：[1]福建师范大学软件学院,福州350117 [2]福建省公共服务大数据挖掘与应用工程研究中心,福州350117

出　　处：《计算机系统应用》2017年第3期126-133,共8页Computer Systems & Applications

基　　金：福建省科技计划重大项目(2016H6007)

摘　　要：字段关联的构建方法是Web数据逼真生成中的困难问题.提出一种基于MIC的字段优先关联的Web数据逼真生成算法.该算法与现有的方法完全不同:首先,提取真实Web日志数据集中相应字段间的MIC系数;然后,结合字段的重尾特性,采用SE分布对字段的重尾性进行建模;最后,建立字段关联模型,模拟出真实数据集中的字段间依赖性,从而逼真生成目标数据集.实验表明,生成的数据集能够保持合理的字段间的均衡性以及节点间的相似性.The construction method of field relevance is a difficult problem in the Web data generation. A new algorithm for fields＇ priority relevance based on maximal information coefficient is proposed. The algorithm is completely different from the existing method. Firstly, the maximal information coefficient between the appropriate fields needs to be extracted from real Web log data. Then, combined with the field of heavy tailed characteristics, the field is modeled by stretched exponential distribution. Finally, real data＇s field dependence is simulated by the fields＇ relevance model, so as to generate a realistic target data set. The experiments show that the generated data sets can maintain a reasonable balance between the fields and the similarity between the nodes.

关 键 词：字段关联 数据生成 MIC系数 重尾 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]