Frequent pattern mining has become an important data mining technique that is mainly focused in many research fields. Frequent patterns are the patterns that appear frequently in the dataset. Several algorithms have been proposed to mine all the frequent item sets in the dataset. These algorithms differ from other algorithms by reducing the number of items in the dataset and in the generation of candidate sets. This paper attempts to propose a new data-mining algorithm for mining all the frequent item sets based on the temporal data which contains the time-stamping information. We propose an efficient algorithm for mining frequent item sets by extending FP-Growth algorithm based on temporal data. Here the concept is that by avoiding the candidate generation. Only the sub-databases are tested.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Mining Frequent Item sets on Large Scale Temporal Data


    Contributors:
    Haseena, S. (author) / Manoruthra, S. (author) / Hemalatha, P. (author) / Akshaya, V. (author)


    Publication date :

    2018-03-01


    Size :

    6573208 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Synthesizing algorithm for mining composite-frequent item sets

    Guohe, L. / Qinping, Z. / Xi, W. | British Library Online Contents | 2004



    Online mining frequent closed itemsets over data stream

    Chun, L. / Zheng, Z. / Kaiyuan, C. et al. | British Library Online Contents | 2008


    Efficient Vertical Quantitative Frequent Pattern Mining

    Wang, B. / Pan, F. / Cui, Y. et al. | British Library Online Contents | 2005


    Frequent Simultaneously Congested Link-Sets Discovery and Ranking

    Ren, J. / Zhang, Y. / Zhang, G. et al. | British Library Conference Proceedings | 2003