scientific article; zbMATH DE number 2059848
From MaRDI portal
Publication:4458143
zbMath1092.68676MaRDI QIDQ4458143
Publication date: 17 March 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reasoning under uncertainty in the context of artificial intelligence (68T37) Measures of information, entropy (94A17)
Related Items (58)
An incremental attribute reduction approach based on knowledge granularity under the attribute generalization ⋮ The investigation of the Bayesian rough set model ⋮ Rough sets on graphs: New dependency and accuracy measures ⋮ Locally finite complexes, modules and generalized information systems ⋮ Rudiments of rough sets ⋮ Rough sets and Boolean reasoning ⋮ Attribute reduction: a horizontal data decomposition approach ⋮ Object similarity measures and Pawlak's indiscernibility on decision tables ⋮ Generation of rough sets reducts and constructs based on inter-class and intra-class information ⋮ Three-way attribute reducts ⋮ A relative decision entropy-based feature selection approach ⋮ Feature selection and disambiguation in learning from fuzzy labels using rough sets ⋮ Three Approaches to Deal with Tests for Inconsistent Decision Tables – Comparative Study ⋮ Three-Way Weighted Entropies and Three-Way Attribute Reduction ⋮ Fast attribute reduction via inconsistent equivalence classes for large-scale data ⋮ Class-specific information measures and attribute reducts for hierarchy and systematicness ⋮ Categorification of a set relation geometry induced by rough operators ⋮ A random approximate reduct-based ensemble learning approach and its application in software defect prediction ⋮ Optimal granularity selection based on algorithm stability with application to attribute reduction in rough set theory ⋮ Rule acquisition in generalized multi-scale information systems with multi-scale decisions ⋮ Granular computing on information tables: families of subsets and operators ⋮ On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts ⋮ Information-theoretic measures associated with rough set approximations ⋮ Attribute reduction of data with error ranges and test costs ⋮ Min-max attribute-object bireducts: on unifying models of reducts in rough set theory ⋮ Decision-Oriented Rough Set Methods ⋮ On Generalized Decision Functions: Reducts, Networks and Ensembles ⋮ Quick attribute reduction in inconsistent decision tables ⋮ Rough set-based feature selection for weakly labeled data ⋮ A set-cover-based approach for the test-cost-sensitive attribute reduction problem ⋮ Decision region distribution preservation reduction in decision-theoretic rough set model ⋮ The relationship between attribute reducts in rough sets and minimal vertex covers of graphs ⋮ Feature selection with partition differentiation entropy for large-scale data sets ⋮ Initialization of \(K\)-modes clustering using outlier detection techniques ⋮ Bidirectional heuristic attribute reduction based on conflict region ⋮ Bi-criteria optimization of decision trees with applications to data analysis ⋮ Dominance-based rough set approach and knowledge reductions in incomplete ordered information system ⋮ A weighted rough set based method developed for class imbalance learning ⋮ On the relation between rough set reducts and typical testors ⋮ Three-way class-specific attribute reducts from the information viewpoint ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ A measurement theory view on the granularity of partitions ⋮ On Partial Covers, Reducts and Decision Rules ⋮ An efficient accelerator for attribute reduction from incomplete data in rough set framework ⋮ Positive approximation: an accelerator for attribute reduction in rough set theory ⋮ A novel attribute reduction approach for multi-label data based on rough set theory ⋮ Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation ⋮ Cumulative Tsallis entropy based on power spectrum of financial time series ⋮ Ensemble learning based on approximate reducts and bootstrap sampling ⋮ Random sampling accelerator for attribute reduction ⋮ Three-way approximate reduct based on information-theoretic measure ⋮ Belief functions and rough sets: survey and new insights ⋮ The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory ⋮ Class-specific attribute reducts in rough set theory ⋮ Rough Sets: From Rudiments to Challenges ⋮ Exploring Neighborhood Structures with Neighborhood Rough Sets in Classification Learning ⋮ Uncertainty measures for general fuzzy relations ⋮ Set-based granular computing: a lattice model
This page was built for publication: