Proceedings of the Fourth International C* Conference on Computer Science and Software Engineering 2011
DOI: 10.1145/1992896.1992902
|View full text |Cite
|
Sign up to set email alerts
|

Fastest association rule mining algorithm predictor (FARM-AP)

Abstract: Association rule mining is a particularly well studied field in data mining given its importance as a building block in many data analytics tasks. Many studies have focused on efficiency because the data to be mined is typically very large. However, while there are many approaches in literature, each approach claims to be the fastest for some given dataset. In other words, there is no clear winner. On the other hand, there is panoply of algorithms and implementations specifically designed for parallel computin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 17 publications
0
3
0
Order By: Relevance
“…If a rule contains quantitative attributes either in antecedent or consequent, then the rule is termed as quantitative association rule (Srikant & Agrawal, 1996;Moreno, Segrera, Lopez, & Polo, 2006). Some efficient algorithms for association rule mining proposed in the literature are: APRIORI (Agrawal & Srikant, 1994), PRICES (Wang & Tjortjis, 2004), ChARM (Zaki & Hsiao, 1999) and CLOSET (Brin, Motwani, & Silverstein, 1997), Elcat (Zaki, 2000), FPgrowth (Han, Pei, Yin, & Mao, 2004), OPUS (Webb, 1995), GUHA (Hajek, Havel, & Chytil, 1966) and FARM-AP (Hooshsadat, Samuel, Patel, & Zalance, 2011). Some algorithms used for frequent item sets generation are: MAFIA (Burdick, Calimlim, Flannick, Gehrke, & Yiu, 2005), TFP (Jianyong, Han, Lu, & Tzvetkov, 2005) and estMax (Woo & Lee, 2009).…”
Section: Association Rule Miningmentioning
confidence: 99%
“…If a rule contains quantitative attributes either in antecedent or consequent, then the rule is termed as quantitative association rule (Srikant & Agrawal, 1996;Moreno, Segrera, Lopez, & Polo, 2006). Some efficient algorithms for association rule mining proposed in the literature are: APRIORI (Agrawal & Srikant, 1994), PRICES (Wang & Tjortjis, 2004), ChARM (Zaki & Hsiao, 1999) and CLOSET (Brin, Motwani, & Silverstein, 1997), Elcat (Zaki, 2000), FPgrowth (Han, Pei, Yin, & Mao, 2004), OPUS (Webb, 1995), GUHA (Hajek, Havel, & Chytil, 1966) and FARM-AP (Hooshsadat, Samuel, Patel, & Zalance, 2011). Some algorithms used for frequent item sets generation are: MAFIA (Burdick, Calimlim, Flannick, Gehrke, & Yiu, 2005), TFP (Jianyong, Han, Lu, & Tzvetkov, 2005) and estMax (Woo & Lee, 2009).…”
Section: Association Rule Miningmentioning
confidence: 99%
“…There is a wide spectrum of algorithms for frequent itemset mining, and none of them outperforms all others for all possible transactional databases and values of minsup threshold [9]. Apriori [1] is one of the most popular itemset mining algorithms, for which many refinements and parallel implementations for various platforms were proposed.…”
Section: Introductionmentioning
confidence: 99%
“…Most of the conventional association rule mining algorithms (HooshSadat et al, 2011;Chi, 2012;Srikant and Agrawal, 1996;Coenen et al, 2004;Sekhavat et al, 2010) are competent to handle Boolean or binary data. These algorithms mine rules from quantitative data as well, by first partitioning into interval and subsequently converting them into Boolean type.…”
Section: Introductionmentioning
confidence: 99%