Sciweavers

5 search results - page 1 / 1
» Fuzzy Attribute Implications: Computing Non-redundant Bases ...
Sort
View
AUSAI
2005
Springer
14 years 10 days ago
Fuzzy Attribute Implications: Computing Non-redundant Bases Using Maximal Independent Sets
Abstract. This note describes a method for computation of non-redundant bases of attribute implications from data tables with fuzzy attributes. Attribute implications are formulas ...
Radim Belohlávek, Vilém Vychodil
IJFCS
2008
108views more  IJFCS 2008»
13 years 6 months ago
Basic Algorithm for Attribute Implications and Functional Dependencies in Graded Setting
We present GLinClosure, a graded extension of the well-known LinClosure algorithm. GLinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute i...
Radim Belohlávek, Vilém Vychodil
CLA
2006
13 years 8 months ago
Graded LinClosure and Its Role in Relational Data Analysis
We present graded extension of the algorithm LinClosure. Graded LinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute implications. It can a...
Radim Belohlávek, Vilém Vychodil
IRI
2006
IEEE
14 years 25 days ago
Replacing full rectangles by dense rectangles: Concept lattices and attribute implications
— Maximal full rectangles in tabular data are useful in several areas of data engineering. This paper presents a survey of results in which we replace “full rectangles” by ...
Radim Belohlávek, Vilém Vychodil
SBBD
2004
119views Database» more  SBBD 2004»
13 years 8 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link