نتایج جستجو برای: fuzzifying soft proximity
تعداد نتایج: 162275 فیلتر نتایج به سال:
in this thesis we will present three topics. we define approximate fixed points in fuzzy normed spaces. also we obtain some necessary and sufficient conditions on the existence of? -fixed points for ? > 0. at the continue some results about approximate fixed points for a class of non-expansive maps on g-metric spaces are obtained and we define approximate fixed points in partial metric spa...
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.
Proximity Distribution Kernel is an effective method for bag-offeatues based image representation. In this paper, we investigate the soft assignment of visual words to image features for proximity distribution. Visual word contribution function is proposed to model ambiguous proximity distributions. Three ambiguous proximity distributions is developed by three ambiguous contribution functions. ...
Uncertainty is an inherent property of all living systems. Curiously enough, computational models inspired by biological systems do not take, in general, under consideration this essential aspect of living systems. In this paper, after introducing the notion of a multi-fuzzy set (i.e. an orthogonal approach to the fuzzification of multisets), we introduce two variants of P systems with fuzzy co...
Proximity matrices like kernels or dissimilarity matrices provide nonstandard data representations common in the life science domain. Here we extend fast soft competitive learning to a discriminative and vector labeled learning algorithm for proximity data. It provides a more stable and consistent integration of label information in the cost function solely based on a give proximity matrix with...
The original definition of a topological space given by Hausdorff used neighborhood systems. Lattice-valued maps appear in this context when you identify a topology with a monoid in the Kleisli category of the filter monad on SET. H?hle’s notion of a lattice-valued topology [2] uses the same idea and it’s inspired in the classical lattice-valued topologies. Ltopological spaces are motivated by ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید