EFP-M2 : efficient model for mining frequent patterns in transactional database
conference contribution
posted on 2012-01-01, 00:00authored byT 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
Pagination
29-38
Location
Ho Chi Minh City, Vietnam
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)
Nguyen NT, Hoang K, Jedrzejowicz P
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
Event
Computational Collective Intelligence. Conference (4th : 2012 : Ho Chi Minh City, Vietnam)
Publisher
Springer Berlin Heidelberg
Place of publication
Berlin, Germany
Series
Lecture notes in artificial intelligence; Lecture notes in computer science, v7654