Abstract

Abstract. In today's Internet, there are large amounts of data spreading over many physical distributed nodes which makes it impractical to send all the data to one central node for query processing. Finding distributed frequent items is important for a number of applications such as DDoS attack mitigation and worm detection. In this paper we propose a novel distributed frequent itemmining framework with guaranteed accuracy and lowest communication cost. The theoretical correctness and communication complexity analyses are presented.