FAST ALGORITHM FOR MINING ASSOCIATION RULES

By M. Margahny, A. Shakour. 2014

448 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

OpenMEE: Intuitive, open‐source software for meta‐analysis in ecology and evolutionary biology (2017, background): “…epidemiology, management, education, psychology and other social sciences, as well as ecology and evolution (E&E) (e.g. Glass, McGaw & Smith 1981; Agrawal & Srikant 1994; Deeks et al. 2008; Hillebrand & Car-dinale 2010; Koricheva, Gurevitch & Mengersen 2013; McKenzie et al. 2013; Lortie 2014).”
What makes a great MOOC? An interdisciplinary analysis of student retention in online courses (2013, methodology): “In particular, in order to identify the important features, we used the Apriori algorithm (Margahny and Mitwaly 2005) with 1% minimum support.”
A survey of frequent subgraph mining algorithms (2012, methodology): “Input : G = a graph data set, σ = minimum support Output : F 1 , F 2 , · · · , F k , a set of frequent subgraphs of cardinality 1 to k The basic Apriori-based algorithm is presented in 3.1.”