Abstract
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.
Original language | English |
---|---|
Title of host publication | International Conference on Internet Technology and Applications, ITAP 2010 - Proceedings |
DOIs | |
Publication status | Published - 2010 |
Event | International Conference on Internet Technology and Applications, ITAP 2010 - Wuhan, China Duration: 21 Aug 2010 → 23 Aug 2010 |
Publication series
Name | International Conference on Internet Technology and Applications, ITAP 2010 - Proceedings |
---|
Conference
Conference | International Conference on Internet Technology and Applications, ITAP 2010 |
---|---|
Country/Territory | China |
City | Wuhan |
Period | 21/08/10 → 23/08/10 |
Fingerprint
Dive into the research topics of 'RtoC: A new concept lattice building method by RST'. Together they form a unique fingerprint.Cite this
Gao, Y., & Shi, C. (2010). RtoC: A new concept lattice building method by RST. In International Conference on Internet Technology and Applications, ITAP 2010 - Proceedings Article 5566115 (International Conference on Internet Technology and Applications, ITAP 2010 - Proceedings). https://doi.org/10.1109/ITAPP.2010.5566115