%0 Journal Article %1 4288138 %A Ji, Liping %A Tan, Kian-Lee %A Tung, A.K.H. %D 2007 %J Knowledge and Data Engineering, IEEE Transactions on %K closed-itemsets parallel %N 9 %P 1175-1187 %R 10.1109/TKDE.2007.1047 %T Compressed Hierarchical Mining of Frequent Closed Patterns from Dense Data Sets %V 19 %X This paper addresses the problem of finding frequent closed patterns (FCPs) from very dense data sets. We introduce two compressed hierarchical FCP mining algorithms: C-Miner and B-Miner. The two algorithms compress the original mining space, hierarchically partition the whole mining task into independent subtasks, and mine each subtask progressively. The two algorithms adopt different task partitioning strategies: C-Miner partitions the mining task based on Compact Matrix Division, whereas B-Miner partitions the task based on Base Rows Projection. The compressed hierarchical mining algorithms enhance the mining efficiency and facilitate a progressive refinement of results. Moreover, because the subtasks can be mined independently, C-Miner and B-Miner can be readily paralleled without incurring significant communication overhead. We have implemented C-Miner and B-Miner, and our performance study on synthetic data sets and real dense microarray data sets shows their effectiveness over existing schemes. We also report experimental results on parallel versions of these two methods.

@article{4288138, abstract = {This paper addresses the problem of finding frequent closed patterns (FCPs) from very dense data sets. We introduce two compressed hierarchical FCP mining algorithms: C-Miner and B-Miner. The two algorithms compress the original mining space, hierarchically partition the whole mining task into independent subtasks, and mine each subtask progressively. The two algorithms adopt different task partitioning strategies: C-Miner partitions the mining task based on Compact Matrix Division, whereas B-Miner partitions the task based on Base Rows Projection. The compressed hierarchical mining algorithms enhance the mining efficiency and facilitate a progressive refinement of results. Moreover, because the subtasks can be mined independently, C-Miner and B-Miner can be readily paralleled without incurring significant communication overhead. We have implemented C-Miner and B-Miner, and our performance study on synthetic data sets and real dense microarray data sets shows their effectiveness over existing schemes. We also report experimental results on parallel versions of these two methods.}, added-at = {2009-04-17T16:27:56.000+0200}, author = {Ji, Liping and Tan, Kian-Lee and Tung, A.K.H.}, biburl = {https://www.bibsonomy.org/bibtex/2dda4f5800ef11dadb2e19debece6a0e8/claudio.lucchese}, description = {Welcome to IEEE Xplore 2.0: Compressed Hierarchical Mining of Frequent Closed Patterns from Dense Data Sets}, doi = {10.1109/TKDE.2007.1047}, interhash = {46cf63323570fa5769b273eaa2bef63b}, intrahash = {dda4f5800ef11dadb2e19debece6a0e8}, issn = {1041-4347}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, keywords = {closed-itemsets parallel}, month = {Sept. }, number = 9, pages = {1175-1187}, timestamp = {2009-04-17T16:27:56.000+0200}, title = {Compressed Hierarchical Mining of Frequent Closed Patterns from Dense Data Sets}, volume = 19, year = 2007 }