pith. sign in

arxiv: 2205.10127 · v1 · pith:H3MWMQEYnew · submitted 2022-05-17 · 💻 cs.AI

Construction of Rough graph to handle uncertain pattern from an Information System

classification 💻 cs.AI
keywords roughgraphinformationfunctionmembershippatternsystemuncertain
0
0 comments X
read the original abstract

Rough membership function defines the measurement of relationship between conditional and decision attribute from an Information system. In this paper we propose a new method to construct rough graph through rough membership function $\omega_{G}^F(f)$. Rough graph identifies the pattern between the objects with imprecise and uncertain information. We explore the operations and properties of rough graph in various stages of its structure.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Fuzzy, Neutrosophic, and Uncertain Graph Theory: Properties and Applications

    cs.AI 2026-04 conditional novelty 3.0

    A survey organizing fuzzy, neutrosophic, and plithogenic graph classes and parameters under a unified uncertain-graph framework, with well-definedness proofs for each generalized concept.