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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Mining Frequent Item sets on Large Scale Temporal Data


    Beteiligte:
    Haseena, S. (Autor:in) / Manoruthra, S. (Autor:in) / Hemalatha, P. (Autor:in) / Akshaya, V. (Autor:in)


    Erscheinungsdatum :

    2018-03-01


    Format / Umfang :

    6573208 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Understanding spatial concentrations of road accidents using frequent item sets

    Geurts, Karolien / Thomas, Isabelle / Wets, Geert | Elsevier | 2005


    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


    Frequent simultaneously congested link-sets discovery and ranking

    Ren Jiang-tao, / Zhang Yi, / Zhang Guo-hui, et al. | IEEE | 2003