Abstract
Concept lattice and rough set are powerful tools for data analyzing and processing, has been successfully applied to many fields. However, the decision information is incomplete in many information systems. In this paper, the definition of incomplete concept lattice has been proposed, and some relation established between imperfect concept lattice and rough set. As is very important that the paper gives a new attributes reduction algorithm about incomplete concept lattice aims at the matter of the inefficient of reduction strategy based on discernibility matrix. Comparing with the attributes reduction for incomplete concept lattice which based on discernibility matrix, this reduction algorithm, reduces the spatial-temporal complexity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
