Publications

Journal papers

  1. Parallel algorithm for computing fixpoints of Galois connections.
    Ann. Math. Artif. Intell. 59(2)(2010), pp. 257-272. (coauthors Outrata J., Vychodil V.)
    [Springer-Verlag, DOI 10.1007/s10472-010-9199-5, ISSN 1012-2443 (paper) 1573-7470 (on-line)]
  2. Computing formal concepts by attribute sorting.
    Fundamenta Informaticae 115(4)(2012). (coauthors Outrata J., Vychodil V.)
    [IOS Press, DOI 10.3233/FI-2012-661, ISSN 0169-2968 (paper), 1875-8681 (online)]
  3. On attribute reduction in concept lattices: Experimental evaluation shows discernibility matrix based methods inefficient.
    Information Sciences 467 (October 2018). (coauthor Konečný J.)
    [Elsevier, DOI 10.1016/j.ins.2018.08.004, ISSN 0020-0255]
  4. On attribute reduction in concept lattices: The polynomial time discernibility matrix-based method becomes the CR-method.
    Information Sciences 491 (July 2019). (coauthor Konečný J.)
    [Elsevier, DOI 10.1016/j.ins.2019.03.038, ISSN 0020-0255]
  5. Interface between Logical Analysis of Data and Formal Concept Analysis.
    European Journal of Operational Research. (coauthors Janoštík R., Konečný J.)
    [Elsevier, DOI 10.1016/j.ejor.2020.01.015, ISSN 0377-2217]
  6. LinCbO: Fast algorithm for computation of the Duquenne-Guigues basis.
    Information Sciences 572 (September 2021). (coauthor Janoštík R., Konečný J.)
    [Elsevier, DOI 10.1016/j.ins.2021.04.104, ISSN 0020-0255]
  7. Systematic categorization and evaluation of CbO-based algorithms in FCA.
    Information Sciences 575 (October 2021). (coauthor Konečný J.)
    [Elsevier, DOI 10.1016/j.ins.2021.06.024, ISSN 0020-0255]
  8. LCM from FCA point of view: A CbO-style algorithm with speed-up features.
    International Journal of Approximate Reasoning 142 (March 2022). (coauthor Janoštík R., Konečný J.)
    [Elsevier, DOI 10.1016/j.ijar.2021.11.005, ISSN 0888-613X]
  9. Pruning techniques in LinCbO for the computation of the Duquenne-Guigues basis.
    Information Sciences 616 (November 2022). (coauthor Janoštík R., Konečný J.)
    [Elsevier, DOI 10.1016/j.ins.2022.10.057, ISSN 0020-0255]
  10. On pruning techniques in map-reduce style CbO algorithms.
    Ann. Math. Artif. Intell. 90(11-12) (2022). (coauthor Konečný J.)
    [Springer, DOI 10.1007/S10472-022-09787-1, ISSN 1012-2443]

