Apriori algorithm

Known as: A priori algorithm 
Apriori is an algorithm for frequent item set mining and association rule learning over transactional databases. It proceeds by identifying the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Searching frequent patterns in transactional databases is considered as one of the most important data mining problems and… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Many parallelization techniques have been proposed to enhance the performance of the Apriori-like frequent itemset mining… (More)
  • figure 4
  • figure 10
  • figure 11
  • figure 12
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Finding frequent itemsets is one of the most investigated fields of data mining. The Apriori algorithm is the most established… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 7
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The Apriori algorithm is a popular correlation-based data mining kernel. However, it is a computationally expensive algorithm and… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Apriori and Eclat are the best-known basic algorithms for mining frequent item sets in a set of transactions. In this paper I… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • table 3
Is this relevant?
Highly Cited
2001
Highly Cited
2001
In this paper we propose algorithms for generation of frequent itemsets by successive construction of the nodes of a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
In this paper we propose DCP, a new algorithm for solving the Frequent Set Counting problem, which enhances Apriori. Our goal was… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This paper proposes a novel approach named AGM to e ciently mine the association rules among the frequently appearing… (More)
  • figure 1
  • figure 3
  • table 1
  • figure 6
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?