• No results found

A Search Space Reduction Algorithm for Mining Maximal Frequent Itemset

N/A
N/A
Protected

Academic year: 2020

Share "A Search Space Reduction Algorithm for Mining Maximal Frequent Itemset"

Copied!
5
0
0

Loading.... (view fulltext now)

Full text

Loading

Figure

Table 2 : PMFIs of frequent item in database D.
Figure 1 illustrates that, the SSR algorithm passes less number of candidate itemsets and may have better performance when compared to conventional GenMax algorithm

References

Related documents

The variation of gain with fiber length is shown in figure (2.a) for different pump powers having a constant signal input power and erbium doping density. The

This review also informed the design of a quantitative survey examining the impact of the social protection program on food security, livelihoods and poverty in the pastoral

This study also determined which aspect of critical thinking was best or least demonstrated by the students, and examined the correlation between students

Peters3043 4 pm Challenges and strategies for generating therapeutic patient specific hemangioblasts and hematopoietic stem cells from human pluripotent stem cells ANN PETERS1, PAUL

Students who demonstrate satisfactory performance in a core of introductory mathematics courses (as defined below) are granted full admission to the program.. The intent of this

In 1940, Ulam [7] raised the following problem: under what condi- tions does there exist an additive mapping near an approximately additive mapping.. In 1941, this problem was solved

van der Neut et al EURASIP Journal on Advances in Signal Processing 2014, 2014 172 http //asp eurasipjournals com/content/2014/1/172 RESEARCH Open Access PAPR reduction in FBMC using an

The data of HOLMES (1938) indicate that his mosaic resistant race was ob- tained through a mechanism similar to that described above for pink Cuba- that is, by