摘要
Formal Concept Analysis and Rough Set Theory offer related and complementary approaches for data analysis. Many efforts have been made to compare and combine the two theories. In this paper, a transformation design is proposed from a partition to concept lattice. This method selects the max-covered attributes decision-set from the equivalence classes to assist generating the new concepts and an index-tree is applied to control the process of the lattice-building. This algorithm indicates a deferent aspect of the relationship between the Rough set and Concept lattice.
| 源语言 | 英语 |
|---|---|
| 主期刊名 | International Conference on Internet Technology and Applications, ITAP 2010 - Proceedings |
| DOI | |
| 出版状态 | 已出版 - 2010 |
| 活动 | International Conference on Internet Technology and Applications, ITAP 2010 - Wuhan, 中国 期限: 21 8月 2010 → 23 8月 2010 |
出版系列
| 姓名 | International Conference on Internet Technology and Applications, ITAP 2010 - Proceedings |
|---|
会议
| 会议 | International Conference on Internet Technology and Applications, ITAP 2010 |
|---|---|
| 国家/地区 | 中国 |
| 市 | Wuhan |
| 时期 | 21/08/10 → 23/08/10 |
指纹
探究 'RtoC: A new concept lattice building method by RST' 的科研主题。它们共同构成独一无二的指纹。引用此
Gao, Y., & Shi, C. (2010). RtoC: A new concept lattice building method by RST. 在 International Conference on Internet Technology and Applications, ITAP 2010 - Proceedings 文章 5566115 (International Conference on Internet Technology and Applications, ITAP 2010 - Proceedings). https://doi.org/10.1109/ITAPP.2010.5566115