Papers in Conference Proceedings

  1. Parallel Recursive Algorithm for FCA.
    In: Belohlavek R., Kuznetsov S. O. (Eds.): CLA 2008: Proceedings of the Sixth International Conference on Concept Lattices and Their Applications, 2008, Olomouc, Czech Republic, October 2008, pp. 71-82. (coauthors Outrata J., Vychodil V.)
    [Palacký University, Olomouc 2008, ISBN 978-80-244-2111-7, PDF]
  2. Data parallel dialect of Scheme: Outline of the formal model, implementation, and performance.
    In: Proc. 24th Annual ACM Symposium on Applied Computing (ACM SAC '09), pp. 1938-1939. (coauthor Vychodil V.)
    [ACM Press, DOI 10.1145/1529282.1529713, ISBN 978-1-60558-166-8/09/03]
  3. Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework.
    In: Adams N. M., Robardet C., Siebes A., Boulicaut J.-F. (Eds.): Advances in Intelligent Data Analysis VIII, Lecture Notes in Computer Science 5772, pp. 333-344. (coauthor Vychodil V.)
    [Springer-Verlag Berlin Heidelberg 2009, DOI 10.1007/978-3-642-03915-7, ISBN 978-3-642-03914-0]
  4. Comparison of data structures for computing formal concepts.
    In: Torra V., Narukawa Y., Inuiguchi M. (Eds.): Modeling Decisions for Artificial Intelligence: 6th International Conference, Lecture Notes in Artificial Intelligence 5861, 2009, pp. 114-125. (coauthor Vychodil V.)
    [Springer Berlin Heidelberg 2009, DOI 10.1007/978-3-642-04820-3_11, ISBN 978-3-642-04819-7]
  5. Software transactional memory for implicitly parallel functional language.
    In: Proc. 25th Annual ACM Symposium on Applied Computing (ACM SAC '10), pp. 2123-2130. (coauthor Vychodil V.)
    [ACM Press, DOI 10.1145/1774088.1774536, ISBN 978-1-60558-638-0/10/03]
  6. Advances in algorithms based on CbO.
    In: Kryszkiewicz M., Obiedkov S. (Eds.): Proc. CLA 2010, 2010, pp. 325-337. (coauthors Outrata J., Vychodil V.)
    [University of Sevilla, Sevilla, Spain, ISBN 978-84-614-4027-6, ISSN 1613-0073, PDF]
  7. Using Frequent Closed Itemsets for Data Dimensionality Reduction.
    In: Diane J. Cook, et al. (Eds.): 11th IEEE International Conference on Data Mining, ICDM 2011, 2011, pp. 1128-1133. (coauthors Outrata J., Vychodil V.)
    [IEEE Computer Society, Conference Publishing Services, Los Alamitos, CA, USA, BMS Part Number CFP11278-CDR, Product Number E4408, ISBN 978-0-7695-4408-3]
  8. Basic concepts of relational query language for similarity-based databases.
    In: Cdrom proceedings the 9th international conference on modeling decisions for artificial intelligence, pp. 52-63. (coauthor Vychodil V.)
    [Girona, Spain, 2012, ISBN 978-84-695-6132-4]
  9. Foundations of relational similarity-based query language RESIQL.
    In: Proceedings of 2013 IEEE Symposium on Foundations of Computational Intelligence, pp. 8. (coauthor Vychodil V.)
    [IEEE Computational Intelligence Society, Singapore, Singapore, 2013, DOI 10.1109/FOCI.2013.6602450, ISBN 978-1-4673-5901-6]
  10. Incremental JIT Compiler for Implicitly Parallel Functional Language.
    In: Proceedings of 4th Workshop on Advances in Programming Languages, FedCSIS 2013, pp. 8.
    [Polskie Towarzystwo Informatyczne, Warsaw, Poland, 2013, ISBN 978-1-4673-4471-5]
  11. Query Optimization Strategies in Similarity-Based Databases.
    In: Modeling Decisions for Artificial Intelligence, Lecture Notes in Computer Science Volume 8234, pp. 12. (coauthor Vychodil V.)
    [Springer, DOI 10.1007/978-3-642-41550-0_16, ISBN 978-3-642-41549-4]
  12. Optimized and Parallel Query Processing in Similarity-Based Databases.
    In: Modeling Decisions for Artificial Intelligence, Lecture Notes in Computer Science Volume 9321, pp. 13.
    [Springer, DOI 10.1007/978-3-319-23240-9_14, ISBN 978-3-319-23239-3]
  13. Rank-aware Clustering of Relational Data: Organizing Search Results.
    In: USB Proceedings The 13th International Conference on Modeling Decisions for Artificial Intelligence, pp. 61-72.
    [Sant Julia de Loria, Andorra, September 19-12, 2016, ISBN 978-99920-3-099-8]
  14. Basic Level Concepts as a Means to Better Interpretability of Boolean Matrix Factors and their Application to Clustering.
    In: Torra V., Narukawa Y., Aguiló I., González-Hidalgo M. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2018. Lecture Notes in Computer Science, vol. 11144., pp. 169-181. (coauthor Trnečka M.)
    [Springer, Cham, DOI 10.1007/978-3-030-00202-2_14, ISBN 978-3-030-00201-5]
  15. Parallelization of the GreConD Algorithm for Boolean Matrix Factorization.
    In: Cristea D., Ber F.-L., Sertkaya B. (eds.) Formal Concept Analysis - 15th International Conference, ICFCA 2019. Lecture Notes in Computer Science, vol. 11511., pp. 208-222. (coauthor Trnečka M.)
    [Springer, DOI 10.1007/978-3-030-21462-3_14, ISBN 978-3-030-21461-6]
  16. LCM is Well Implemented CbO: Study of LCM from FCA Point of View.
    In: Valverde-Albacete F.-J., Trnecka M. (eds.) Proceedings of the Fifthteenth International Conference on Concept Lattices and Their Applications. CLA 2020., pp. 47-58. (coauthors Janoštík R., Konečný J.)
    [Tallinn University of Technology, Tallinn, Estonia, ISBN N/A, ISSN 1613-0073, PDF]
  17. Pruning in Map-Reduce Style CbO Algorithms.
    In: Alam M., Braun T., Yun B. (eds.) Ontologies and Concepts in Mind and Machine - 25th International Conference on Conceptual Structures, ICCS 2020. Proceedings. Lecture Notes in Computer Science, vol. 12277., pp. 103-116. (coauthor Konečný J.)
    [Springer, DOI 10.1007/978-3-030-57855-8_8, ISBN 978-3-030-57854-1]
  18. Reducing Negative Impact of Noise in Boolean Matrix Factorization with Association Rules.
    In: Abreu P.-H., Rodrigues P.-P., Fernández A., Gama J. (eds.) Advances in Intelligent Data Analysis XIX - 19th International Symposium on Intelligent Data Analysis, IDA 2021. Proceedings. Lecture Notes in Computer Science, vol. 12695., pp. 365-375. (coauthor Trnečka M.)
    [Springer, DOI 10.1007/978-3-030-74251-5_29, ISBN 978-3-030-74250-8]
  19. Pruning Techniques in LinCbO for Computation of the Duquenne-Guigues Basis.
    In: Braud A., Buzmakov A., Hanika T., Le Ber F. (eds) Formal Concept Analysis. ICFCA 2021. Lecture Notes in Computer Science, vol 12733., pp. 91-106. (coauthors Janoštík R., Konečný J.)
    [Springer, DOI 10.1007/978-3-030-77867-5_6, ISBN 978-3-030-77867-5]
  20. Improving the Performance of Lindig-Style Algorithms with Empty Intersections.
    In: Braun T., Gehrke M., Hanika T., Hernandez N. (eds) Graph-Based Representation and Reasoning. ICCS 2021. Lecture Notes in Computer Science, vol 12879., pp. 91-104.
    [Springer, DOI 10.1007/978-3-030-86982-3_7, ISBN 978-3-030-86982-3]
  21. Decoupling Types and Representations of Values for Runtime Optimizations..
    In: Position Papers of the 18th Conference on Computer Science and Intelligence Systems, M. Ganzha, L. Maciaszek, M. Paprzycki, D. Ślęzak (eds). ACSIS, Vol. 36, pages 67?76 (2023), pp. 66-76. (coauthor Škrabal R.)
    [Polskie Towarzystwo Informatyczne, DOI 10.15439/2023F5882, ISSN 2300-5963]

Supplementary Materials

  1. FCA Datasets

Last update on 13. 12. 2023 14:24
Powered by Schemik.

© Petr Krajča, 2010, 2012
petr.krajca (at) upol.cz