Flow graphs: analysis with near sets
From MaRDI portal
Publication:1948558
DOI10.1007/S11786-013-0144-YzbMath1285.68176OpenAlexW2018051263MaRDI QIDQ1948558
Doungrat Chitcharoen, Sheela Ramanna
Publication date: 24 April 2013
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-013-0144-y
Computing methodologies for image processing (68U10) Knowledge representation (68T30) Proximity structures and generalizations (54E05) Flows in graphs (05C21)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Novel matrix forms of rough set flow graphs with applications to data integration
- Foundations of near sets
- Signature-based perceptual nearness: application of near sets to image retrieval
- Applications of Near Sets
- Perception and Classification. A Note on Near Sets and Rough Sets
- Topology with Applications
- Decision Trees and Flow Graphs
- Granular Computing: Topological and Categorical Aspects of Near and Rough Set Approaches to Granulation of Knowledge
- Transactions on Rough Sets I
- Sufficiently Near Neighbourhoods of Points in Flow Graphs. A Near Set Approach
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- An Efficient Algorithm for Inference in Rough Set Flow Graphs
- Transactions on Rough Sets III
- An Extension of Pawlak’s Flow Graphs
This page was built for publication: Flow graphs: analysis with near sets