Rough Sets and Functional Dependencies in Data: Foundations of Association Reducts

DOI10.1007/978-3-642-02097-1_10zbMath1246.68221OpenAlexW2145715569MaRDI QIDQ3638308

Dominik Ślęzak

Publication date: 2 July 2009

Published in: Transactions on Computational Science V (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02097-1_10

zbMATH Keywords

rough setsreductsapproximate functional dependencies

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Related Items (9)

Notions from rough set theory in a generalized dependency relation context ⋮ Attribute reduction using functional dependency relations in rough set theory ⋮ Class-specific information measures and attribute reducts for hierarchy and systematicness ⋮ On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts ⋮ On Generalized Decision Functions: Reducts, Networks and Ensembles ⋮ Projected Gustafson-Kessel Clustering Algorithm and Its Convergence ⋮ A measurement theory view on the granularity of partitions ⋮ Decision reducts and bireducts in a covering approximation space and their relationship to set definability ⋮ Granular computing on basic digraphs

This page was built for publication: Rough Sets and Functional Dependencies in Data: Foundations of Association Reducts