Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
From MaRDI portal
Publication:5394485
DOI10.1007/11548669zbMath1134.68532OpenAlexW4231375480MaRDI QIDQ5394485
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11548669
Related Items (11)
Incrementally updating approximations based on the graded tolerance relation in incomplete information tables ⋮ A Rough View on Incomplete Information in Games ⋮ Algorithm for computing all the shortest reducts based on a new pruning strategy ⋮ Comparison of algorithms for clustering incomplete data ⋮ A Rough Set Approach to Incomplete Data ⋮ Mining incomplete data with singleton, subset and concept probabilistic approximations ⋮ Generalized approximations defined by non-equivalence relations ⋮ On Approximation of Classifications, Rough Equalities and Rough Equivalences ⋮ Three-way decision with incomplete information based on similarity and satisfiability ⋮ Local and Global Approximations for Incomplete Data ⋮ Rules and Apriori Algorithm in Non-deterministic Information Systems
This page was built for publication: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing