default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Outrata
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j15]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)- [j14]Jan Outrata, Martin Trnecka:
Parallel exploration of partial solutions in Boolean matrix factorization. J. Parallel Distributed Comput. 123: 180-191 (2019) - 2018
- [j13]Radim Belohlávek, Jan Outrata, Martin Trnecka:
Toward quality assessment of Boolean matrix factorizations. Inf. Sci. 459: 71-85 (2018) - 2016
- [j12]Manuel Ojeda-Aciego, Jan Outrata:
Concept lattices and their applications. Int. J. Gen. Syst. 45(2): 55-56 (2016) - [j11]Jan Outrata:
A lattice-free concept lattice update algorithm. Int. J. Gen. Syst. 45(2): 211-231 (2016) - [c16]Tim Wray, Jan Outrata, Peter W. Eklund:
Scalable Performance of FCbO Algorithm on Museum Data. CLA 2016: 363-376 - [c15]Radim Belohlávek, Jan Outrata, Martin Trnecka:
How to assess quality of BMF algorithms? IEEE Conf. on Intelligent Systems 2016: 227-233 - [c14]Jan Outrata, Martin Trnecka:
Evaluating Association Rules in Boolean Matrix Factorization. ITAT 2016: 147-154 - 2014
- [j10]Radim Belohlávek, Dhouha Grissa, Sylvie Guillaume, Engelbert Mephu Nguifo, Jan Outrata:
Boolean factors as a means of clustering of interestingness measures of association rules. Ann. Math. Artif. Intell. 70(1-2): 151-184 (2014) - [j9]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) - 2013
- [c13]Jan Outrata:
A Lattice-Free Concept Lattice Update Algorithm based on *CbO. CLA 2013: 261-274 - [e1]Manuel Ojeda-Aciego, Jan Outrata:
Proceedings of the Tenth International Conference on Concept Lattices and Their Applications, La Rochelle, France, October 15-18, 2013. CEUR Workshop Proceedings 1062, CEUR-WS.org 2013 [contents] - 2012
- [j8]Petr Krajca, Jan Outrata, Vilém Vychodil:
Computing Formal Concepts by Attribute Sorting. Fundam. Informaticae 115(4): 395-417 (2012) - [j7]Jan Outrata, Vilém Vychodil:
Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data. Inf. Sci. 185(1): 114-127 (2012) - [c12]Radim Belohlávek, Jan Outrata, Martin Trnecka:
Impact of Boolean Factorization as Preprocessing Methods for Classification of Boolean Data. CLA 2012: 305-316 - 2011
- [c11]Radim Belohlávek, Dhouha Grissa, Sylvie Guillaume, Engelbert Mephu Nguifo, Jan Outrata:
Boolean Factors as a Means of Clustering of Interestingness Measures of Association Rules. CLA 2011: 207-222 - [c10]Petr Krajca, Jan Outrata, Vilém Vychodil:
Using Frequent Closed Itemsets for Data Dimensionality Reduction. ICDM 2011: 1128-1133 - 2010
- [j6]Petr Krajca, Jan Outrata, Vilém Vychodil:
Parallel algorithm for computing fixpoints of Galois connections. Ann. Math. Artif. Intell. 59(2): 257-272 (2010) - [j5]Radim Belohlávek, Bernard De Baets, Jan Outrata, Vilém Vychodil:
Computing the Lattice of All Fixpoints of a Fuzzy Closure Operator. IEEE Trans. Fuzzy Syst. 18(3): 546-557 (2010) - [c9]Jan Outrata:
Preprocessing Input Data for Machine Learning by FCA. CLA 2010: 187-198 - [c8]Petr Krajca, Jan Outrata, Vilém Vychodil:
Advances in Algorithms Based on CbO. CLA 2010: 325-337 - [c7]Jan Outrata:
Boolean Factor Analysis for Data Preprocessing in Machine Learning. ICMLA 2010: 899-902
2000 – 2009
- 2009
- [j4]Radim Belohlávek, Bernard De Baets, Jan Outrata, Vilém Vychodil:
Inducing decision trees via concept lattices. Int. J. Gen. Syst. 38(4): 455-467 (2009) - 2008
- [j3]Radim Belohlávek, Jan Outrata, Vilém Vychodil:
Fast Factorization by Similarity of Fuzzy Concept Lattices with Hedges. Int. J. Found. Comput. Sci. 19(2): 255-269 (2008) - [j2]Radim Belohlávek, Bernard De Baets, Jan Outrata, Vilém Vychodil:
Characterizing Trees in Concept Lattices. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 16(Supplement-1): 1-15 (2008) - 2007
- [j1]Radim Belohlávek, Jirí Dvorák, Jan Outrata:
Fast factorization by similarity in formal concept analysis of data with fuzzy attributes. J. Comput. Syst. Sci. 73(6): 1012-1022 (2007) - [c6]Radim Belohlávek, Bernard De Baets, Jan Outrata, Vilém Vychodil:
Inducing Decision Trees via Concept Lattices. CLA 2007 - [c5]Radim Belohlávek, Bernard De Baets, Jan Outrata, Vilém Vychodil:
Lindig's Algorithm for Concept Lattices over Graded Attributes. MDAI 2007: 156-167 - [c4]Radim Belohlávek, Bernard De Baets, Jan Outrata, Vilém Vychodil:
Trees in Concept Lattices. MDAI 2007: 174-184 - 2006
- [c3]Radim Belohlávek, Jan Outrata, Vilém Vychodil:
Direct Factorization by Similarity of Fuzzy Concept Lattices by Factorization of Input Data. CLA 2006: 68-79 - [c2]Radim Belohlávek, Jan Outrata, Vilém Vychodil:
Thresholds and Shifted Attributes in Formal Concept Analysis of Data with Fuzzy Attributes. ICCS 2006: 117-130 - 2004
- [c1]Radim Belohlávek, Jirí Dvorák, Jan Outrata:
Fast Factorization of Concept Lattices by Similarity: Solution and an Open Problem. CLA 2004
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 2025-01-21 00:13 CET 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:
