Transactions on Rough Sets I
From MaRDI portal
(Redirected from Publication:5315313)
Transactions on Rough Sets I (scientific article; zbMATH DE number 2203522)
Transactions on Rough Sets I (scientific article; zbMATH DE number 2203522)
Recommendations
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Characteristic Relations for Incomplete Data: A Generalization of the Indiscernibility Relation
- Rough Sets and Current Trends in Computing
- A rule induction algorithm for incomplete information system
- Describing rough approximations by indiscernibility relations in information tables with incomplete information
Cited in
(49)- Bireducts with tolerance relations
- Extensions of Information Systems: The Rough Set Perspective
- scientific article; zbMATH DE number 597798 (Why is no real title available?)
- Complexity of rule sets in mining incomplete data using characteristic sets and generalized maximal consistent blocks
- Incorporating domain knowledge into attribute-oriented data mining
- scientific article; zbMATH DE number 2089470 (Why is no real title available?)
- scientific article; zbMATH DE number 1927360 (Why is no real title available?)
- Consistency of incomplete data
- NIS-apriori-based rule generation with three-way decisions and its application system in SQL
- scientific article; zbMATH DE number 4049121 (Why is no real title available?)
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Dominance-based rough set approach to incomplete ordered information systems
- Dominance-based rough set approach and knowledge reductions in incomplete ordered information system
- Fuzzy rough set model for set-valued data
- An interval set model for learning rules from incomplete information table
- An experimental comparison of three probabilistic approximations used for rule induction
- Partial order relation for approximation operators in covering based rough sets
- Dealing with missing values meaning unknown in probabilistic approximations
- Extended tolerance relation to define a new rough set model in incomplete information systems
- Complexity of rule sets induced by two versions of the MLEM2 rule induction algorithm
- Local and Global Approximations for Incomplete Data
- m-tables: representing missing data
- A comparison of three closest fit approaches to missing attribute values in preterm birth data
- A rough set-based incremental approach for learning knowledge in dynamic incomplete information systems
- Flexible indiscernibility relations for missing attribute values
- Ensembles of Decision Rules for Solving Binary Classification Problems in the Presence of Missing Values
- Inductive learning models with missing values
- Dominance-based rough set approach: basic ideas and main trends
- Rule Induction Based on Indiscernible Classes from Rough Sets in Information Tables with Continuous Values
- scientific article; zbMATH DE number 1968245 (Why is no real title available?)
- scientific article; zbMATH DE number 2079754 (Why is no real title available?)
- Fuzzy rough approximations for set-valued data
- A rule induction algorithm in incomplete decision table based on attribute order
- Describing rough approximations by indiscernibility relations in information tables with incomplete information
- Constructive and axiomatic approaches to hesitant fuzzy rough set
- Granular structures of covering-based rough set approximations through the Mapper algorithm
- Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
- Novel matrix-based approaches to computing minimal and maximal descriptions in covering-based rough sets
- Increasing incompleteness of data sets---a strategy for inducing better rule sets
- Three approaches to missing attribute values: a rough set perspective
- Rules and Apriori Algorithm in Non-deterministic Information Systems
- A rough set approach to incomplete data
- On variable precision generalized rough sets and incomplete decision tables
- Granular rough sets and granular shadowed sets: three-way approximations in Pawlak approximation spaces
- Mining incomplete data with singleton, subset and concept probabilistic approximations
- A Two-Phase Model for Learning Rules from Incomplete Data
- A rule induction algorithm for incomplete information system
- Lattices with Interior and Closure Operators and Abstract Approximation Spaces
- Families of the granules for association rules and their properties
This page was built for publication: Transactions on Rough Sets I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315313)