Abstract

High complexity of formal concept, analysis algorithms and lattice construction algorithms are main problems today. If we want to compute all concepts from huge incidence matrix, complexity plays a great role. In some cases, we do not need to compute all concepts, but only some of them. Our research focuses on behavior of the concept lattice reduction after using matrix decompositions. Modified matrix has lower dimensions and acts as input for some known algorithms for lattice construction. In this paper we want to describe the deferent between methods for matrix decompositions and describe their influence on the concept lattice.

Full Text
Paper version not known

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 call

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.