Flow graphs: analysis with near sets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1927337 (Why is no real title available?)
- An Efficient Algorithm for Inference in Rough Set Flow Graphs
- An Extension of Pawlak’s Flow Graphs
- Applications of near sets
- Decision Trees and Flow Graphs
- Foundations of near sets
- Granular computing: topological and categorical aspects of near and rough set approaches to granulation of knowledge
- Near sets. General theory about nearness of objects
- Novel matrix forms of rough set flow graphs with applications to data integration
- Perception and classification. A note on near sets and rough sets
- Probability, truth and flow graph
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Signature-based perceptual nearness: application of near sets to image retrieval
- Sufficiently near neighbourhoods of points in flow graphs. A near set approach
- Topology with applications. Topological spaces via near and far
- Transactions on Rough Sets I
- Transactions on Rough Sets III
Cited in
(4)- Interpretation of Extended Pawlak Flow Graphs Using Granular Computing
- scientific article; zbMATH DE number 2222688 (Why is no real title available?)
- scientific article; zbMATH DE number 4189706 (Why is no real title available?)
- Sufficiently near neighbourhoods of points in flow graphs. A near set approach
This page was built for publication: Flow graphs: analysis with near sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1948558)
