Jan Konecny

Martin Trnecka

Knowl. Based Syst., November, 2023

2022

Pruning techniques in LinCbO for the computation of the Duquenne-Guigues basis.

[BibT_eX]

[DOI]

Inf. Sci., 2022

LCM from FCA point of view: A CbO-style algorithm with speed-up features.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2022

On pruning techniques in map-reduce style CbO algorithms.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2022

Boolean Matrix Factorization for Data with Symmetric Variables.

[BibT_eX]

[DOI]

Martin Trnecka

Proceedings of the IEEE International Conference on Data Mining, 2022

2021

Systematic categorization and evaluation of CbO-based algorithms in FCA.

[BibT_eX]

[DOI]

Inf. Sci., 2021

LinCbO: Fast algorithm for computation of the Duquenne-Guigues basis.

[BibT_eX]

[DOI]

Inf. Sci., 2021

2020

General framework for consistencies in decision contexts.

[BibT_eX]

[DOI]

Inf. Sci., 2020

Attribute implications in L-concept analysis with positive and negative attributes: Validity and properties of models.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2020

Interface between Logical Analysis of Data and Formal Concept Analysis.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

Reinventing known results in FCA: Notes on two recently published algorithms for computation of formal concepts.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Pruning in Map-Reduce Style CbO Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Ontologies and Concepts in Mind and Machine, 2020

LCM is Well Implemented CbO: Study of LCM from FCA Point of View.

[BibT_eX]

[DOI]

Proceedings of the Fifthteenth International Conference on Concept Lattices and Their Applications, 2020

2019

Note on representing attribute reduction and concepts in concept lattice using graphs.

[BibT_eX]

[DOI]

Soft Comput., 2019

On attribute reduction in concept lattices: The polynomial time discernibility matrix-based method becomes the CR-method.

[BibT_eX]

[DOI]

Inf. Sci., 2019

L-Concept lattices with positive and negative attributes: Modeling uncertainty and reduction of size.

[BibT_eX]

[DOI]

Inf. Sci., 2019

A reduction theorem to compute fixpoints of fuzzy closure operators.

[BibT_eX]

[DOI]

Fuzzy Sets Syst., 2019

Note on m-polar fuzzy graph representation of concept lattice: How to really compute m-polar fuzzy concepts.

[BibT_eX]

[DOI]

Eng. Appl. Artif. Intell., 2019

2018

A calculus for containment of fuzzy attributes.

[BibT_eX]

[DOI]

Soft Comput., 2018

On attribute reduction in concept lattices: Experimental evaluation shows discernibility matrix based methods inefficient.

[BibT_eX]

[DOI]

Inf. Sci., 2018

On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices.

[BibT_eX]

[DOI]

Fuzzy Sets Syst., 2018

2017

On biconcepts in formal fuzzy concept analysis.

[BibT_eX]

[DOI]

Ondrej Kridlo

Inf. Sci., 2017

On attribute reduction in concept lattices: Methods based on discernibility matrix are outperformed by basic clarification and reduction.

[BibT_eX]

[DOI]

Inf. Sci., 2017

Preface of the special issue on concept lattices and their applications.

[BibT_eX]

[DOI]

Sadok Ben Yahia

Int. J. Gen. Syst., 2017

Rough Fuzzy Concept Analysis.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

Complete relations on fuzzy complete lattices.

[BibT_eX]

[DOI]

Michal Krupka

Fuzzy Sets Syst., 2017

Note on Representing attribute reduction and concepts in concepts lattice using graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Fixpoints of fuzzy closure operators via ordinary algorithms.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Conference on Fuzzy Systems, 2017

2016

Bases of closure systems over residuated lattices.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

L-concept analysis with positive and negative attributes.

[BibT_eX]

[DOI]

Inf. Sci., 2016

On homogeneous <i>L</i>-bonds and heterogeneous <i>L</i>-bonds.

[BibT_eX]

[DOI]

Int. J. Gen. Syst., 2016

