References: [1] Ganter, Bernard and Wille, Rudolf. (1999). Formal Concept Analysis: Mathematical Foundations, Springer-Verlag, 1999. [2] Kuznetsov, S.O. (1993). A Fast Algorithm for Computing all Intersections of Objects in a Finite Semi-Lattice. Autom. Doc. Math. Linguist. 27: 5, 11-21. [3] Kuznetsov, S.O. (2004). Complexity of Learning in Concept Lattices from Positive and Negative Examples. Discrete Applied Mathematics, 142 (1-3), p 111– 125. [4] Kuznetsov, S.O. (2004). Machine Learning and Formal Concept Analysis. Proceedings 2nd International Conference on Formal Concept Analysis: Springer LNAI, Volume 2961 p 287-312. [5] Makhalova, T. P., Kuznetsov, S.O. (2017). On Overfitting of Classifiers Making a Lattice. Proc. 14th International Conference on Formal Concept Analysis: Springer LNAI, Volume 10308. – 2017. p 184-197. [6] Vinogradov, D.V. (2013). A Markov Chain Approach to Random Generation of Formal Concepts. Proceedings of the Workshop Formal Concept Analysis Meets Information Retrieval (FCAIR 2013): CEUR Workshop Proceedings, 977, p. 127–133. [7] Vinogradov, D.V. (2017). Accidental Formal Concepts in the Presence of Counterexamples. Proceedings of International Workshop on Formal Concept Analysis for Knowledge Discovery (FCA4KD 2017): CEUR Workshop Proceedings, Volume 1921, p 104–112. [8] Vorontsov, K.V., Ivahnenko, A. (2011). Tight Combinatorial Generalization Bounds for Threshold Conjunction Rules. Proceedings of 4th International Conference on Pattern Recognition and Machine Intelligence. p 66-73. |