A semi-apriori algorithm for discovering the frequent itemsets
Mining the frequent itemsets are still one of the data mining research challenges. Frequent itemsets generation produce extremely large numbers of generated itemsets that make the algorithms inefficient. The reason is that the most traditional approaches adopt an iterative strategy to discover the i...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
Institute of Electrical and Electronics Engineers Inc.
2014
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938765772&doi=10.1109%2fICCOINS.2014.6868358&partnerID=40&md5=43d9806c0645660332a405f83c3f4dc0 http://eprints.utp.edu.my/31244/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Mining the frequent itemsets are still one of the data mining research challenges. Frequent itemsets generation produce extremely large numbers of generated itemsets that make the algorithms inefficient. The reason is that the most traditional approaches adopt an iterative strategy to discover the itemsets, that's require very large process. Furthermore, the present mining algorithms cannot perform efficiently due to high and repeatedly database scan. In this paper we introduce a new binary-based Semi-Apriori technique that efficiently discovers the frequent itemsets. Extensive experiments had been carried out using the new technique, compared to the existing Apriori algorithms, a tentative result reveal that our technique outperforms Apriori algorithm in terms of execution time. © 2014 IEEE. |
|---|