Some characteristics of matroids through rough sets

At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid, as a branch of mathematics, is a structure that generalizes linear independence in vector spaces. Further, matroid theory borrows extensively from the terminology of linear algebra and graph theory. We can combine rough set theory with matroid theory through using rough sets to study some characteristics of matroids. In this paper, we apply rough sets to matroids through defining a family of sets which are constructed from the upper approximation operator with respect to an equivalence relation. First, we prove the family of sets satisfies the support set axioms of matroids, and then we obtain a matroid. We say the matroids induced by the equivalence relation and a type of matroid, namely support matroid, is induced. Second, through rough sets, some characteristics of matroids such as independent sets, support sets, bases, hyperplanes and closed sets are investigated.Comment: 13 page

On IVF Approximating Spaces

We introduce the concept of IVF approximating spaces and obtain decision conditions that every IVF topological space is an IVF approximating space

Bipolar quadripartitioned single valued neutrosophic rough set

Here bipolar quadripartitioned single valued neutrosophic rough (BQSVNR) set is introduced. Some basic set theoretic terminologies like constant BQSVNR set, subsethood of two BQSVNR sets are shown. Algebraic operations like union, intersection and complement have also been dened. Dierent types of measure like similarity measure, quasi similarity measure and distance measures between two BQSVNR sets have been discussed with their properties. Again various measures of similarity namely distance based similarity measure, cosine similarity measure, membership function based similarity measure are introduced in this paper. A medical diagonasis problem has been solved using similarity measure at the end

Interval Neutrosophic Rough Sets

This Paper combines interval- valued neutrouphic sets and rough sets. It studies roughness in interval- valued neutrosophic sets and some of its properties. Finally we propose a Hamming distance between lower and upper approximations of interval valued neutrosophic sets

Interval Neutrosophic Rough Sets

This Paper combines interval- valued neutrouphic sets and rough sets. It studies roughness in interval- valued neutrosophic sets and some of its properties. Finally we propose a Hamming distance between lower and upper approximations of interval valued neutrosophic sets

Soft Interval-Valued Neutrosophic Rough Sets

In this paper, we first defined soft intervalvalued neutrosophic rough sets(SIVN- rough sets for short) which combines interval valued neutrosophic soft set and rough sets and studied some of its basic properties. This concept is an extension of soft interval valued intuitionistic fuzzy rough sets( SIVIF- rough sets). Finally an illustartive example is given to verfy the developped algorithm and to demonstrate its practicality and effectiveness

Neutrosophic Theory and its Applications : Collected Papers - vol. 1

Neutrosophic Theory means Neutrosophy applied in many fields in order to solve problems related to indeterminacy. Neutrosophy is a new branch of philosophy that studies the origin, nature, and scope of neutralities, as well as their interactions with different ideational spectra. This theory considers every entity together with its opposite or negation and with their spectrum of neutralities in between them (i.e. entities supporting neither nor ). The and ideas together are referred to as . Neutrosophy is a generalization of Hegel\u27s dialectics (the last one is based on and only). According to this theory every entity tends to be neutralized and balanced by and entities - as a state of equilibrium. In a classical way , , are disjoint two by two. But, since in many cases the borders between notions are vague, imprecise, Sorites, it is possible that , , (and of course) have common parts two by two, or even all three of them as well. Hence, in one hand, the Neutrosophic Theory is based on the triad , , and . In the other hand, Neutrosophic Theory studies the indeterminacy, labelled as I, with In = I for n ≥ 1, and mI + nI = (m+n)I, in neutrosophic structures developed in algebra, geometry, topology etc. The most developed fields of the Neutrosophic Theory are Neutrosophic Set, Neutrosophic Logic, Neutrosophic Probability, and Neutrosophic Statistics - that started in 1995, and recently Neutrosophic Precalculus and Neutrosophic Calculus, together with their applications in practice. Neutrosophic Set and Neutrosophic Logic are generalizations of the fuzzy set and respectively fuzzy logic (especially of intuitionistic fuzzy set and respectively intuitionistic fuzzy logic). In neutrosophic logic a proposition has a degree of truth (T), a degree of indeterminacy (I), and a degree of falsity (F), where T, I, F are standard or non-standard subsets of ]-0, 1+[. Neutrosophic Probability is a generalization of the classical probability and imprecise probability. Neutrosophic Statistics is a generalization of the classical statistics. What distinguishes the neutrosophics from other fields is the , which means neither nor . And , which of course depends on , can be indeterminacy, neutrality, tie (game), unknown, contradiction, vagueness, ignorance, incompleteness, imprecision, etc