A comprehensive study of implicator-conjunctor based and noise-tolerant fuzzy rough sets: definitions, properties and robustness analysis

© 2014 Elsevier B.V. Both rough and fuzzy set theories offer interesting tools for dealing with imperfect data: while the former allows us to work with uncertain and incomplete information, the latter provides a formal setting for vague concepts. The two theories are highly compatible, and since the late 1980s many researchers have studied their hybridization. In this paper, we critically evaluate most relevant fuzzy rough set models proposed in the literature. To this end, we establish a formally correct and unified mathematical framework for them. Both implicator-conjunctor-based definitions and noise-tolerant models are studied. We evaluate these models on two different fronts: firstly, we discuss which properties of the original rough set model can be maintained and secondly, we examine how robust they are against both class and attribute noise. By highlighting the benefits and drawbacks of the different fuzzy rough set models, this study appears a necessary first step to propose and develop new models in future research.Lynn D’eer has been supported by the Ghent University Special Research Fund, Chris Cornelis was partially supported by the Spanish Ministry of Science and Technology under the project TIN2011-28488 and the Andalusian Research Plans P11-TIC-7765 and P10-TIC-6858, and by project PYR-2014-8 of the Genil Program of CEI BioTic GRANADA and Lluis Godo has been partially supported by the Spanish MINECO project EdeTRI TIN2012-39348-C02-01Peer Reviewe

Memory effects in microscopic traffic models and wide scattering in flow-density data

By means of microscopic simulations we show that non-instantaneous adaptation of the driving behaviour to the traffic situation together with the conventional measurement method of flow-density data can explain the observed inverse-$\lambda$ shape and the wide scattering of flow-density data in ``synchronized'' congested traffic. We model a memory effect in the response of drivers to the traffic situation for a wide class of car-following models by introducing a new dynamical variable describing the adaptation of drivers to the surrounding traffic situation during the past few minutes (``subjective level of service'') and couple this internal state to parameters of the underlying model that are related to the driving style. % For illustration, we use the intelligent-driver model (IDM) as underlying model, characterize the level of service solely by the velocity and couple the internal variable to the IDM parameter ``netto time gap'', modelling an increase of the time gap in congested traffic (``frustration effect''), that is supported by single-vehicle data. % We simulate open systems with a bottleneck and obtain flow-density data by implementing ``virtual detectors''. Both the shape, relative size and apparent ``stochasticity'' of the region of the scattered data points agree nearly quantitatively with empirical data. Wide scattering is even observed for identical vehicles, although the proposed model is a time-continuous, deterministic, single-lane car-following model with a unique fundamental diagram.Comment: 8 pages, submitted to Physical Review

Eshelby inclusions in granular matter: theory and simulations

We present a numerical implementation of an active inclusion in a granular material submitted to a biaxial test. We discuss the dependence of the response to this perturbation on two parameters: the intra-granular friction coefficient on one hand, the degree of the loading on the other hand. We compare the numerical results to theoretical predictions taking into account the change of volume of the inclusion as well as the anisotropy of the elastic matrix

Graph ambiguity

In this paper, we propose a rigorous way to define the concept of ambiguity in the domain of graphs. In past studies, the classical definition of ambiguity has been derived starting from fuzzy set and fuzzy information theories. Our aim is to show that also in the domain of the graphs it is possible to derive a formulation able to capture the same semantic and mathematical concept. To strengthen the theoretical results, we discuss the application of the graph ambiguity concept to the graph classification setting, conceiving a new kind of inexact graph matching procedure. The results prove that the graph ambiguity concept is a characterizing and discriminative property of graphs. (C) 2013 Elsevier B.V. All rights reserved