节点文献

基于信息论的高维海量数据离群点挖掘

Outlier Mining of the High-dimension Datasets Based on Information Theory

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 张净孙志挥宋余庆倪巍伟晏燕华

【Author】 ZHANG Jing1,2 SUN Zhi-hui1 SONG Yu-qing3 NI Wei-wei1 YAN Yan-hua3(Department of Computer Science and Engineering,Southeast University,Nanjing 210096,China)1(College of Electronic and Information Engineering,Jiangsu University,Zhenjiang 212001,China)2(College of Computer Science and Telecommunications Engineering,Jiangsu University,Zhenjiang 212001,China)3

【机构】 东南大学计算机科学与工程系江苏大学电气与信息工程学院江苏大学计算机科学与通信工程学院

【摘要】 针对高维海量数据集离群点挖掘存在"维数灾难"的问题,提出了基于信息论的高维海量数据的离群点挖掘算法。该算法采用属性选择,去除冗余属性降维。利用信息熵作为离群点判断的度量标准,消除距离和密度量纲的弊端。在真实数据集上的实验结果表明,算法对高维海量数据离群点挖掘是有效可行的,其效率和精度得到了明显提高。

【Abstract】 Phenomena of "curse of dimensionality" deteriorate lots of existing outlier mining algorithms validity.Concerning thw problem,the outlier mining algorithm of high-dimension and large datasets based on information theory was proposed.This algorithm used the concept of information entropy and the mutual information in the information theory,carried on the feature selection after using estimated mutual information value objective basis entropy power sorting,and eliminated redundant attribute for dimensionality reduction.Outlier mining using information entropy as a measure standard to judge eliminated the drawbacks of distance and density metric.The experimental result in the real data sets indicates that the algorithm for outlier mining in high-dimensional mass data is effective and feasible,its efficiency and accuracy are significantly improved.

【基金】 国家自然科学基金(40871176,60841003)资助
  • 【文献出处】 计算机科学 ,Computer Science , 编辑部邮箱 ,2011年07期
  • 【分类号】TP311.13
  • 【被引频次】32
  • 【下载频次】647
节点文献中: