Deakin University
Browse

File(s) under permanent embargo

EFP-M2 : efficient model for mining frequent patterns in transactional database

conference contribution
posted on 2012-01-01, 00:00 authored by T Herawan, A Noraziah, Z Abdullah, M Deris, Jemal AbawajyJemal Abawajy
Discovering frequent patterns plays an essential role in many data mining applications. The aim of frequent patterns is to obtain the information about the most common patterns that appeared together. However, designing an efficient model to mine these patterns is still demanding due to the capacity of current database size. Therefore, we propose an Efficient Frequent Pattern Mining Model (EFP-M2) to mine the frequent patterns in timely manner. The result shows that the algorithm in EFP-M2l is outperformed at least at 2 orders of magnitudes against the benchmarked FP-Growth.

History

Event

Computational Collective Intelligence. Conference (4th : 2012 : Ho Chi Minh City, Vietnam)

Source

Computational collective intelligence : technologies and applications : 4th international conference, ICCCI 2012, Ho Chi Minh City, Vietnam, November 28-30, 2012 : proceedings

Series

Lecture notes in artificial intelligence; Lecture notes in computer science, v7654

Pagination

29 - 38

Publisher

Springer Berlin Heidelberg

Location

Ho Chi Minh City, Vietnam

Place of publication

Berlin, Germany

Start date

2012-11-28

End date

2012-11-30

ISSN

0302-9743

ISBN-13

9783642347061

Language

eng

Publication classification

E1 Full written paper - refereed

Copyright notice

2012, Springer

Extent

56

Editor/Contributor(s)

N Nguyen, K Hoang, P Jedrzejowicz

Title of proceedings

ICCCI 2012 : Technologies and applications : Proceedings of the 4th International Conference on Computational Collective Intelligence, Ho Chi Minh City, Vietnam, November 28-30, 2012 : proceedings

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC