#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2004

2016

- This year (0)
- Last 5 years (8)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

This paper presents a parallel algorithm for computing formal concepts. Presented is a sequential version upon which we build the parallel one. We describe the algorithm, its implementation,â€¦ (More)

- Radim BelohlÃ¡vek, Bernard De Baets, Jan Outrata, VilÃ©m Vychodil
- IEEE Transactions on Fuzzy Systems
- 2010

We present a fast bottom-up algorithm to compute all fixpoints of a fuzzy closure operator in a finite set over a finite chain of truth degrees, along with the partial order on the set of allâ€¦ (More)

- Radim BelohlÃ¡vek, Jan Outrata, VilÃ©m Vychodil
- Int. J. Found. Comput. Sci.
- 2008

Received (received date) Revised (revised date) Communicated by Editor's name ABSTRACT 1 The paper presents results on factorization by similarity of fuzzy concept lattices with hedges. A fuzzyâ€¦ (More)

- Radim BelohlÃ¡vek, JirÃ DvorÃ¡k, Jan Outrata
- J. Comput. Syst. Sci.
- 2007

We present a method of fast factorization in formal concept analysis (FCA) of data with fuzzy attributes. The output of FCA consists of a partially ordered collection of clusters extracted from aâ€¦ (More)

- Petr Krajca, Jan Outrata, VilÃ©m Vychodil
- CLA
- 2010

The paper presents a survey of recent advances in algorithms for computing all formal concepts in a given formal context which result as modifications or extensions of CbO. First, we present anâ€¦ (More)

- Petr Krajca, Jan Outrata, VilÃ©m Vychodil
- Annals of Mathematics and Artificial Intelligence
- 2010

This paper presents a parallel algorithm for computing fixpoints of Galois connections induced by object-attribute relational data. The algorithm results as a parallelization of CbO (Kuznetsov 1999)â€¦ (More)

- Jan Outrata, VilÃ©m Vychodil
- Inf. Sci.
- 2012

Fixpoints of Galois connections induced by object-attribute data tables represent important patterns that can be found in relational data. Such patterns are used in several data mining disciplinesâ€¦ (More)

Formal concept analysis (FCA) is a method of exploratory data analysis. The data is in the form of a table describing relationship between objects (rows) and attributes (columns), where table entriesâ€¦ (More)

- Jan Outrata
- CLA
- 2013

Updating a concept lattice when introducing new objects to input data can be done by any of the so-called incremental algorithms for computing concept lattice of the data. The algorithms use andâ€¦ (More)

- Radim BelohlÃ¡vek, Bernard De Baets, Jan Outrata, VilÃ©m Vychodil
- International Journal of Uncertainty, Fuzzinessâ€¦
- 2008

Concept lattices are systems of conceptual clusters, called formal concepts, which are partially ordered by the subconcept/superconcept relationship. Concept lattices are basic structures used inâ€¦ (More)