N-Hypersoft Sets: An Innovative Extension of Hypersoft Sets and Their Applications

Abstract

This paper introduces N-hypersoft (N-HS) sets—an enriched and versatile extension of hypersoft (HS) sets—designed to handle evaluations involving both binary and non-binary data while embodying an inherent sense of structural symmetry. The paper presents several algebraic definitions, including incomplete N-HS sets, efficient N-HS sets, normalized N-HS sets, equivalence under normalization, N-HS complements, and HS sets derived from a threshold. These definitions are accompanied by illustrative examples. Additionally, the paper delves into various set-theoretic operations within the framework of N-HS sets, such as relative null/whole N-HS sets, N-HS subsets, and N-HS extended/restricted union and intersection, presented in two different ways. Finally, the paper presents and compares decision-making methodologies regarding N-HS sets.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 25 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.