Formal Concept Analysis Based on Rough Set Theory and a Construction Algorithm of Rough Concept Lattice

被引：0

作者：

Yang, Haifeng ^{[1
]}

机构：

[1] TaiYuan Univ Sci & Technol, Sch Comp Sci & Technol, Taiyuan, Peoples R China

来源：

EMERGING RESEARCH IN ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL INTELLIGENCE | 2011年 / 237卷

关键词：

Formal Concept Analysis; Rough Set; Intent; Approximation; Extent;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

FCA(Formal Concept Analysis), which is accurate and complete in knowledge representation, is an effective tool for data analysis and knowledge discovery. A new lattice structure named RCL (Rough Concept Lattice) is presented. Using the approximation method of rough sets, we described the extent as approximation extent so that it can deal with uncertainty knowledge. In the end, a construction algorithm CARCL is provided based on it.

引用

页码：239 / 244

页数：6

共 7 条

[1] INCREMENTAL CONCEPT-FORMATION ALGORITHMS BASED ON GALOIS (CONCEPT) LATTICES
GODIN, R
MISSAOUI, R
ALAOUI, H
[J]. COMPUTATIONAL INTELLIGENCE, 1995, 11 (02) : 246 - 267
[2] Hu K., 2000, TSINGHUA U SCI TECH, V40, P77
[3] [强宇 Qiang Yu], 2005, [电子学报, Acta Electronica Sinica], V33, P350
[4] Qiu Wei-gen, 2008, Computer Engineering, V34, P16
[5] Representation and extension of rough set theory based on formal concept analysis
Qu, Kai-She
Zhai, Yan-Hui
Liang, Ji-Ye
Li, De-Yu
[J]. Ruan Jian Xue Bao/Journal of Software, 2007, 18 (09): : 2174 - 2182
[6] Wille R., 1982, M RIVAL I ORDERED SE, P415
[7] Xie Z.P., 2002, J. Comput. Sci., V25, P490

← 1 →