With regard to the community mining in weighted signed networks and weighted social networks containing only positive links, the AGMA algorithm has some imperfections in the second clustering of vertices. So some impr...
详细信息
Software’s control flow graph can be treated as a complex software network, and a tiny fraction of key function nodes has considerable influence on the stability, reliability and robustness of the network. Identifyin...
详细信息
Cardinality estimation is the process to survey the quantity of tags in a RFID system. Generally, the cardinality is estimated by exchanging information between reader(s) and tags. To ensure the time efficiency and ac...
详细信息
ISBN:
(纸本)9781467375887
Cardinality estimation is the process to survey the quantity of tags in a RFID system. Generally, the cardinality is estimated by exchanging information between reader(s) and tags. To ensure the time efficiency and accuracy of estimation, numerous probability-based approaches have been proposed, most of which follow a similar way of minimizing the number of required time slots from tags to reader. The overall execution time of the estimator, however, is not necessarily minimized. The estimation accuracy of those approaches also largely depends on the repeated rounds, leading to a dilemma of choosing efficiency or accuracy. In this paper, we propose BFCE, a Bloom Filter based Cardinality Estimator, which only needs a constant number of time slots to meet desired estimation accuracy, regardless of the actual tag cardinality. The overall communication overhead is also significantly cut down, as the reader only needs to broadcast a constant number of messages for parameter setting. Results from extensive simulations under various tag IDs distributions shows that BFCE is accurate and highly efficient. In terms of the overall execution time, BFCE is 30 times faster than ZOE and 2 times faster than SRC in average, the two state-of-the-arts estimation approaches.
Based on a new feature that macro network structure and micro game have mutual inuence on the formation of the community, to mining communities in signed network, a novel algorithm SNCGHC is proposed. Firstly, accordi...
详细信息
The study on signed social networks community detection has been paid more and more attention. Research shows that two-phase signed social networks community detection algorithm can not correctly divide the network. T...
详细信息
Mining important patterns in complex software executing network plays an important role in analyzing software security. The general sequential pattern mining algorithms may lead to poor performance due to the lack of ...
详细信息
In this letter, a periodic autocorrelation signal is presented, which is the ternary sequence pair with two-level autocorrelation. The methods of constructing ternary sequence pairs based on binary sequence pairs and ...
详细信息
Hadoop is a reasonable tool for cloud computing in big data era and MapReduce paradigm may be a highly successful programming model for large-scale data-intensive computing application, but the conventional MapReduce ...
详细信息
In the paper, we present a new method for constructing a class of quaternary sequence pairs with even period 2N from the known binary sequence pairs with odd period N by using the reverse Gray mapping and interleaving...
详细信息
The existing recommendation algorithms have lower robustness against shilling attacks. With this in mind, in this paper we propose a robust recommendation algorithm based on the identification of suspicious users and ...
详细信息
暂无评论