Block relations in formal fuzzy concept analysis.

[BibT_eX]

[DOI]

Michal Krupka

Int. J. Approx. Reason., 2016

Attribute-oriented fuzzy concept lattices and standard fuzzy concept lattices induce the same similarity on objects.

[BibT_eX]

[DOI]

Fuzzy Sets Syst., 2016

2015

Note on the characterization and reduction of concept lattices through matroid theory.

[BibT_eX]

[DOI]

Inf. Sci., 2015

Bonds Between L -Fuzzy Contexts Over Different Structures of Truth-Degrees.

[BibT_eX]

[DOI]

Proceedings of the Formal Concept Analysis - 13th International Conference, 2015

Category of Isotone Bonds between L-fuzzy Contexts over Different Structures of Truth Degrees.

[BibT_eX]

[DOI]

Ondrej Kridlo

Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications, 2015

Using Linguistic Hedges in L-rough Concept Analysis.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications, 2015

2014

Triadic concept lattices in the framework of aggregation structures.

[BibT_eX]

[DOI]

Petr Osicka

Inf. Sci., 2014

Granularity of attributes in formal concept analysis.

[BibT_eX]

[DOI]

Bernard De Baets

Inf. Sci., 2014

Multi-adjoint concept lattices with heterogeneous conjunctors and hedges.

[BibT_eX]

[DOI]

Jesús Medina

Ann. Math. Artif. Intell., 2014

Antitone L-bonds.

[BibT_eX]

[DOI]

Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2014

Ordinal Factor Analysis of Graded Data.

[BibT_eX]

[DOI]

Cynthia Vera Glodeanu

Proceedings of the Formal Concept Analysis - 12th International Conference, 2014

Formal L-concepts with Rough Intents.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Concept Lattices and Their Applications, 2014

2013

Toward reduction of formal fuzzy context.

[BibT_eX]

[DOI]

Proceedings of the Joint IFSA World Congress and NAFIPS Annual Meeting, 2013

Isotone L-bonds.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Conference on Concept Lattices and Their Applications, 2013

2012

Concept lattices of isotone vs. antitone Galois connections in graded setting: Mutual reducibility revisited.

[BibT_eX]

[DOI]

Inf. Sci., 2012

Row and Column Spaces of Matrices over Residuated Lattices.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Simple Proof of Basic Theorem for General Concept Lattices by Cartesian Representation.

[BibT_eX]

[DOI]

Petr Osicka

Proceedings of the Modeling Decisions for Artificial Intelligence, 2012

Using Intensifying Hedges to Reduce Size of Multi-adjoint Concept Lattices with Heterogeneous Conjunctors.

[BibT_eX]

[DOI]

Jesús Medina

Proceedings of The Ninth International Conference on Concept Lattices and Their Applications, 2012

2011

Isotone fuzzy Galois connections with hedges.

[BibT_eX]

[DOI]

Inf. Sci., 2011

Zoom-In/Zoom-Out Algorithms for FCA with Attribute Granularity.

[BibT_eX]

[DOI]

Bernard De Baets

Proceedings of the Computer and Information Sciences II, 2011

Block Relations in Fuzzy Setting.

[BibT_eX]

[DOI]

Michal Krupka

Proceedings of The Eighth International Conference on Concept Lattices and Their Applications, 2011

Closure Spaces of Isotone Galois Connections and Their Morphisms.

[BibT_eX]

[DOI]

Proceedings of the AI 2011: Advances in Artificial Intelligence, 2011

2010

Optimal decompositions of matrices with grades into binary and graded matrices.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2010

General Approach to Triadic Concept Analysis.

[BibT_eX]

[DOI]

Petr Osicka

Proceedings of the 7th International Conference on Concept Lattices and Their Applications, 2010

Operators and Spaces Associated to Matrices with Grades and Their Decompositions II.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Concept Lattices and Their Applications, 2010

2007

Scaling, Granulation, and Fuzzy Attributes in Formal Concept Analysis.

[BibT_eX]

[DOI]