A new approach to the fuzzification of matroids

doi:10.1016/j.fss.2008.05.007

Fuzzy Sets and Systems

Volume 160, Issue 5, 1 March 2009, Pages 696-705

https://doi.org/10.1016/j.fss.2008.05.007 Get rights and content

Abstract

In this paper, the concept of closed fuzzy pre-matroids is generalized to L-fuzzy set theory when L is a complete lattice. It is also called an L-fuzzifying matroid. In the definition of L-fuzzifying matroids, each subset can be regarded as an independent set to some degree. When L is completely distributive, an L-fuzzifying matroid can be characterized by means of its L-fuzzifying rank function. An L-fuzzifying matroid and its L-fuzzifying rank function are one-to-one corresponding.

References (25)

P. Dwinger
Characterizations of the complete homomorphic images of a completely distributive complete lattice I
Indag. Math. (Proc.)
(1982)
D. Gale
Optimal assignments in an ordered set: an application of matroid theory
J. Combin. Theory
(1968)
R. Goetschel et al.
Fuzzy matroids
Fuzzy Sets and Systems
(1988)
R. Goetschel et al.
Bases of fuzzy matroids
Fuzzy Sets and Systems
(1989)
R. Goetschel et al.
Fuzzy rank functions
Fuzzy Sets and Systems
(1991)
H.-L. Huang et al.
L-fuzzy numbers and their properties
Inform. Sci.
(2008)
A. Kasperski et al.
On combinatorial optimization problems on matroids with uncertain weights
European J. Oper. Res.
(2007)
L.A. Novak
A comment on ‘Bases of fuzzy matroids’
Fuzzy Sets and Systems
(1997)
L.A. Novak
On fuzzy independence set systems
Fuzzy Sets and Systems
(1997)
L.A. Novak
On Goetschel and Voxman fuzzy matroids
Fuzzy Sets and Systems
(2001)

M.S. Ying

A new approach for fuzzy topology (I)

Fuzzy Sets and Systems

(1991)

L.A. Zadeh

A computational approach to fuzzy quantifiers in natural languages

Comput. Math. Appl.

(1983)

Cited by (66)

A new approach to generalized neighborhood system-based rough sets via convex structures and convex matroids
2022, Information Sciences
Citation Excerpt :
Matroids proposed by Whitney [33] are very important algebraic structures that generalize linear independence in vector spaces. Up to now, matroids have been widely investigated from the aspects of fuzzifying matroids [24,37], finite complexes and finitary matroids [3,4]. Besides, matroids have been interrelated to rough set theory.
Generalized neighborhood system-based rough sets (GNSs) play a key part in rough set theory. In this paper, we introduce a new approach to GNSs from the aspects of convex structures and convex matroids. Firstly, we propose the concepts of matroidal exterior operators and matroidal interior operators and investigate their relationship with convex matroids, respectively. We prove that there is a one-to-one correspondence among matroidal exterior operators, matroidal interior operators and convex matroids. Secondly, we introduce two new types of GNSs which are called co-directed intersection closed and exchangeable. Then we establish the compatible relationships between convex structures (resp. convex matroids) and co-directed intersection closed (resp. exchangeable) GNSs by using matroidal exterior operators and matroidal interior operators as the linkages. Finally, we present axiomatic characterizations of rough approximation operators corresponding to a co-directed intersection closed generalized neighborhood system operator (gns operator) as well as its combinations with serial, reflexive, weak-transitive and weak-unary gns operators.
Characterizations of L-convex spaces via domain theory
2020, Fuzzy Sets and Systems
Citation Excerpt :
Throughout this article, L is always assumed to be a continuous lattice. The notions and some basic properties of L-closure systems and L-closure operators can be found in many publications (e.g., [4,5,19,21,31]). [2,3,19,21]
We provide some new characterizations of L-convex spaces by using the way-below relation in domain theory. For this purpose, we first study the notion of domain finiteness in the lattice-valued case, and then introduce three kinds of spaces: algebraic L-closure spaces, restricted L-hull spaces, and L-entailment spaces. These three spaces are shown to be categorically isomorphic to L-convex spaces. Additionally, we introduce the notion of L-polytopes and prove that a subcollection of a dense L-convex structure is a base if and only if it contains all L-polytopes. These results indicate that in the study of the theory of (fuzzy) convex spaces, (fuzzy) domain theory has important applications.
Some properties of M-fuzzifying convexities induced by M-orders
2018, Fuzzy Sets and Systems
Citation Excerpt :
It is known that matroids with no loops can be viewed as a special class of finite convexity spaces [6]. Inspired by this fact and the studies of M-fuzzifying matroids [28,29], Shi and Xiu proposed a new approach to the fuzzification of convexity spaces from a different perspective [30], which led to the notion of an M-fuzzifying convexity space (see Definition 2.2). An M-fuzzifying convexity on a set X is an M-fuzzy set on its power set with certain properties, and hence each subset of X can be regarded as a convex set to some degree.
In this paper, the notions of geometric interval spaces, convex geometries, and base-point orders in the theory of convexity spaces are generalized to M-fuzzifying convexity spaces. Using M-fuzzifying restricted hull operators, the M-fuzzifying convexity spaces induced by M-orders are defined conveniently. Then it is shown that M-fuzzifying convexity spaces induced by M-orders are M-fuzzifying JHC and arity ⩽2, and if the M-order is strongly anti-symmetric, then the M-fuzzifying convexity space is an M-fuzzifying convex geometry and its segment operator is an M-fuzzifying geometric interval operator.
Certain types of M-fuzzifying matroids: A fundamental look at the security protocols in RFID and IoT
2018, Future Generation Computer Systems
Security protocols for RFID and IoT are often built on NP-hard problems. The greedy algorithm is an effective method to solve some NP-hard problems. However, the greedy algorithm can get the optimal solution if and only if the structure of the solutions is a matroid. This paper focuses on $M$ -fuzzifying matroids. The notions of acyclic matroids, simple matroids, paving matroids and uniform matroids are generalized to fuzzy setting, which are called $M$ -fuzzifying acyclic matroids, $M$ -fuzzifying simple matroids, fuzzifying paving matroids and fuzzifying uniform matroids, respectively. From the sense of categorical, the relationships between $M$ -fuzzifying matroids, $M$ -fuzzifying acyclic matroids and $M$ -fuzzifying simple matroids are investigated.
A Novel Definition of Fuzzy Difference on Non-increasing Fuzzy Real Numbers
2023, Journal of Physics: Conference Series
(L, M)-fuzzy topological derived internal relations and (L, M)-fuzzy topological derived enclosed relations
2022, Iranian Journal of Fuzzy Systems

View all citing articles on Scopus

View full text

A new approach to the fuzzification of matroids

Abstract

Indag. Math. (Proc.)

J. Combin. Theory

Fuzzy Sets and Systems

Fuzzy Sets and Systems

Fuzzy Sets and Systems

Inform. Sci.

European J. Oper. Res.

Fuzzy Sets and Systems

Fuzzy Sets and Systems

Fuzzy Sets and Systems

Fuzzy Sets and Systems

Comput. Math. Appl.