mlsanityData to 14 Oct 2026

Granular Directed Rough Sets, Concept Organization and Soft Clustering

arXiv 2208.06623 ↗First posted 13 Aug 2022cs.AI cs.DM cs.LOcited by 0

Not on the map. Why?

Abstract (arXiv)

Up-directed rough sets are introduced and studied by the present author in earlier papers. This is extended by her in two different granular directions in this research, with a surprising algebraic semantics. The granules are based on ideas of generalized closure under up-directedness that may be read as a form of weak consequence. This yields approximation operators that satisfy cautious monotony, while pi-groupoidal approximations (that additionally involve strategic choice and algebraic operators) have nicer properties. The study is primarily motivated by possible structure of concepts in distributed cognition perspectives, real or virtual classroom learning contexts, and student-centric teaching. Rough clustering techniques for datasets that involve up-directed relations (as in the study of Sentinel project image data) are additionally proposed. This research is expected to see significant theoretical and practical applications in related domains.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 73 references that are in the map. First posted on arXiv 13 Aug 2022.

Builds on

8 of 73 references.

References · 8

  1. 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,496
  2. 2017Dialectical Rough Sets, Parthood and Figures of Opposition-1cited by 5
  3. 2021General Rough Modeling of Cluster Analysiscited by 5
  4. 2014Algebraic Semantics of Proto-Transitive Rough Setscited by 3
  5. 2013Algebraic Semantics of Similarity-Based Bitten Rough Set Theorycited by 2
  6. 2017Generalized Ideals and Co-Granular Rough Setscited by 2
  7. 2017Approximations from Anywhere and General Rough Setscited by 1
  8. 2020Algebraic Approach to Directed Rough Setscited by 1

Built on by

Not cited yet.