Abstract
We present a method of fast factorization in formal concept analysis (FCA) of data with fuzzy attributes. The output of FCA consists of a partially ordered collection of clusters extracted from a data table describing objects and their attributes. The collection is called a concept lattice. Factorization by similarity enables us to obtain, instead of a possibly large concept lattice, its factor lattice. The elements of the factor lattice are maximal blocks of clusters which are pairwise similar to degree exceeding a user-specified threshold. The factor lattice thus represents an approximate version of the original concept lattice. We describe a fuzzy closure operator the fixed points of which are just clusters which uniquely determine the blocks of clusters of the factor lattice. This enables us to compute the factor lattice directly from the data without the need to compute the whole concept lattice. We present theoretical solution and examples demonstrating the speed-up of our method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.