Name
Affiliation
Papers
JAN KONECNY
Department of Computer Science, Palacky University, Olomouc, Czech Republic 771 46
43
Collaborators
Citations 
PageRank 
16
115
17.20
Referers 
Referees 
References 
154
223
301
Search Limit
100223
Title
Citations
PageRank
Year
LCM from FCA point of view: A CbO-style algorithm with speed-up features00.342022
Lincbo: Fast Algorithm For Computation Of The Duquenne-Guigues Basis00.342021
Systematic categorization and evaluation of CbO-based algorithms in FCA10.352021
LCM is well implemented CbO: study of LCM from FCA point of view00.342020
Interface between Logical Analysis of Data and Formal Concept Analysis20.362020
Pruning in Map-Reduce Style CbO Algorithms.00.342020
General framework for consistencies in decision contexts00.342020
Reinventing known results in FCA: Notes on two recently published algorithms for computation of formal concepts00.342020
Attribute implications in L-concept analysis with positive and negative attributes: Validity and properties of models10.372020
L-Concept lattices with positive and negative attributes: Modeling uncertainty and reduction of size.10.352019
A reduction theorem to compute fixpoints of fuzzy closure operators00.342019
Note on m-polar fuzzy graph representation of concept lattice: How to really compute m-polar fuzzy concepts.00.342019
On attribute reduction in concept lattices: The polynomial time discernibility matrix-based method becomes the CR-method.10.352019
On attribute reduction in concept lattices: Experimental evaluation shows discernibility matrix based methods inefficient.10.352018
A calculus for containment of fuzzy attributes.00.342018
On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices.00.342018
Rough Fuzzy Concept Analysis.10.352017
On biconcepts in formal fuzzy concept analysis.10.362017
Chain of Influencers: Multipartite Intra-community Ranking.00.342017
Preface Of The Special Issue On Concept Lattices And Their Applications00.342017
On attribute reduction in concept lattices: Methods based on discernibility matrix are outperformed by basic clarification and reduction.90.452017
Note on Representing attribute reduction and concepts in concepts lattice using graphs.00.342017
Bases of closure systems over residuated lattices20.382016
Attribute-oriented fuzzy concept lattices and standard fuzzy concept lattices induce the same similarity on objects.00.342016
L-concept analysis with positive and negative attributes.20.362016
Block relations in formal fuzzy concept analysis.70.442016
Bonds Between L-Fuzzy Contexts Over Different Structures of Truth-Degrees00.342015
Category of Isotone Bonds between L-fuzzy Contexts over Different Structures of Truth Degrees.00.342015
Using Linguistic Hedges in L-rough Concept Analysis.10.352015
Complete relations on fuzzy complete lattices30.422015
Formal L-concepts with Rough Intents.40.432014
Triadic concept lattices in the framework of aggregation structures.60.412014
Granularity of attributes in formal concept analysis140.522014
Toward reduction of formal fuzzy context00.342013
Concept lattices of isotone vs. antitone Galois connections in graded setting: Mutual reducibility revisited270.952012
Row and Column Spaces of Matrices over Residuated Lattices60.592012
Simple proof of basic theorem for general concept lattices by cartesian representation00.342012
Closure spaces of isotone galois connections and their morphisms70.672011
Block Relations in Fuzzy Setting.100.662011
Optimal decompositions of matrices with grades into binary and graded matrices30.472010
General Approach to Triadic Concept Analysis.30.392010
Operators and Spaces Associated to Matrices with Grades and Their Decompositions II.00.342010
Scaling, Granulation, and Fuzzy Attributes in Formal Concept Analysis20.442007