Frequent closed itemset mining is among the most complex exploratory techniques in data mining, and provides the ability to discover hidden correlations in transactional datasets. The explosion of Big Data is leading to new parallel and distributed approaches. Unfortunately, most of them are designed to cope with low-dimensional datasets, whereas no distributed high-dimensional frequent closed itemset mining algorithms exists. This work introduces PaMPa-HD, a parallel MapReduce-based frequent closed itemset mining algorithm for high-dimensional datasets, based on Carpenter. The experimental results, performed on both real and synthetic datasets, show the efficiency and scalability of PaMPa-HD
Closed Itemset mining is a major task both in Data Mining and Formal Concept Analysis. It is an effi...
Abstract Due to huge increase in the records and dimensions of available databases pattern mining in...
International audienceMining big datasets poses a number of challenges which are not easily addresse...
Frequent closed itemset mining is among the most complex exploratory techniques in data mining, and ...
In today’s world, large volumes of data are being continuously generated by many scientific applicat...
Traditional data mining tools, developed to extract actionable knowledge from data, demonstrated to ...
Itemset mining is a well-known exploratory data mining technique used to discover interesting correl...
Recently, several algorithms based on the MapReduce framework have been proposed for frequent patter...
Frequent itemset mining is an exploratory data mining technique that has fruitfully been exploited t...
Mining frequent itemsets from large dataset has a major drawback in which the explosive number of it...
International audienceDespite crucial recent advances, the problem of frequent itemset mining is sti...
Mining frequent itemsets from large dataset has a major drawback in which the explosive number of it...
In big data analysis, frequent itemsets mining plays a key role in mining associations, correlations...
International audienceData analytics in general, and data mining primitives in particular , are a ma...
Closed Itemset mining is a major task both in Data Mining and Formal Concept Analysis. It is an effi...
Closed Itemset mining is a major task both in Data Mining and Formal Concept Analysis. It is an effi...
Abstract Due to huge increase in the records and dimensions of available databases pattern mining in...
International audienceMining big datasets poses a number of challenges which are not easily addresse...
Frequent closed itemset mining is among the most complex exploratory techniques in data mining, and ...
In today’s world, large volumes of data are being continuously generated by many scientific applicat...
Traditional data mining tools, developed to extract actionable knowledge from data, demonstrated to ...
Itemset mining is a well-known exploratory data mining technique used to discover interesting correl...
Recently, several algorithms based on the MapReduce framework have been proposed for frequent patter...
Frequent itemset mining is an exploratory data mining technique that has fruitfully been exploited t...
Mining frequent itemsets from large dataset has a major drawback in which the explosive number of it...
International audienceDespite crucial recent advances, the problem of frequent itemset mining is sti...
Mining frequent itemsets from large dataset has a major drawback in which the explosive number of it...
In big data analysis, frequent itemsets mining plays a key role in mining associations, correlations...
International audienceData analytics in general, and data mining primitives in particular , are a ma...
Closed Itemset mining is a major task both in Data Mining and Formal Concept Analysis. It is an effi...
Closed Itemset mining is a major task both in Data Mining and Formal Concept Analysis. It is an effi...
Abstract Due to huge increase in the records and dimensions of available databases pattern mining in...
International audienceMining big datasets poses a number of challenges which are not easily addresse...