%0 Conference Paper %1 1167423 %A Tang, Peiyi %A Ning, Li %A Wu, Ningning %B ACM-SE 43: Proceedings of the 43rd annual Southeast regional conference %C New York, NY, USA %D 2005 %I ACM %K closed-itemsets frequent-patterns %P 250--255 %R http://doi.acm.org/10.1145/1167350.1167423 %T Domain and data partitioning for parallel mining of frequent closed itemsets %U http://portal.acm.org/citation.cfm?id=1167423 %X In this paper, we propose an algorithm to partition both the search space and the database for the parallel mining of frequent closed itemsets in large databases. The partitioning of the search space is based on splitting the power set lattice of the total item set to two sub-lattices. Conditional databases axe used to partition the large database. The combination of the search space and database partitioning allows parallel processors to mine the frequent closed itemsets independently and thus minimizes the interprocessor communication and synchronization. The partitioning also ensures the load balance among the parallel processors. %@ 1-59593-059-0

@inproceedings{1167423, abstract = {In this paper, we propose an algorithm to partition both the search space and the database for the parallel mining of frequent closed itemsets in large databases. The partitioning of the search space is based on splitting the power set lattice of the total item set to two sub-lattices. Conditional databases axe used to partition the large database. The combination of the search space and database partitioning allows parallel processors to mine the frequent closed itemsets independently and thus minimizes the interprocessor communication and synchronization. The partitioning also ensures the load balance among the parallel processors.}, added-at = {2009-05-29T10:26:45.000+0200}, address = {New York, NY, USA}, author = {Tang, Peiyi and Ning, Li and Wu, Ningning}, biburl = {https://www.bibsonomy.org/bibtex/2945b6581dba9c4f43db499fc1ddd5138/claudio.lucchese}, booktitle = {ACM-SE 43: Proceedings of the 43rd annual Southeast regional conference}, description = {Domain and data partitioning for parallel mining of frequent closed itemsets}, doi = {http://doi.acm.org/10.1145/1167350.1167423}, interhash = {916b04c5bf7e9d1b55f6e91c9c0781e1}, intrahash = {945b6581dba9c4f43db499fc1ddd5138}, isbn = {1-59593-059-0}, keywords = {closed-itemsets frequent-patterns}, location = {Kennesaw, Georgia}, pages = {250--255}, publisher = {ACM}, timestamp = {2009-05-29T10:26:45.000+0200}, title = {Domain and data partitioning for parallel mining of frequent closed itemsets}, url = {http://portal.acm.org/citation.cfm?id=1167423}, year = 2005 }