#### Filter Results:

- Full text PDF available (57)

#### Publication Year

2002

2018

- This year (3)
- Last 5 years (36)
- Last 10 years (86)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Radim Belohlávek, Vilém Vychodil
- J. Comput. Syst. Sci.
- 2010

a r t i c l e i n f o a b s t r a c t Keywords: Binary matrix decomposition Factor analysis Binary data Formal concept analysis Concept lattice We present a novel method of decomposition of an n × m… (More)

- Radim Belohlávek, Martina Chlupov́a, Vilém Vychodil
- 2004

We present an algorithm for generating a complete and non-redundant set of attribute implications from data table with fuzzy attributes. Rows and columns in the data table correspond to objects and… (More)

The paper is an overview of several approaches to the notion of a concept lattice from the point of view of fuzzy logic. The main aim is to clarify relationships between the various approaches.

- Vilém Vychodil
- Fuzzy Sets and Systems
- 2006

We show a complete axiomatization of unary connectives interpreted by monotone and superdiagonal truth functions, so-called truth-depressing hedges. These connectives formalize linguistic hedges like… (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)

We present results related to if-then rules and extraction of if-then rules from data tables with fuzzy attibutes. We provide basic definitions and results related to validity of if-then rules,… (More)

- Radim Belohlávek, Vilém Vychodil
- Studies in Fuzziness and Soft Computing
- 2002

Presented is a completeness theorem for fuzzy equational logic with truth values in a complete residuated lattice: Given a fuzzy set Σ of identities and an identity p ≈ q, the degree to which p ≈ q… (More)

- Radim Belohlávek, Vilém Vychodil
- JACIII
- 2007

We study concept lattices constrained by hedges. The principal aim is to control, in a parameterical way, the size of concept lattices, i.e. the number of conceptual clusters extracted from data. The… (More)

This paper deals with closure properties of models of fuzzy attribute implications. Fuzzy attribute implications are particular IF-THEN rules which can be interpreted in data tables with fuzzy… (More)