计算机科学 ›› 2011, Vol. 38 ›› Issue (7): 148-151.
• 数据库与数据挖掘 • 上一篇 下一篇
张 净,孙志挥,宋余庆,倪巍伟,晏燕华
出版日期:
发布日期:
基金资助:
ZHANG Jing,SUN Zhi-hui,SONG Yu-qing,NI Wei-wei,YAN Yan-hua
Online:
Published:
摘要: 针对高维海量数据集离群点挖掘存在“维数灾难”的问题,提出了基于信息论的高维海量数据的离群点挖掘算法。该算法采用属性选择,去除冗余属性降维。利用信息嫡作为离群点判断的度量标准,消除距离和密度量纲的弊端。在真实数据集上的实验结果表明,算法对高维海量数据离群点挖掘是有效可行的,其效率和精度得到了明显提高。
关键词: 离群点挖掘,信息论,属性选择,嫡,互信息
Abstract: Phenomena of "curse of dimensionality" deteriorate lots of existing outlier mining algorithms validity. Conconing 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 outlicr mining in high-dimensional mass data is effective and feasible, its efficiency and accuracy arc significantly improved.
Key words: Outlier mining, Information theory, Feature selection, Entropy, Mutual information
张 净,孙志挥,宋余庆,倪巍伟,晏燕华. 基于信息论的高维海量数据离群点挖掘[J]. 计算机科学, 2011, 38(7): 148-151. https://doi.org/
ZHANG Jing,SUN Zhi-hui,SONG Yu-qing,NI Wei-wei,YAN Yan-hua. Outlier Mining of the High-dimension Datasets Based on Information Theory[J]. Computer Science, 2011, 38(7): 148-151. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2011/V38/I7/148
Cited