版权说明 操作指南
首页 > 成果 > 详情

The approximations in rough concept lattice and approximable concept lattice

认领
导出
下载 Link by 万方学术期刊
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Xiao, Qimei*;Lang, Guangming;Liu, Wenjun;Cai, Mingjie
通讯作者:
Xiao, Qimei
作者机构:
[Liu, Wenjun; Xiao, Qimei; Lang, Guangming] Changsha Univ Sci & Technol, Sch Math & Stat, Changsha 410004, Hunan, Peoples R China.
[Cai, Mingjie] Hunan Univ, Coll Math & Econometr, Changsha, Hunan, Peoples R China.
通讯机构:
[Xiao, Qimei] C
Changsha Univ Sci & Technol, Sch Math & Stat, Changsha 410004, Hunan, Peoples R China.
语种:
英文
关键词:
Approximation algorithms;Information analysis;Rough set theory;(formal) concept;approximable concept;Concept Lattices;Object-oriented concepts;Rough concept lattices;weak approximable concept;Formal concept analysis
期刊:
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS
ISSN:
1064-1246
年:
2017
卷:
33
期:
6
页码:
3459-3467
基金类别:
Rough set theory and formal concept analysis provide two different methods for data analysis. The notion of approximations can be introduced naturally into formal concept analysis. One of the issues studied in rough set theory is the approximation of undefinable sets through definable sets. An object-oriented concept consists of a definable set of objects and a definable set of properties. The rough concept lattice is the family of all such definable concepts. Give an arbitrary set of objects, it may not be the extension of an object-oriented concepts and attribute-oriented concepts, so we approximate it by the extension of object-oriented concept and attribute-oriented concept, respectively. Also, we construct the lower and upper approximations in approximable concept lattice, weak approximable concept lattice and rough approximable concept This work was supported by the National Science Foundation of China (No. 11401052), Hunan Provincial Education Department Foundation (No. 15B004) and the Science and Technology Program of Hunan of China (No. 2015RS4049).
机构署名:
本校为第一且通讯机构
院系归属:
数学与统计学院
摘要:
In a formal context, the lower and upper approximations of an arbitrary set of objects are constructed by object-oriented concepts, attribute-oriented concepts, approximable concepts and weak approximable concepts, respectively. We first define the concept of approximations based on lattice-Theoretic operators, and the properties of them are discussed. In order to overcome the two shortcomings in the former approximations, we present the concept of approximations based on set-Theoretic operators.The study can help further understanding of data ...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com