default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Konecny 0001
Person information
- affiliation: Palacky University, Olomouc, Czech Republic
Other persons with the same name
- Jan Konecny 0002 — Technical University of Ostrava, Ostrava, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j36]Jan Konecny
, Martin Trnecka:
Boolean matrix factorization for symmetric binary variables. Knowl. Based Syst. 279: 110944 (2023)- 2022
- [j35]Jan Konecny, Petr Krajca:
On pruning techniques in map-reduce style CbO algorithms. Ann. Math. Artif. Intell. 90(11-12): 1107-1124 (2022) - [j34]Radek Janostik, Jan Konecny, Petr Krajca:
LCM from FCA point of view: A CbO-style algorithm with speed-up features. Int. J. Approx. Reason. 142: 64-80 (2022) - [j33]Radek Janostik, Jan Konecny, Petr Krajca:
Pruning techniques in LinCbO for the computation of the Duquenne-Guigues basis. Inf. Sci. 616: 182-203 (2022) - [c21]Jan Konecny, Martin Trnecka:
Boolean Matrix Factorization for Data with Symmetric Variables. ICDM 2022: 1011-1016 - 2021
- [j32]Radek Janostik, Jan Konecny, Petr Krajca:
LinCbO: Fast algorithm for computation of the Duquenne-Guigues basis. Inf. Sci. 572: 223-240 (2021) - [j31]Jan Konecny, Petr Krajca:
Systematic categorization and evaluation of CbO-based algorithms in FCA. Inf. Sci. 575: 265-288 (2021) - [c20]Radek Janostik, Jan Konecny, Petr Krajca:
Pruning Techniques in LinCbO for Computation of the Duquenne-Guigues Basis. ICFCA 2021: 91-106 - 2020
- [j30]Jan Konecny:
Reinventing known results in FCA: Notes on two recently published algorithms for computation of formal concepts. Discret. Appl. Math. 273: 136-143 (2020) - [j29]Radek Janostik, Jan Konecny, Petr Krajca:
Interface between Logical Analysis of Data and Formal Concept Analysis. Eur. J. Oper. Res. 284(2): 792-800 (2020) - [j28]Jan Konecny:
Attribute implications in L-concept analysis with positive and negative attributes: Validity and properties of models. Int. J. Approx. Reason. 120: 203-215 (2020) - [j27]Radek Janostik, Jan Konecny:
General framework for consistencies in decision contexts. Inf. Sci. 530: 180-200 (2020) - [c19]Radek Janostik, Jan Konecny, Petr Krajca:
LCM is Well Implemented CbO: Study of LCM from FCA Point of View. CLA 2020: 47-58 - [c18]Jan Konecny, Petr Krajca:
Pruning in Map-Reduce Style CbO Algorithms. ICCS 2020: 103-116 - [i4]Radek Janostik, Jan Konecny, Petr Krajca:
LCM is well implemented CbO: study of LCM from FCA point of view. CoRR abs/2010.06980 (2020) - [i3]Radek Janostik, Jan Konecny, Petr Krajca:
LinCbO: fast algorithm for computation of the Duquenne-Guigues basis. CoRR abs/2011.04928 (2020)
2010 – 2019
- 2019
- [j26]Jan Konecny:
Note on m-polar fuzzy graph representation of concept lattice: How to really compute m-polar fuzzy concepts. Eng. Appl. Artif. Intell. 78: 1-11 (2019) - [j25]Radim Belohlávek, Jan Konecny:
A reduction theorem to compute fixpoints of fuzzy closure operators. Fuzzy Sets Syst. 369: 132-144 (2019) - [j24]Eduard Bartl, Jan Konecny:
L-Concept lattices with positive and negative attributes: Modeling uncertainty and reduction of size. Inf. Sci. 472: 163-179 (2019) - [j23]Jan Konecny, Petr Krajca:
On attribute reduction in concept lattices: The polynomial time discernibility matrix-based method becomes the CR-method. Inf. Sci. 491: 48-62 (2019) - [j22]Jan Konecny:
Note on representing attribute reduction and concepts in concept lattice using graphs. Soft Comput. 23(21): 10617-10621 (2019) - 2018
- [j21]Jan Konecny:
On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices. Fuzzy Sets Syst. 351: 108-121 (2018) - [j20]Jan Konecny, Petr Krajca:
On attribute reduction in concept lattices: Experimental evaluation shows discernibility matrix based methods inefficient. Inf. Sci. 467: 431-445 (2018) - [j19]Radim Belohlávek, Jan Konecny:
A calculus for containment of fuzzy attributes. Soft Comput. 22(19): 6299-6310 (2018) - 2017
- [j18]Jan Konecny, Michal Krupka:
Complete relations on fuzzy complete lattices. Fuzzy Sets Syst. 320: 64-80 (2017) - [j17]Eduard Bartl, Jan Konecny:
Rough Fuzzy Concept Analysis. Fundam. Informaticae 156(2): 141-168 (2017) - [j16]Sadok Ben Yahia, Jan Konecny:
Preface of the special issue on concept lattices and their applications. Int. J. Gen. Syst. 46(5): 437-439 (2017) - [j15]Jan Konecny, Ondrej Kridlo:
On biconcepts in formal fuzzy concept analysis. Inf. Sci. 375: 16-29 (2017) - [j14]Jan Konecny:
On attribute reduction in concept lattices: Methods based on discernibility matrix are outperformed by basic clarification and reduction. Inf. Sci. 415: 199-212 (2017) - [c17]Radim Belohlávek, Jan Konecny:
Fixpoints of fuzzy closure operators via ordinary algorithms. FUZZ-IEEE 2017: 1-6 - [i2]Jan Konecny:
Note on Representing attribute reduction and concepts in concepts lattice using graphs. CoRR abs/1711.05509 (2017) - 2016
- [j13]Jan Konecny:
Attribute-oriented fuzzy concept lattices and standard fuzzy concept lattices induce the same similarity on objects. Fuzzy Sets Syst. 294: 136-140 (2016) - [j12]Jan Konecny, Michal Krupka:
Block relations in formal fuzzy concept analysis. Int. J. Approx. Reason. 73: 27-55 (2016) - [j11]Jan Konecny, Manuel Ojeda-Aciego:
On homogeneous L-bonds and heterogeneous L-bonds. Int. J. Gen. Syst. 45(2): 160-186 (2016) - [j10]Eduard Bartl, Jan Konecny:
L-concept analysis with positive and negative attributes. Inf. Sci. 360: 96-111 (2016) - [j9]Radim Belohlávek, Jan Konecny:
Bases of closure systems over residuated lattices. J. Comput. Syst. Sci. 82(2): 357-365 (2016) - 2015
- [j8]Jan Konecny:
Note on the characterization and reduction of concept lattices through matroid theory. Inf. Sci. 307: 110-112 (2015) - [c16]Jan Konecny, Ondrej Kridlo:
Category of Isotone Bonds between L-fuzzy Contexts over Different Structures of Truth Degrees. CLA 2015: 205-216 - [c15]Eduard Bartl, Jan Konecny:
Using Linguistic Hedges in L-rough Concept Analysis. CLA 2015: 229-240 - [c14]Jan Konecny:
Bonds Between L -Fuzzy Contexts Over Different Structures of Truth-Degrees. ICFCA 2015: 81-96 - [e1]Sadok Ben Yahia, Jan Konecny:
Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications, Clermont-Ferrand, France, October 13-16, 2015. CEUR Workshop Proceedings 1466, CEUR-WS.org 2015 [contents] - [i1]Jan Konecny, Michal Krupka:
Complete relations on fuzzy complete lattices. CoRR abs/1506.03930 (2015) - 2014
- [j7]Jan Konecny, Jesús Medina, Manuel Ojeda-Aciego:
Multi-adjoint concept lattices with heterogeneous conjunctors and hedges. Ann. Math. Artif. Intell. 72(1-2): 73-89 (2014) - [j6]Radim Belohlávek, Bernard De Baets, Jan Konecny:
Granularity of attributes in formal concept analysis. Inf. Sci. 260: 149-170 (2014) - [j5]Jan Konecny, Petr Osicka:
Triadic concept lattices in the framework of aggregation structures. Inf. Sci. 279: 512-527 (2014) - [c13]Eduard Bartl, Jan Konecny:
Formal L-concepts with Rough Intents. CLA 2014: 207-218 - [c12]Cynthia Vera Glodeanu, Jan Konecny:
Ordinal Factor Analysis of Graded Data. ICFCA 2014: 128-140 - [c11]Jan Konecny:
Antitone L-bonds. IPMU (3) 2014: 71-80 - 2013
- [c10]Jan Konecny, Manuel Ojeda-Aciego:
Isotone L-bonds. CLA 2013: 153-162 - [c9]Radim Belohlávek, Jan Konecny:
Toward reduction of formal fuzzy context. IFSA/NAFIPS 2013: 221-225 - 2012
- [j4]Radim Belohlávek, Jan Konecny:
Row and Column Spaces of Matrices over Residuated Lattices. Fundam. Informaticae 115(4): 279-295 (2012) - [j3]Radim Belohlávek, Jan Konecny:
Concept lattices of isotone vs. antitone Galois connections in graded setting: Mutual reducibility revisited. Inf. Sci. 199: 133-137 (2012) - [c8]Jan Konecny, Jesús Medina, Manuel Ojeda-Aciego:
Using Intensifying Hedges to Reduce Size of Multi-adjoint Concept Lattices with Heterogeneous Conjunctors. CLA 2012: 245-256 - [c7]Radim Belohlávek, Jan Konecny, Petr Osicka:
Simple Proof of Basic Theorem for General Concept Lattices by Cartesian Representation. MDAI 2012: 294-305 - 2011
- [j2]Jan Konecny:
Isotone fuzzy Galois connections with hedges. Inf. Sci. 181(10): 1804-1817 (2011) - [c6]Radim Belohlávek, Jan Konecny:
Closure Spaces of Isotone Galois Connections and Their Morphisms. Australasian Conference on Artificial Intelligence 2011: 182-191 - [c5]Jan Konecny, Michal Krupka:
Block Relations in Fuzzy Setting. CLA 2011: 115-130 - [c4]Radim Belohlávek, Bernard De Baets, Jan Konecny:
Zoom-In/Zoom-Out Algorithms for FCA with Attribute Granularity. ISCIS 2011: 549-555 - 2010
- [j1]Eduard Bartl, Radim Belohlávek, Jan Konecny:
Optimal decompositions of matrices with grades into binary and graded matrices. Ann. Math. Artif. Intell. 59(2): 151-167 (2010) - [c3]Radim Belohlávek, Jan Konecny:
Operators and Spaces Associated to Matrices with Grades and Their Decompositions II. CLA 2010: 60-69 - [c2]Jan Konecny, Petr Osicka:
General Approach to Triadic Concept Analysis. CLA 2010: 116-126
2000 – 2009
- 2007
- [c1]Radim Belohlávek, Jan Konecny:
Scaling, Granulation, and Fuzzy Attributes in Formal Concept Analysis. FUZZ-IEEE 2007: 1-6
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
