Abstract
In this paper we provide some complexity aspects of incremental algorithm for creation of generalized one-sided concept lattices. The novelty of this algorithm is in its possibility to work with different types of attributes and produce one-sided concept lattice from the generalized one-sided formal context. As it is shown in the paper, the complexity of the algorithm is in general exponential. However, in practice it is reasonable to consider special cases, where the number of attributes is fixed. Then complexity of presented algorithm asymptotically becomes linear function depending on the number of objects in formal context.
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.
