Petr Krajca

Orcid: 0000-0003-4278-3130

According to our database1, Petr Krajca authored at least 27 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Decoupling Types and Representations of Values for Runtime Optimizations.
Proceedings of the Position Papers of the 18th Conference on Computer Science and Intelligence Systems, 2023

2022
Pruning techniques in LinCbO for the computation of the Duquenne-Guigues basis.
Inf. Sci., 2022

LCM from FCA point of view: A CbO-style algorithm with speed-up features.
Int. J. Approx. Reason., 2022

On pruning techniques in map-reduce style CbO algorithms.
Ann. Math. Artif. Intell., 2022

2021
Systematic categorization and evaluation of CbO-based algorithms in FCA.
Inf. Sci., 2021

LinCbO: Fast algorithm for computation of the Duquenne-Guigues basis.
Inf. Sci., 2021

Reducing Negative Impact of Noise in Boolean Matrix Factorization with Association Rules.
Proceedings of the Advances in Intelligent Data Analysis XIX, 2021

Improving the Performance of Lindig-Style Algorithms with Empty Intersections.
Proceedings of the Graph-Based Representation and Reasoning, 2021

2020
Interface between Logical Analysis of Data and Formal Concept Analysis.
Eur. J. Oper. Res., 2020

Pruning in Map-Reduce Style CbO Algorithms.
Proceedings of the Ontologies and Concepts in Mind and Machine, 2020

LCM is Well Implemented CbO: Study of LCM from FCA Point of View.
Proceedings of the Fifthteenth International Conference on Concept Lattices and Their Applications, 2020

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

Parallelization of the GreConD Algorithm for Boolean Matrix Factorization.
Proceedings of the Formal Concept Analysis - 15th International Conference, 2019

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

Basic Level Concepts as a Means to Better Interpretability of Boolean Matrix Factors and Their Application to Clustering.
Proceedings of the Modeling Decisions for Artificial Intelligence, 2018

2015
Optimized and Parallel Query Processing in Similarity-Based Databases.
Proceedings of the Modeling Decisions for Artificial Intelligence, 2015

2013
Query Optimization Strategies in Similarity-Based Databases.
Proceedings of the Modeling Decisions for Artificial Intelligence, 2013

Foundations of relational similarity-based query language RESIQL.
Proceedings of the IEEE Symposium on Foundations of Computational Intelligence, 2013

Incremental JIT Compiler for Implicitly Parallel Functional Language.
Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

2012
Computing Formal Concepts by Attribute Sorting.
Fundam. Informaticae, 2012

2011
Using Frequent Closed Itemsets for Data Dimensionality Reduction.
Proceedings of the 11th IEEE International Conference on Data Mining, 2011

2010
Parallel algorithm for computing fixpoints of Galois connections.
Ann. Math. Artif. Intell., 2010

Software transactional memory for implicitly parallel functional language.
Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

Advances in Algorithms Based on CbO.
Proceedings of the 7th International Conference on Concept Lattices and Their Applications, 2010

2009
Data parallel dialect of scheme: outline of the formal model, implementation, performance.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

Comparison of Data Structures for Computing Formal Concepts.
Proceedings of the Modeling Decisions for Artificial Intelligence, 2009

Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework.
Proceedings of the Advances in Intelligent Data Analysis VIII, 2009


  Loading...