Transactions on Rough Sets I
From MaRDI portal
Publication:5315298
DOI10.1007/b98175zbMath1104.68776OpenAlexW2271862924MaRDI QIDQ5315298
Publication date: 7 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98175
Related Items (46)
Indiscernibility structures induced from function sets : Graph and digraph case ⋮ The adjacency matrix of a graph as a data table: a geometric perspective ⋮ A novel granular computing model based on three-way decision ⋮ Cost-sensitive feature selection of numeric data with measurement errors ⋮ Notions from rough set theory in a generalized dependency relation context ⋮ Rough sets on graphs: New dependency and accuracy measures ⋮ Relationship among basic concepts in covering-based rough sets ⋮ Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model ⋮ Simple graphs in granular computing ⋮ Structured probabilistic rough set approximations ⋮ Dependency and accuracy measures for directed graphs ⋮ Granular computing on information tables: families of subsets and operators ⋮ Granular fuzzy sets and three-way approximations of fuzzy sets ⋮ Choice inclusive general rough semantics ⋮ A unified view of consistent functions ⋮ Rough set methods in feature selection via submodular function ⋮ Theory and applications of granular labelled partitions in multi-scale decision tables ⋮ Attribute reduction of data with error ranges and test costs ⋮ Incremental learning optimization on knowledge discovery in dynamic business intelligent systems ⋮ Two new types of multiple granulation rough set ⋮ Three-way decision and granular computing ⋮ Cost-sensitive approximate attribute reduction with three-way decisions ⋮ Cost-sensitive active learning with a label uniform distribution model ⋮ Interpretation of association rules in multi-tier structures ⋮ Granular computing and dual Galois connection ⋮ Multi-granularity Intelligent Information Processing ⋮ Rough Set Approximations in Multi-scale Interval Information Systems ⋮ Graph and matrix approaches to rough sets through matroids ⋮ On the connection of hypergraph theory with formal concept analysis and rough set theory ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ Knowledge structure, knowledge granulation and knowledge distance in a knowledge base ⋮ Information structures in a lattice-valued information system ⋮ A measurement theory view on the granularity of partitions ⋮ Interpretation of Extended Pawlak Flow Graphs Using Granular Computing ⋮ Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation ⋮ The granular partition lattice of an information table ⋮ Relationship between generalized rough sets based on binary relation and covering ⋮ Granular Structures and Approximations in Rough Sets and Knowledge Spaces ⋮ Rough Geometry and Its Applications in Character Recognition ⋮ Granular Sets – Foundations and Case Study of Tolerance Spaces ⋮ Approximation via a double-matroid structure ⋮ An application of fuzzy hypergraphs and hypergraphs in granular computing ⋮ Degree based models of granular computing under fuzzy indiscernibility relations ⋮ Granular computing on basic digraphs ⋮ Optimal scale selection for multi-scale decision tables ⋮ A novel cognitive system model and approach to transformation of information granules
This page was built for publication: Transactions on Rough Sets I
