a parallel space saving algorithm for frequent items and the hurwitz zeta distribution：一个平行空间节约算法的频繁项集和hurwitz zeta分布.pdf

Information Sciences 329 (2016) 1–19 Contents lists available at ScienceDirect Information Sciences journal homepage: /locate/ins A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution a,∗ a b Massimo Cafaro , Marco Pulimeno , Piergiulio Tempesta a University of Salento, Lecce, Italy b Departamento de Física Teórica II, Facultad de Físicas, Universidad Complutense, 28040 – Madrid, Spain and Instituto de Ciencias Matemáticas, C/ Nicolás Cabrera, No 13–15, 28049 Madrid, Spain a r t i c l e i n f o a b s t r a c t Article history: We present a message-passing based parallel version of the Space Saving algorithm designed Received 19 May 2014 to solve the k–majority problem. The algorithm determines in parallel frequent items, i.e., Revised 13 August 2015 those whose frequency is greater than a given threshold, and is therefore useful for iceberg Accepted 3 September 2015 queries and many other different contexts. We apply our algorithm to the detection of fre- Available online 10 September 2015 quent items in both real and synthetic datasets whose probability distribution functions are a Keywords: Hurwitz and a Zipf distribution respectively. Also, we compare its parallel performances and Frequent items accuracy against a parallel algorithm recently proposed for merging summaries derived by the Space saving al