Abstract
In this paper we provide experimental study on time complexity of GOSCL algorithm according to the sparseness of the input data table. GOSCL is incremental algorithm for the creation of Generalized One-Sided Concept Lattices, which is related to well-known Formal Concept Analysis area, but with the possibility to work with different types of attributes and to produce one-sided concept lattice from the generalized one-sided formal context. Generally, FCA-based algorithms are exponential. However, in practice there are many inputs for which the complexity is reduced. One of the special cases is related to the high number of (bottom elements) in data table for so-called sparse data matrices, which is characteristic for some inputs like document-term matrix in text-mining analysis. We describe experimentally the influence of sparseness of data tables on time complexity of GOSCL with different distributions of zeros generated artificially randomly or according to the standard text-mining datasets.
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.
