Abstract
We show an improvement of Prisner’s upper bound for the number of concepts of a formal context. The improvement factor is of the order ( max {|G|,|M|})c, where c is the size of the biggest contranominal scale that can be found as a subcontext. We also prove that the c ∈ O(1) condition is necessary to establish that an arbitrary sequence of contexts has a polynomial number of concepts, by constructing a lower bound. Complexity aspects of calculating c are discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albano, A., do Lago, A.P.: A convexity upper bound for the number of maximal bicliques of a bipartite graph. Discrete Applied Mathematics 165, 12–24 (2011); 10th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2011)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press and McGraw-Hill Book Company (2001)
Duckworth, W., Manlove, D., Zito, M.: On the approximability of the maximum induced matching problem. J. Discrete Algorithms 3(1), 79–91 (2005)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)
Kuznetsov, S.O.: On computing the size of a lattice and related decision problems. Order 18(4), 313–321 (2001)
Prisner, E.: Bicliques in graphs I: Bounds on their number. Combinatorica 20(1), 109–117 (2000)
Schütt, D.: Abschätzungen für die Anzahl der Begriffe von Kontexten. Master’s thesis, TH Darmstadt (1987)
Stockmeyer, L.J., Vazirani, V.V.: NP-completeness of some generalizations of the maximum matching problem. Inf. Process. Lett. 15(1), 14–19 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Albano, A. (2014). Upper Bound for the Number of Concepts of Contranominal-Scale Free Contexts. In: Glodeanu, C.V., Kaytoue, M., Sacarea, C. (eds) Formal Concept Analysis. ICFCA 2014. Lecture Notes in Computer Science(), vol 8478. Springer, Cham. https://doi.org/10.1007/978-3-319-07248-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-07248-7_4
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07247-0
Online ISBN: 978-3-319-07248-7
eBook Packages: Computer ScienceComputer Science (R0)