PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Silvestri C., Orlando S. Distributed approximate mining of frequent patterns. In: Symposium on Applied Computing (Santa Fe, New Mexico, USA, 13 -17 Marzo 2005). Proceedings, pp. 529 - 536. ACM, 2005.
 
 
Abstract
(English)
This paper discusses a novel communication effcient distributed algorithm for approximate mining of frequent patterns from transactional databases. The proposed algorithm consists in the distributed exact computation of locally frequent itemsets and an effective method for inferring the local support of locally unfrequent itemsets. The combination of the two strategies gives a good approximation of the set of the globally frequent patterns and their supports. Several tests on publicly available datasets were conducted, aimed at evaluating the similarity between the exact result set and the approximate ones returned by our distributed algorithm as well as the scalability of the proposed method.
URL: http://portal.acm.org/ft_gateway.cfm?id=1066796&type=pdf&coll=GUIDE&dl=GUIDE&CFID=13392087&CFTOKEN=70647334
Subject Data Mining
H.0 Information Systems. General
C.2.4 Distributed Systems


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional