default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Trnecka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Francisco José Valverde Albacete, Martin Trnecka, Sadok Ben Yahia
:
Special Issue on Concept Lattices and their Applications (CLA 2020). Int. J. Approx. Reason. 164: 109079 (2024)- [j19]Radim Belohlávek, Martin Trnecka:
Semantic explorations in factorizing Boolean data via formal concepts. Int. J. Approx. Reason. 173: 109247 (2024) - [c21]Martin Trnecka, Roman Vyjidacek:
What Can FCA-Based Boolean Matrix Factorization Do for Object-Attribute Biclustering? CONCEPTS 2024: 123-131 - 2023
- [j18]Jan Konecny, Martin Trnecka:
Boolean matrix factorization for symmetric binary variables. Knowl. Based Syst. 279: 110944 (2023) - 2022
- [j17]Martin Trnecka, Marketa Trneckova:
Boolean matrix factorization with background knowledge. Knowl. Based Syst. 241: 108261 (2022) - [j16]Martin Trnecka, Roman Vyjidacek:
Revisiting the GreCon algorithm for Boolean matrix factorization. Knowl. Based Syst. 249: 108895 (2022) - [c20]Jan Konecny, Martin Trnecka:
Boolean Matrix Factorization for Data with Symmetric Variables. ICDM 2022: 1011-1016 - 2021
- [j15]Tatiana Makhalova, Martin Trnecka:
From-below Boolean matrix factorization algorithm based on MDL. Adv. Data Anal. Classif. 15(1): 37-56 (2021) - [j14]Eduard Bartl, Martin Trnecka:
Covering of minimal solutions to fuzzy relational equations. Int. J. Gen. Syst. 50(2): 117-138 (2021) - [j13]Martin Trnecka, Marketa Trneckova:
Model order selection for approximate Boolean matrix factorization problem. Knowl. Based Syst. 227: 107184 (2021) - [j12]Radim Belohlávek, Martin Trnecka:
The 8M Algorithm from Today's Perspective. ACM Trans. Knowl. Discov. Data 15(2): 22:1-22:22 (2021) - [c19]Martin Trnecka, Marketa Trneckova:
An Incremental Recomputation of From-Below Boolean Matrix Factorization. ICFCA 2021: 125-137 - [c18]Petr Krajca, Martin Trnecka:
Reducing Negative Impact of Noise in Boolean Matrix Factorization with Association Rules. IDA 2021: 365-375 - 2020
- [j11]Martin Trnecka, Marketa Trneckova:
An incremental algorithm for the role mining problem. Comput. Secur. 94: 101830 (2020) - [j10]Radim Belohlávek, Martin Trnecka:
Basic level of concepts in formal concept analysis 1: formalization and utilization. Int. J. Gen. Syst. 49(7): 689-706 (2020) - [j9]Radim Belohlávek, Martin Trnecka:
Basic level of concepts and formal concept analysis 2: examination of existing basic level metrics. Int. J. Gen. Syst. 49(7): 707-723 (2020) - [c17]Martin Trnecka, Roman Vyjidacek:
Revisiting the GreCon Algorithm for Boolean Matrix Factorization. CLA 2020: 59-70 - [c16]Martin Trnecka, Marketa Trneckova:
Simple Structure in Boolean Matrix Factorization. CLA 2020: 95-106 - [e1]Francisco J. Valverde-Albacete, Martin Trnecka:
Proceedings of the Fifthteenth International Conference on Concept Lattices and Their Applications, Tallinn, Estonia, June 29-July 1, 2020. CEUR Workshop Proceedings 2668, CEUR-WS.org 2020 [contents]
2010 – 2019
- 2019
- [j8]Radim Belohlávek, Jan Outrata, Martin Trnecka:
Factorizing Boolean matrices using formal concepts and iterative usage of essential entries. Inf. Sci. 489: 37-49 (2019) - [j7]Jan Outrata, Martin Trnecka:
Parallel exploration of partial solutions in Boolean matrix factorization. J. Parallel Distributed Comput. 123: 180-191 (2019) - [c15]Petr Krajca, Martin Trnecka:
Parallelization of the GreConD Algorithm for Boolean Matrix Factorization. ICFCA 2019: 208-222 - [c14]Tatiana Makhalova, Martin Trnecka:
A Study of Boolean Matrix Factorization Under Supervised Settings. ICFCA 2019: 341-348 - [i2]Tatiana P. Makhalova, Martin Trnecka:
From-Below Boolean Matrix Factorization Algorithm Based on MDL. CoRR abs/1901.09567 (2019) - 2018
- [j6]Radim Belohlávek, Martin Trnecka:
A new algorithm for Boolean matrix factorization which admits overcovering. Discret. Appl. Math. 249: 36-52 (2018) - [j5]Radim Belohlávek, Martin Trnecka:
Handling noise in Boolean matrix factorization. Int. J. Approx. Reason. 96: 78-94 (2018) - [j4]Radim Belohlávek, Jan Outrata, Martin Trnecka:
Toward quality assessment of Boolean matrix factorizations. Inf. Sci. 459: 71-85 (2018) - [j3]Martin Trnecka, Marketa Trneckova:
Data Reduction for Boolean Matrix Factorization Algorithms Based on Formal Concept Analysis. Knowl. Based Syst. 158: 75-80 (2018) - [c13]Radim Belohlávek, Martin Trnecka:
The 8M Algorithm from Today's Perspective. CLA 2018: 167-178 - [c12]Martin Trnecka, Marketa Trneckova:
Can We Measure the Interpretability of Factors? CLA 2018: 179-190 - [c11]Petr Krajca, Martin Trnecka:
Basic Level Concepts as a Means to Better Interpretability of Boolean Matrix Factors and Their Application to Clustering. MDAI 2018: 169-181 - 2017
- [c10]Petr Osicka, Martin Trnecka:
Boolean Matrix Decomposition by Formal Concept Sampling. CIKM 2017: 2243-2246 - [c9]Radim Belohlávek, Martin Trnecka:
Handling Noise in Boolean Matrix Factorization. IJCAI 2017: 1433-1439 - 2016
- [c8]Martin Trnecka, Marketa Trneckova:
Decomposition of Boolean multi-relational data with graded relations. IEEE Conf. on Intelligent Systems 2016: 221-226 - [c7]Radim Belohlávek, Jan Outrata, Martin Trnecka:
How to assess quality of BMF algorithms? IEEE Conf. on Intelligent Systems 2016: 227-233 - [c6]Jan Outrata, Martin Trnecka:
Evaluating Association Rules in Boolean Matrix Factorization. ITAT 2016: 147-154 - 2015
- [j2]Radim Belohlávek, Martin Trnecka:
From-below approximations in Boolean matrix factorization: Geometry and new algorithm. J. Comput. Syst. Sci. 81(8): 1678-1697 (2015) - 2014
- [j1]Radim Belohlávek, Jan Outrata, Martin Trnecka:
Impact of Boolean factorization as preprocessing methods for classification of Boolean data. Ann. Math. Artif. Intell. 72(1-2): 3-22 (2014) - [c5]Martin Trnecka, Marketa Trneckova:
An Algorithm for the Multi-Relational Boolean Factor Analysis based on Essential Elements. CLA 2014: 107-118 - 2013
- [c4]Markéta Krmelová, Martin Trnecka:
Boolean Factor Analysis of Multi-Relational Data. CLA 2013: 187-198 - [c3]Radim Belohlávek, Martin Trnecka:
Basic Level in Formal Concept Analysis: Interesting Concepts and Psychological Ramifications. IJCAI 2013: 1233-1239 - [i1]Radim Belohlávek, Martin Trnecka:
From-Below Approximations in Boolean Matrix Factorization: Geometry and New Algorithm. CoRR abs/1306.4905 (2013) - 2012
- [c2]Radim Belohlávek, Jan Outrata, Martin Trnecka:
Impact of Boolean Factorization as Preprocessing Methods for Classification of Boolean Data. CLA 2012: 305-316 - [c1]Radim Belohlávek, Martin Trnecka:
Basic Level of Concepts in Formal Concept Analysis. ICFCA 2012: 28-44
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-08-23 19:21 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:
