首页 | 本学科首页   官方微博 | 高级检索  
     

微信息大数据粗糙集的近似约简
引用本文:任艳.微信息大数据粗糙集的近似约简[J].沈阳工业大学学报,2016,38(3):309-313.
作者姓名:任艳
作者单位:新疆财经大学 计算机科学与工程学院, 乌鲁木齐 830012
摘    要:为了应对微信息舆情数据的格式复杂、价值稀疏和收集困难等大数据处理技术难题,基于隐含语义分析和粗糙集近似约简理论,设计微信息的数据区间值集和近似匹配分类算法.在不影响数据主要关联关系的原则下,提炼核心属性、消减次要属性,实现一种微信息异常主题倾向的发现方法.结果表明,该近似约简算法能在完成微信息兴趣倾向主题分类的前提下,将数据集属性大幅度缩减,提高微信息的信息挖掘效率,为微信息大数据舆情处理工作提供了新的思路和案例.

关 键 词:大数据  微信息  近似约简  粗糙集  隐含语义分析  主题发现  区间值  近似集  

Approximate reduction of micro message big data rough set
REN Yan.Approximate reduction of micro message big data rough set[J].Journal of Shenyang University of Technology,2016,38(3):309-313.
Authors:REN Yan
Affiliation:School of Computer Science and Engineering, Xinjiang University of Finance &Economy, Urumqi 830012, China
Abstract:In order to deal with such technological problems in big data processing as complex format, sparse value and difficult collection of micro message public opinion data, based on the latent semantic analysis (LSA) and rough set approximate reduction theory, the data interval value set and approximate matching classification algorithm of micro message were designed. Under the principle of not affecting the main association relationship of data, the core attributes were extracted, the secondary attributes were reduced, and a method of discovering the micro message abnormal theme tendency was realized. The results show that under the premise of completing the classification of micro message interest tendency themes, the proposed approximate reduction algorithm can greatly reduce the data set properties, improve the information mining efficiency of micro message, and provide a new thought and case for the processing work of public opinion of micro message big data.
Keywords:big data  micro-message  approximate reduction  rough set  latent semantic analysis  theme discovery  interval value  approximation set  
本文献已被 CNKI 等数据库收录!
点击此处可从《沈阳工业大学学报》浏览原始摘要信息
点击此处可从《沈阳工业大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号