LCM from FCA point of view: A CbO-style algorithm with speed-up features | 0 | 0.34 | 2022 |
Lincbo: Fast Algorithm For Computation Of The Duquenne-Guigues Basis | 0 | 0.34 | 2021 |
Systematic categorization and evaluation of CbO-based algorithms in FCA | 1 | 0.35 | 2021 |
LCM is well implemented CbO: study of LCM from FCA point of view | 0 | 0.34 | 2020 |
Interface between Logical Analysis of Data and Formal Concept Analysis | 2 | 0.36 | 2020 |
Pruning in Map-Reduce Style CbO Algorithms. | 0 | 0.34 | 2020 |
General framework for consistencies in decision contexts | 0 | 0.34 | 2020 |
Reinventing known results in FCA: Notes on two recently published algorithms for computation of formal concepts | 0 | 0.34 | 2020 |
Attribute implications in L-concept analysis with positive and negative attributes: Validity and properties of models | 1 | 0.37 | 2020 |
L-Concept lattices with positive and negative attributes: Modeling uncertainty and reduction of size. | 1 | 0.35 | 2019 |
A reduction theorem to compute fixpoints of fuzzy closure operators | 0 | 0.34 | 2019 |
Note on m-polar fuzzy graph representation of concept lattice: How to really compute m-polar fuzzy concepts. | 0 | 0.34 | 2019 |
On attribute reduction in concept lattices: The polynomial time discernibility matrix-based method becomes the CR-method. | 1 | 0.35 | 2019 |
On attribute reduction in concept lattices: Experimental evaluation shows discernibility matrix based methods inefficient. | 1 | 0.35 | 2018 |
A calculus for containment of fuzzy attributes. | 0 | 0.34 | 2018 |
On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices. | 0 | 0.34 | 2018 |
Rough Fuzzy Concept Analysis. | 1 | 0.35 | 2017 |
On biconcepts in formal fuzzy concept analysis. | 1 | 0.36 | 2017 |
Chain of Influencers: Multipartite Intra-community Ranking. | 0 | 0.34 | 2017 |
Preface Of The Special Issue On Concept Lattices And Their Applications | 0 | 0.34 | 2017 |
On attribute reduction in concept lattices: Methods based on discernibility matrix are outperformed by basic clarification and reduction. | 9 | 0.45 | 2017 |
Note on Representing attribute reduction and concepts in concepts lattice using graphs. | 0 | 0.34 | 2017 |
Bases of closure systems over residuated lattices | 2 | 0.38 | 2016 |
Attribute-oriented fuzzy concept lattices and standard fuzzy concept lattices induce the same similarity on objects. | 0 | 0.34 | 2016 |
L-concept analysis with positive and negative attributes. | 2 | 0.36 | 2016 |
Block relations in formal fuzzy concept analysis. | 7 | 0.44 | 2016 |
Bonds Between L-Fuzzy Contexts Over Different Structures of Truth-Degrees | 0 | 0.34 | 2015 |
Category of Isotone Bonds between L-fuzzy Contexts over Different Structures of Truth Degrees. | 0 | 0.34 | 2015 |
Using Linguistic Hedges in L-rough Concept Analysis. | 1 | 0.35 | 2015 |
Complete relations on fuzzy complete lattices | 3 | 0.42 | 2015 |
Formal L-concepts with Rough Intents. | 4 | 0.43 | 2014 |
Triadic concept lattices in the framework of aggregation structures. | 6 | 0.41 | 2014 |
Granularity of attributes in formal concept analysis | 14 | 0.52 | 2014 |
Toward reduction of formal fuzzy context | 0 | 0.34 | 2013 |
Concept lattices of isotone vs. antitone Galois connections in graded setting: Mutual reducibility revisited | 27 | 0.95 | 2012 |
Row and Column Spaces of Matrices over Residuated Lattices | 6 | 0.59 | 2012 |
Simple proof of basic theorem for general concept lattices by cartesian representation | 0 | 0.34 | 2012 |
Closure spaces of isotone galois connections and their morphisms | 7 | 0.67 | 2011 |
Block Relations in Fuzzy Setting. | 10 | 0.66 | 2011 |
Optimal decompositions of matrices with grades into binary and graded matrices | 3 | 0.47 | 2010 |
General Approach to Triadic Concept Analysis. | 3 | 0.39 | 2010 |
Operators and Spaces Associated to Matrices with Grades and Their Decompositions II. | 0 | 0.34 | 2010 |
Scaling, Granulation, and Fuzzy Attributes in Formal Concept Analysis | 2 | 0.44 | 2007 |