Triadic Formal Concept Analysis (3FCA) was introduced by Lehman and Wille almost two decades ago. And many researchers work in Data Mining and Formal Concept Analysis using the notions of closed sets, Galois and closure operators, closure systems, but up-to-date even though that different researchers actively work on mining triadic and n-ary relations, a proper closure operator for enumeration ...

This paper presents an original definition of data representativeness. The representativeness of each datum in a dataset is a meaningful notion quantified by a degree computed by aggregating fuzzy subsets. These fuzzy subsets are obtained by fuzzifying data in a robust way. We illustrate the usefulness of the representativeness by presenting applications for statistical location estimation,and ...

In this paper, the fuzzy nonlinear programming problem is discussed. In order to obtain more accurate solution, the properties of fuzzy set and fuzzy number with linear membership function and fuzzy maximum decision maker is utilized to fuzzifying the crisp problem . An example is provided to show the effectiveness of the proposed method.

Because antimatroid closure spaces satisfy the anti-exchange axiom, it is easy to show that they are uniquely generated. That is, the minimal set of elements determining a closed set is unique. A prime example is a discrete geometry in Euclidean space where closed sets are uniquely generated by their extreme points. But, many of the geometries arising in computer science, e.g. the world wide we...

background: the ductus arteriosus connects the main pulmonary trunk to the descending aorta. the incidence of isolated patent ductus arteriosus (pda) in full-term infants is about 1 in 2000. the amplatzer ductal occluder (ado) is recommended for pdas with sizes larger than 2 mm. in this procedure, we must confirm the ado position in pda by aortogram from the arterial line. the purpose of this s...

in this paper, based in the l ukasiewicz logic, the definition offuzzifying soft neighborhood structure and fuzzifying soft continuity areintroduced. also, the fuzzifying soft proximity spaces which are ageneralizations of the classical soft proximity spaces are given. severaltheorems on classical soft proximities are special cases of the theorems weprove in this paper.

Let X,Y be normed spaces. The set of bounded linear operators is noted as L(X,Y ). Let now D = D(A) ⊂ X be a linear subspace, and A : D −→ Y a linear (not necessarily bounded!) operator. Notation: (A,D(A)) : X −→ Y Definition: G(A) := {(x,Ax) |x ∈ D} is called the graph of A. Obviously, G(A) is a linear subspace of X × Y . The linear operator A is called closed if G(A) is closed in X × Y . The ...