arrow
返回

Local rough set: A solution to rough data analysis in big data

delete2018-06-01
delete148
PRE
AI
钱宇华 封面图
钱宇华 (Yuhua Qian) *
X
Xinyan Liang
Q
Qi Wang
J
Jiye Liang
B
Bing Liu
A
Andrzej Skowron
Y
Yiyu Yao
C
Chuangyin Dang
DOI:10.1016/j.ijar.2018.01.008delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
As a supervised learning method, classical rough set theory often requires a large amount of labeled data, in which concept approximation and attribute reduction are two key issues. With the advent of the age of big data however, labeling data is an expensive and laborious task and sometimes even infeasible, while unlabeled data are cheap and easy to collect. Hence, techniques for rough data analysis in big data using a semi-supervised approach, with limited labeled data, are desirable. Although many concept approximation and attribute reduction algorithms have been proposed in the classical rough set theory, quite often, these methods are unable to work well in the context of limited labeled big data. The challenges to classical rough set theory can be summarized with three issues: limited labeled property of big data, computational inefficiency and over-fitting in attribute reduction. To address these three challenges, we introduce a theoretic framework called local rough set, and develop a series of corresponding concept approximation and attribute reduction algorithms with linear time complexity, which can efficiently and effectively work in limited labeled big data. Theoretical analysis and experimental results show that each of the algorithms in the local rough set significantly outperforms its original counterpart in classical rough set theory. It is worth noting that the performances of the algorithms in the local rough set become more significant when dealing with larger data sets. (C) 2018 Elsevier Inc. All rights reserved.
Keyword:
Rough set theory
Local rough set
Concept approximation
Attribute reduction
Limited labeled data
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

International Journal of Approximate Reasoning 封面图
International Journal of Approximate Reasoning
IF:
3
论文数:
3.0K
被引数:
5.1K

机构

P
Polish Academy of Sciences
学者数:
3.0W
论文数: 3.1W
被引数: 3.1W
U
University of Warsaw
学者数:
1.2W
论文数: 1.1W
被引数: 1.1W
U
University of Illinois Chicago
学者数:
1.7W
论文数: 1.4W
被引数: 3.0W
S
Shanxi University
学者数:
1.3W
论文数: 8.4K
被引数: 1.2W
University of Illinois System 封面图
University of Illinois System
学者数:
6.9W
论文数: 6.2W
被引数: 644
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
Set-based granular computing: A lattice model
err2014-03-01
err57
errOAAI
errQian, Yuhua; Zhang, Hu; Li, Feijiang; Hu, Qinghua; Liang, Jiye
err分享
err收藏
err分享
err收藏
VIP
err2002-05-22
err0
PREAI
errAntonella De Angeli; Mike Coutts; Lynne Coventry; Graham I. Johnson; David Cameron; Martin H. Fischer
err分享
err收藏
err分享
err收藏
Antifungal Effects of Ozonated Water on Aspergillus parasiticus: A New Approach to Prevent Wheat Contamination
err2015-03-17
err0
PREAI
errM. Mohammadi Kouchesfahani; M. Alimohammadi; G. Jahed Khaniki; R. Nabizadeh Nodehi; Z. Aghamohseni; M. Moazeni; S. Rezaie
err分享
err收藏
err分享
err收藏
err分享
err收藏
Digital Image Analysis in Turfgrass Research
err2015-10-26
err0
PREAI
errDouglas E. Karcher; Michael D. Richardson
err分享
err收藏
学者 查看更多内容