Abstract
Formal concept lattices and rough set theory are two kinds of complementary mathematical tools for data analysis and data processing. The algorithm of concept lattice reduction based on variable precision rough set is proposed by combining the algorithms of β-upper and lower distribution reduction in variable precision rough set. The traditional algorithms aboutβvalue select algorithm, attribute reduction based on discernibility matrix and extraction rule in VPRS are discussed, there are defects in these traditional algorithms which are improved. Finally, the generation system of concept lattice based on variable precision rough set is designed to verify the validity of the improved algorithm and a case demonstrates the whole process of concept lattice construction.
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.
