Jan Konecny 0001

dblp:84/4427-1 · DBLP profile ↗
← Back
17ranked-venue papers in the field
10as first author
4since 2021 · last 2022
0000-0003-3934-5690ORCID · verified

Domains — venue-derived; a paper can count in several

Knowledge Engineering, Semantic Web & Information Systems · 15 (8 first)Data Mining & Knowledge Discovery · 1 (1 first)Other / Interdisciplinary · 1 (1 first)
YearPublicationVenuePosition
2022 Boolean Matrix Factorization for Data with Symmetric Variables
abstract
Boolean matrix factorization (BMF), a popular methodology of preprocessing and analyzing 1/0 tabular data, generally handles Os and Is differently. It aims to explain Is in the data by factors, while Os are just left unexplained. This difference is mainly given by the usual data character, where 1s carry much more important information (and are much scarcer) than Os. However, in some datasets, the Is and Os are equally important. Such datasets require symmetrical handling of Is and Os. We propose a novel factorization of such data and its algorithm. Unlike usual BMF methods, factors are linearly ordered by priority in our factorization, and factors can contradict each other – meaning that one factor can put 1 where the other puts 0. In such a case, the factor with higher priority is right. We show that the proposed factorization provides a more compact data description than a straightforward application of the usual BMF methods.
Jan Konecny 0001, Martin Trnecka
ICDM1
2022 Pruning techniques in LinCbO for the computation of the Duquenne-Guigues basis
Radek Janostik, Jan Konecny 0001, Petr Krajca
Inf. Sci.2
2021 LinCbO: Fast algorithm for computation of the Duquenne-Guigues basis
Radek Janostik, Jan Konecny 0001, Petr Krajca
Inf. Sci.2
2021 Systematic categorization and evaluation of CbO-based algorithms in FCA
Jan Konecny 0001, Petr Krajca
Inf. Sci.1
2020 General framework for consistencies in decision contexts
Radek Janostik, Jan Konecny 0001
Inf. Sci.2
2019 L-Concept lattices with positive and negative attributes: Modeling uncertainty and reduction of size
Eduard Bartl, Jan Konecny 0001
Inf. Sci.2
2019 On attribute reduction in concept lattices: The polynomial time discernibility matrix-based method becomes the CR-method
Jan Konecny 0001, Petr Krajca
Inf. Sci.1
2018 On attribute reduction in concept lattices: Experimental evaluation shows discernibility matrix based methods inefficient
Jan Konecny 0001, Petr Krajca
Inf. Sci.1
2017 On attribute reduction in concept lattices: Methods based on discernibility matrix are outperformed by basic clarification and reduction
Jan Konecny 0001
Inf. Sci.1
2017 On biconcepts in formal fuzzy concept analysis
Jan Konecny 0001, Ondrej Kridlo
Inf. Sci.1
2016 L-concept analysis with positive and negative attributes
Eduard Bartl, Jan Konecny 0001
Inf. Sci.2
2015 Note on the characterization and reduction of concept lattices through matroid theory
Jan Konecny 0001
Inf. Sci.1
2014 Antitone L-bonds
Jan Konecny 0001
IPMU (3)1
2014 Granularity of attributes in formal concept analysis
Radim Belohlávek, Bernard De Baets, Jan Konecny 0001
Inf. Sci.3
2014 Triadic concept lattices in the framework of aggregation structures
Jan Konecny 0001, Petr Osicka
Inf. Sci.1
2012 Concept lattices of isotone vs. antitone Galois connections in graded setting: Mutual reducibility revisited
Radim Belohlávek, Jan Konecny 0001
Inf. Sci.2
2011 Isotone fuzzy Galois connections with hedges
Jan Konecny 0001
Inf. Sci.1