No abstract

No abstract

No abstract

One is either on Facebook or not. Of course, this assessment is controversial and its rationale arguable. It is nevertheless not far, for many, from the reason behind joining social media and publishing and sharing details of their professional and private lives. Not only the personal details that may be revealed, but also the structure of the networks are sources of invaluable information for any organization wanting to understand and learn about social groups, their dynamics and members. These organizations may or may not be benevolent. It is important to devise, design and evaluate solutions that guarantee some privacy. One approach that reconciles the different stakeholders' requirement is the publication of a modified graph. The perturbation is hoped to be sufficient to protect members' privacy while it maintains sufficient utility for analysts wanting to study the social media as a whole. In this paper, the authors try to empirically quantify the inevitable trade-off between utility and privacy. They do so for two state-of-the-art graph anonymization algorithms that protect against most structural attacks, the k-automorphism algorithm and the k-degree anonymity algorithm. The authors measure several metrics for a series of real graphs from various social media before and after their anonymization under various settings.

Type-2 systems has been becoming the focus of research in the field of fuzzy logic in recent years. Comparing with type-1 systems, type-2 fuzzy systems are more complex and relatively more difficult to understand and implement. We developed an interactive graphical user interface (GUI) based toolbox, MFLS tool, for interval type-2 fuzzy logic system. This paper presents MFLS toolbox. Moreover, the versatility of the software is demonstrated via an prediction problem.