ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

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

Qian Yuhua*; Liang Xinyan; Wang Qi; Liang Jiye; Liu Bing; Skowron Andrzej; Yao Yiyu; Ma Jianmin; Dang Chuangyin山西大学; United States
International Journal of Approximate Reasoning2018DOI: 10.1016/j.ijar.2018.01.008
13阅读
引用收藏
分享

摘要

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.<br/>

学科与关键词

关键词
Attribute reductionAttribute reduction algorithmConcept approximationLabeled dataLinear time complexitySemi-supervisedSupervised learning methodsUnlabeled data
相关
加载中…
  • Applications of Rough Sets in Big Data Analysis: An Overview
    Pieta, Piotr*; Szmuc, TomaszInternational Journal of Applied Mathematics and Computer Science, 2021, 31(4): 659-683.被引 8
  • Dimensionality reduction based on rough set theory: A review
    Thangavel, K.; Pethalakshmi, A.*APPLIED SOFT COMPUTING, 2009, 9(1): 1-12.被引 285
  • 位运算和核属性快速识别下的粗糙集属性约简算法研究
    赵洁; 梁俊杰; 董振宁; 唐德玉小型微型计算机系统, 2015, (02): 316-321.
查看全部 →

发表信息

论文状态
公开发表
期刊
International Journal of Approximate Reasoning
发表日期
2018
卷期
第 97 卷
页码
38
DOI
10.1016/j.ijar.2018.01.008
语言
ENGLISH
期刊等级
Q2
成果收录
EI

作者

  • Q

    Qian Yuhua (通讯) (第一作者)

    shanxi university

  • L

    Liang Xinyan

    shanxi university

查看全部 9 位作者收起作者
  • W

    Wang Qi

    shanxi university

  • L

    Liang Jiye

    shanxi university

  • L

    Liu Bing

    university of illinois at chicago · united states

  • S

    Skowron Andrzej

  • Y

    Yao Yiyu

  • M

    Ma Jianmin

  • D

    Dang Chuangyin

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417