Anomaly Detection of Complex Networks Based on Intuitionistic Fuzzy Set Ensemble

Ensemble learning for anomaly detection of data structured into a complex network has been barely studied due to the inconsistent performance of complex network characteristics and the lack of inherent objective function. We propose the intuitionistic fuzzy set（IFS）-based anomaly detection, a new two-phase ensemble method for anomaly detection based on IFS, and apply it to the abnormal behavior detection problem in temporal complex networks.Firstly, it constructs the IFS of a single network characteristic, which quantifies the degree of membership,non-membership and hesitation of each network characteristic to the defined linguistic variables so that makes the unuseful or noise characteristics become part of the detection. To build an objective intuitionistic fuzzy relationship, we propose a Gaussian distribution-based membership function which gives a variable hesitation degree. Then, for the fuzzification of multiple network characteristics, the intuitionistic fuzzy weighted geometric operator is adopted to fuse multiple IFSs and to avoid the inconsistence of multiple characteristics. Finally, the score function and precision function are used to sort the fused IFS. Finally, we carry out extensive experiments on several complex network datasets for anomaly detection, and the results demonstrate the superiority of our method to state-of-the-art approaches, validating the effectiveness of our method.

Area-Based Connected Dominating Set Construction and Maintenance Algorithm in Ubiquitous Stub Environment

In order to construct and maintain stability Connected Dominating Set over MANET in Ubiquitous Stub Network, this paper proposes a novel area-based CDS construction and maintenance algorithm. The algorithm is divided into three phases: 1) Area Partition; 2) Area Expansion; 3) Area Connection. In additional, maintenance strategy is proposed in each phase respectively to handle node mobility with timer. At last, the simulation is implemented with OPNET and MATLAB and the results are analyzed in detailed with Size of CDS, Message Overhead and other indexes.

Cellular traffic offloading utilizing set-cover based caching in mobile social networks

To cope with the explosive data demands, offloading cellular traffic through mobile social networks（MSNs） has become a promising approach to alleviate traffic load. Indeed, the repeated data transmission results in a great deal of unnecessary traffic. Existing solutions generally adopt proactive caching and achieve traffic shifting by exploiting opportunistic contacts. The key challenge to maximize the offloading utility needs leveraging the trade-off between the offloaded traffic and the users＇ delay requirement. Since current caching scheme rarely address this challenge, in this paper, we first quantitatively interpret the offloading revenues on the cellular operator side associated with the scale of caching users, then develop a centralized caching protocol to maximize the offloading revenues, which includes the selective algorithm of caching location based on set-cover, the cached-data dissemination strategy based on multi-path routing and the cache replacement policy based on data popularity. The experimental results on real-world mobility traces show that the proposed caching protocol outperforms existing schemes in offloading scenario.

Extract Rules by Using Rough Set and Knowledge-Based NN

In this paper, rough set theory is used to extract roughly-correct inference rules from information systems. Based on this idea, the learning algorithm ERCR is presented. In order to refine the learned roughly-correct inference rules, the knowledge-based neural network is used. The method presented here sufficiently combines the advanages of rough set theory and neural network.